ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension
Source Annual Workshop on Computational Learning Theory archive
Proceedings of the fourth annual workshop on Computational learning theory table of contents
Santa Cruz, California, United States
Pages: 61 - 74  
Year of Publication: 1991
ISBN:1-55860-213-5
Authors
Sponsors
Office Naval Research : ONR
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
Morgan Kaufmann Publishers Inc.  San Francisco, CA, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 12
Additional Information:

cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

CITED BY  12

Collaborative Colleagues:
David Haussler: colleagues
Michael Kearns: colleagues
Robert Schapire: colleagues