|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
29th Annual Symposium on Foundations of Computer Science (FOCS 1988)
White Plains, NY, USA
October 24-October 26
ISBN: 0-8186-0877-3
| ASCII Text | x | ||
| N. Linial, Y. Mansour, R.L. Rivest, "Results on learnability and the Vapnik-Chervonenkis dimension," Foundations of Computer Science, IEEE Annual Symposium on, pp. 120-129, 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 1988. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1988.21930, author = {N. Linial and Y. Mansour and R.L. Rivest}, title = {Results on learnability and the Vapnik-Chervonenkis dimension}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1988}, isbn = {0-8186-0877-3}, pages = {120-129}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21930}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Results on learnability and the Vapnik-Chervonenkis dimension SN - 0-8186-0877-3 SP120 EP129 A1 - N. Linial, A1 - Y. Mansour, A1 - R.L. Rivest, PY - 1988 KW - finite domain KW - learnability KW - Vapnik-Chervonenkis dimension KW - distribution-free model KW - dynamic sampling KW - finite concept set VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
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.
Index Terms:
finite domain, learnability, Vapnik-Chervonenkis dimension, distribution-free model, dynamic sampling, finite concept set
Citation:
N. Linial, Y. Mansour, R.L. Rivest, "Results on learnability and the Vapnik-Chervonenkis dimension," focs, pp.120-129, 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 1988
Usage of this product signifies your acceptance of the Terms of Use.