DocumentCode
3174243
Title
Results on learnability and the Vapnik-Chervonenkis dimension
Author
Linial, Nathan ; Mansour, Yishay ; Rivest, Ronald L.
Author_Institution
IBM Almaden Res. Center, San Jose, CA, USA
fYear
1988
fDate
24-26 Oct. 1988
Firstpage
120
Lastpage
129
Abstract
The problem of learning a concept from examples in a distribution-free model is considered. The notion of dynamic sampling, wherein the number of examples examined can increase with the complexity of the target concept, is introduced. This method is used to establish the learnability of various concept classes with an infinite Vapnik-Chervonenkis (VC) dimension. An important variation on the problem of learning from examples, called approximating from examples, is also discussed. The problem of computing the VC dimension of a finite concept set defined on a finite domain is considered.<>
Keywords
learning systems; Vapnik-Chervonenkis dimension; distribution-free model; dynamic sampling; finite concept set; finite domain; learnability; Computer science; Distributed computing; Electronic mail; Error analysis; Probability distribution; Sampling methods; Time measurement;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1988., 29th Annual Symposium on
Conference_Location
White Plains, NY, USA
Print_ISBN
0-8186-0877-3
Type
conf
DOI
10.1109/SFCS.1988.21930
Filename
21930
Link To Document