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
Statistical performance verification for an autonomous rotorcraft
TL;DR: An approach to verifying the performance of an intelligent control algorithm for which traditional, deterministic verification is not feasible is presented, based on statistical learning theory, which develops a classifier based on simulation data to partition the potential operating region of a system under control into acceptable and unacceptable subregions.
Book ChapterDOI
MC-TopLog: complete multi-clause learning guided by a top theory
TL;DR: A simplified version of grammar learning is used to show how a complete method can improve on the learning results of an incomplete method, and a method called ⊤-directed theory co-derivation is introduced, which is shown to be correct and sound.
Journal ArticleDOI
Learning separations by Boolean combinations of half-spaces
TL;DR: The authors provide an on-line learning algorithm that incrementally solves the problem of the separation function from a finite set of examples by suitably training a system of N perceptrons much in the spirit of the classical perceptron learning algorithm.
Journal ArticleDOI
Valid Generalisation from Approximate Interpolation
TL;DR: The conditions that are necessary and sufficient for H to validly generalise C from approximate interpolation are found and bounds on the sample length m0(η, , δ) are obtained in terms of various parameters describing the expressive power of H.
Journal ArticleDOI
The synthesis of compact fuzzy neural circuits
TL;DR: The tool assisting this synthesis, TROUT, optimizes FMM learning parameters to produce the smallest circuit offering the highest input vector throughout, and outlines the synthesis process and provides a circuit example based on the public domain wine classification data set.
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.