• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 8,284
Next 10 →

The Bivariate Marginal Distribution Algorithm

by Martin Pelikan, Heinz Mühlenbein , 1999
"... The paper deals with the Bivariate Marginal Distribution Algorithm (BMDA). BMDA is an extension of the Univariate Marginal Distribution Algorithm (UMDA). It uses the pair gene dependencies in order to improve algorithms that use simple univariate marginal distributions. BMDA is a special case of the ..."
Abstract - Cited by 114 (22 self) - Add to MetaCart
The paper deals with the Bivariate Marginal Distribution Algorithm (BMDA). BMDA is an extension of the Univariate Marginal Distribution Algorithm (UMDA). It uses the pair gene dependencies in order to improve algorithms that use simple univariate marginal distributions. BMDA is a special case

Large Margin Distribution Machine

by Teng Zhang, Zhi-hua Zhou
"... Support vector machine (SVM) has been one of the most popular learning algorithms, with the central idea of maxi-mizing the minimum margin, i.e., the smallest distance from the instances to the classification boundary. Recent theo-retical results, however, disclosed that maximizing the min-imum marg ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
-imum margin does not necessarily lead to better general-ization performances, and instead, the margin distribution has been proven to be more crucial. In this paper, we pro-pose the Large margin Distribution Machine (LDM), which tries to achieve a better generalization performance by opti-mizing the margin

Further Results on the Margin Distribution

by John Shawe-taylor, Nello Cristianini - In Proc. 12th Annu. Conf. on Comput. Learning Theory , 1999
"... A number of results have bounded generalization of a classifier in terms of its margin on the training points. There has been some debate about whether the minimum margin is the best measure of the distribution of training set margin values with which to estimate the generalization. Freund and Schap ..."
Abstract - Cited by 35 (9 self) - Add to MetaCart
A number of results have bounded generalization of a classifier in terms of its margin on the training points. There has been some debate about whether the minimum margin is the best measure of the distribution of training set margin values with which to estimate the generalization. Freund

Margin Distribution and Soft Margin

by John Shawe-taylor, Nello Cristianini , 1999
"... this paper that minimising this new criterion can be performed efficiently. ..."
Abstract - Cited by 16 (3 self) - Add to MetaCart
this paper that minimising this new criterion can be performed efficiently.

Large Margin Distribution Learning

by Zhi-hua Zhou
"... Abstract. Support vector machines (SVMs) and Boosting are possibly the two most popular learning approaches during the past two decades. It is well known that the margin is a fundamental issue of SVMs, whereas recently the margin theory for Boosting has been defended, establish-ing a connection betw ..."
Abstract - Add to MetaCart
between these two mainstream approaches. The recent theoretical results disclosed that the margin distribution rather than a single margin is really crucial for the generalization performance, and suggested to optimize the margin distribution by maximizing the mar-gin mean and minimizing the margin

Marginal Distributions in Evolutionary Algorithms

by Martin Pelikan, Heinz Mühlenbein - In Proceedings of the International Conference on Genetic Algorithms Mendel ’98 , 1999
"... In this paper, the description of two gene pool recombination operators is described. Both operators are based on the estimation of the distribution of the parents and its use to generate new individuals. The Univariate Marginal Distribution Algorithm (UMDA) uses simple univariate distributions. ..."
Abstract - Cited by 12 (0 self) - Add to MetaCart
In this paper, the description of two gene pool recombination operators is described. Both operators are based on the estimation of the distribution of the parents and its use to generate new individuals. The Univariate Marginal Distribution Algorithm (UMDA) uses simple univariate distributions

Margin Distribution Bounds on Generalization

by John Shawe-taylor, Nello Cristianini , 1998
"... A number of results have bounded generalization of a classifier in terms of its margin on the training points. There has been some debate about whether the minimum margin is the best measure of the distribution of training set margin values with which to estimate the generalization. Freund and Schap ..."
Abstract - Cited by 16 (4 self) - Add to MetaCart
A number of results have bounded generalization of a classifier in terms of its margin on the training points. There has been some debate about whether the minimum margin is the best measure of the distribution of training set margin values with which to estimate the generalization. Freund

Relativistic properties of marginal distributions

by Stefano Mancini, Vladimir I. Man’ko, Paolo Tombesi - Phys. Scr , 1998
"... We study the properties of marginal distributions-projections of the phase space representation of a physical system-under relativistic transforms. We consider the Galileo case as well as the Lorentz transforms exploiting the relativistic oscillator model used for describing the mass spectrum of ele ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We study the properties of marginal distributions-projections of the phase space representation of a physical system-under relativistic transforms. We consider the Galileo case as well as the Lorentz transforms exploiting the relativistic oscillator model used for describing the mass spectrum

Boosting the margin: A new explanation for the effectiveness of voting methods

by Robert E. Schapire, Yoav Freund, Peter Bartlett, Wee Sun Lee - IN PROCEEDINGS INTERNATIONAL CONFERENCE ON MACHINE LEARNING , 1997
"... One of the surprising recurring phenomena observed in experiments with boosting is that the test error of the generated classifier usually does not increase as its size becomes very large, and often is observed to decrease even after the training error reaches zero. In this paper, we show that this ..."
Abstract - Cited by 897 (52 self) - Add to MetaCart
that this phenomenon is related to the distribution of margins of the training examples with respect to the generated voting classification rule, where the margin of an example is simply the difference between the number of correct votes and the maximum number of votes received by any incorrect label. We show

D.: Margin distribution and learning algorithms

by Ashutosh Garg, Dan Roth - In: Proceedings of the 12th Conference on Computational Learning Theory , 1999
"... Recent theoretical results have shown that im-proved bounds on generalization error of clas-siers can be obtained by explicitly taking the observed margin distribution of the training data into account. Currently, algorithms used in prac-tice do not make use of the margin distribution and are driven ..."
Abstract - Cited by 12 (0 self) - Add to MetaCart
Recent theoretical results have shown that im-proved bounds on generalization error of clas-siers can be obtained by explicitly taking the observed margin distribution of the training data into account. Currently, algorithms used in prac-tice do not make use of the margin distribution
Next 10 →
Results 1 - 10 of 8,284
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University