IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | 

Close category search window
Author Searchbeta |  Advanced Search  |  Preferences |  Search Tips  |  More Search Options  
 
Browse Books & eBooks > An Introduction to Computatio... Help

The Vapnik-Chervonenkis Dimension

Full Text Sign-In or Purchase

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$15 $15
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing! close button
puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kearns, M. ; Vazirani, U.

This chapter contains section titled: When Can Infinite Classes Be Learned with a Finite Sample?, The Vapnik-Chervonenkis Dimension, Examples of the VC Dimension, Polynomial Bound on |Πc(S)|, A Polynomial Bound on the Sample Size for PAC Learning, Sample Size Lower Bounds, An Application to Neural Networks, Exercises, Bibliographic Notes

Book Title :
An Introduction to Computational Learning Theory
Publisher :
MIT Press
Edition :
1
Pages :
49 - 71
Copyright Year :
1994
ISBN :
9780262276863
Product Type :
MITP Books & eBooks

IEEE Account

Purchase Details

Profile Information

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.