Encyclopedia of Machine Learning

2010 Edition
| Editors: Claude Sammut, Geoffrey I. Webb

Epsilon Nets

  • Thomas Zeugmann
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-30164-8_257


Epsilon nets were introduced by Haussler and Welz (1987) and their usefulness for computational learning theory has been discovered by Blumer, Ehrenfeucht, Haussler, & Warmuth (1989).

Let X be any learning domain and let \(\mathcal{C}\subseteq \wp (X)\)

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989). Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36(4), 929–965.zbMATHMathSciNetCrossRefGoogle Scholar
  2. Haussler, D., & Welz, E. (1987). Epsilon nets and simplex range queries. Discrete & Computational Geometry, 2, 127–151.zbMATHMathSciNetCrossRefGoogle Scholar
  3. Kearns, M. J., & Vazirani, U. V. (1994). An introduction to computational learning theory. Cambridge, MA: MIT Press.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Thomas Zeugmann

There are no affiliations available