Journal ArticleDOI
Learnability and the Vapnik-Chervonenkis dimension
Reads0
Chats0
TLDR
This paper shows that the essential condition for distribution-free learnability is finiteness of the Vapnik-Chervonenkis dimension, a simple combinatorial parameter of the class of concepts to be learned.Abstract:
Valiant's learnability model is extended to learning classes of concepts defined by regions in Euclidean space En. The methods in this paper lead to a unified treatment of some of Valiant's results, along with previous results on distribution-free convergence of certain pattern recognition algorithms. It is shown that the essential condition for distribution-free learnability is finiteness of the Vapnik-Chervonenkis dimension, a simple combinatorial parameter of the class of concepts to be learned. Using this parameter, the complexity and closure properties of learnable classes are analyzed, and the necessary and sufficient conditions are provided for feasible learnability.read more
Citations
More filters
Proceedings ArticleDOI
The probably approximately correct (PAC) population size of a genetic algorithm
TL;DR: The authors use the PAC framework to derive the size of a GA population that with probability 1-/spl delta/ contains at least one individual /spl epsiv/-close to a target hypothesis or solution.
Journal ArticleDOI
Multi-category intuitionistic fuzzy twin support vector machines with an application to plant leaf recognition
Scindhiya Laxmi,S.K. Gupta +1 more
TL;DR: The intuitionistic fuzzy twin support vector machine for multi-categorization is developed in this paper , which incorporates both structural and empirical risk concepts, and it outperforms well-known existing methods including improved support vector machines, K-nearest neighbor, logistic regression, decision trees, random forests, and multilayer perceptrons.
Journal ArticleDOI
Halfspace learning, linear programming, and nonmalicious distributions
TL;DR: It is proved that, in n dimensions, this linear programming algorithm due to Vaidya learns up to e accuracy with probability 1−e in O((n2/e) log2(n/e)+n3.38 log( n/e)) time, which compares favorably with the best known bound for the perceptron algorithm.
Patent
Feature weight training techniques
TL;DR: In this article, the authors present a technique for updating a classifier model for a multi-class linear classifier, which includes feature weights for each of a plurality of feature and label combinations.
Posted Content
Optimal Quantum Sample Complexity of Learning Algorithms
TL;DR: In this article, it was shown that quantum and classical sample complexity are in fact equal up to constant factors in both the PAC and agnostic models, and that quantum examples are more powerful than classical examples in some fixed-distribution settings.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Journal ArticleDOI
Pattern Classification and Scene Analysis.
Book
Pattern classification and scene analysis
Richard O. Duda,Peter E. Hart +1 more
TL;DR: In this article, a unified, comprehensive and up-to-date treatment of both statistical and descriptive methods for pattern recognition is provided, including Bayesian decision theory, supervised and unsupervised learning, nonparametric techniques, discriminant analysis, clustering, preprosessing of pictorial data, spatial filtering, shape description techniques, perspective transformations, projective invariants, linguistic procedures, and artificial intelligence techniques for scene analysis.