General bounds on the number of examples needed for learning probabilistic concepts

Journal of Computer and System Sciences

Volumn 52, Issue 2, 1996, Pages 239-254

  Simon, Hans Ulrich ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; LEARNING SYSTEMS; MATHEMATICAL MODELS; PROBABILITY; TREES (MATHEMATICS);

PROBABILISTIC CONCEPT; SPLITTING TREES;

LEARNING ALGORITHMS;

EID: 0030128944     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0019     Document Type: Article

References (17)

1. N. Abe and M. K. Warmuth, On the computational complexity of approximating distributions by probabilistic automata, in "Proceedings, 3rd Annual Workshop on Computational Learning Theory," pp. 52-66, Kaufmann, Los Angeles, CA, 1990.
2. N. Alon, S. Ben-David, N. Cesa-Bianchi, and D. Haussler, Scale-sensitive dimensions, uniform convergence, and learnability, in "Proceedings, 34th Symposium on Foundations of Computer Science," pp. 292-302, IEEE Comput. Soc. Los Alamitos, CA, 1993.
3. D. Angluin and P. Laird, Learning from noisy examples, Mach. Learning 2, No. 4 (1988), 343-370.
4. S. Ben-David, N. Cesa-Bianchi, and P. M. Long, Characterizations of learnability for classes of {0, ..., n}-valued functions, in "Proceedings, 5th Annual Workshop on Computational Learning Theory," pp. 333-418, Assoc. Comput. Mach., New York, 1992.
5. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. Assoc. Comput. Mach. 36, No. 4 (1989), 929-965.
6. R. O. Duda and P. E. Hart, "Pattern Classification and Scene Analysis," Wiley-Interscience, New York, 1973.
7. A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant, A general lower bound on the number of examples needed for learning, Inform. and Comput. 82, No. 3 (1989), 247-261.
8. W. Feller, "An Introduction to Probability Theory and its Applications," Vol. 1, 3rd ed., Wiley, New York, 1968.
9. D. Haussler, Decision theoretic generalizations of the PAC model for neural net and other learning applications, Inform. and Comput. 100, No. 1 (1992), 78-150.
10. M. J. Kearns and R. E. Schapire, Efficient distribution-free learning of probabilistic concepts, in "Proceedings, 31th Annual Symposium on the Foundations of Computer Science," pp. 382-392; J. Comput. System Sci., to appear.
11. M. J. Kearns and R. E. Schapire, Efficient distribution-free learning of probabilistic concepts, in "Proceedings, 31th Annual Symposium on the Foundations of Computer Science," pp. 382-392; J. Comput. System Sci., to appear.
12. P. Liard, "Learning from Good and Bad Data," Kluwer Academic, Boston, 1988.
13. B. K. Natarajan, On learning sets and functions, Mach. Learning 4, No. 1 (1989), 67-97.
14. D. Pollard, "Convergence of Stochastic Processes," Springer-Verlag, New York/Berlin, 1984.
15. R. Rivest, Learning decision lists, Mach. Learning 2, No. 3 (1987), 229-246.
16. L. G. Valiant, A theory of the learnable, Commun. ACM 27, No. 11 (1984), 1134-1142.
17. Yamanishi, A learning criterion for stochastic rules, Mach. Learning 9 (1992), 165-203.