Journal ArticleDOI
Learnability and the Vapnik-Chervonenkis dimension
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
Posted Content
Attribute-Efficient Learning of Halfspaces with Malicious Noise: Near-Optimal Label Complexity and Noise Tolerance
Jie Shen,Chicheng Zhang +1 more
TL;DR: In this article, a computationally efficient active learning algorithm with near-optimal label complexity was proposed for homogeneous sparse halfspaces under malicious noise, where an adversary may corrupt both the unlabeled examples and the labels.
Journal ArticleDOI
Unimprovable upper bounds on time complexity of decision trees
TL;DR: The paper is devoted to investigation of behavior of global Shannon functions which produce unimprovable upper bounds on time complexity of decision trees over arbitrary information systems.
Proceedings Article
BONSAI Garden: parallel knowledge discovery system for amino acid sequences.
Takayoshi Shoudai,Michael Lappe,Satoru Miyano,Ayumi Shinohara,Takeo Okazaki,Setsuo Arikawa,Tomoyuki Uchida,Shinichi Shimozono,Takeshi Shinohara,Satoru Kuhara +9 more
TL;DR: In this paper, a machine discovery system BON-SAI which receives positive and negative examples as inputs and produces as a hypothesis a pair of a decision tree over regular patterns and an alphabet indexing was developed.
Proceedings ArticleDOI
Leva: Boosting Machine Learning Performance with Relational Embedding Data Augmentation
Zixuan Zhao,Raul Fernandez +1 more
TL;DR: Lva builds a relational embedding by representing relational data as a graph and then using embedding methods to represent the graph as vectors, and it is shown that the supervision signal from the downstream task filters out information that is not useful.
Proceedings ArticleDOI
EPTAS for Max Clique on Disks and Unit Balls
TL;DR: In this article, a polynomial-time algorithm was proposed for computing the independence number on graphs having no disjoint union of two odd cycles as an induced subgraph, bounded VC-dimension, and linear independence number.
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.