PAC learning with simple examples

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1046, Issue , 1996, Pages 231-242

  Denis, Fançois ^a   D’Halluin, Cyrille ^a   Gilleron, Rémi ^a  

^a UNIV LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

HIGH PROBABILITY; OCCAM'S RAZOR; PAC LEARNING; PAC LEARNING MODEL; POSITIVE DATA; TARGET CONCEPT;

LEARNING ALGORITHMS;

EID: 84948138336     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_20     Document Type: Conference Paper

References (13)

1. D.Angluin, Inference of reversible languages, J. Assoc. Comput. Mach. 29 (1982) 741-765.
2. D. Angluin, Queries and Concept Learning, Machine Learning 2 (1982) 741-765.
3. G.Benedek and A.Itai, Leamability by fixed ditribution, Proc. 1st ACM Workshop on Computational Learning Theory, (1988) 80-90.
4. A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, S. Rudich, Weakly Learning DNF and Characterizing Statistical Query Learning Using Fourier Analysis, Proc. th 26th ACM Symposium on Theory of Computing, (1994) 253-262.
5. A. Blumer, A. Ehrenfeucht, D. Haussler, and M.K. Warmuth, Occam's Razor, Inform. Proc. Lett. 24 (1987) 377-380.
6. J. Castro, A note on learning decision lists, Report de Recerca, LSI-95-2-R, Dept LSI, UPC, (1995).
7. D.Haussler, M.Kearns, N.Littlestone and M.Warmuth, Equivalence of models for polynomial leamability, Proc. 1st ACM Workshop on Computational Learning Theory, (1988) 42-55.
8. M.Kearns, M.Li, L.Pitt and L.G.Valiant, On the leamability of boolean formulae, Proc. 19th ACM Symposium on Theory of Computing, (1987) 285-295.
9. M.Li and P.Vitányi, Learning simple concepts under simple distributions, SIAM J. Comput. 20 (1991) 911-935.
10. M.Li and P.Vitányi, An introduction to Kolmogorov complexity and its applications, Texts and Monographs in Computer Science, Springer Verlag, (1993).
11. B.K.Natarajan, On learning boolean functions, Proc. 19th ACM Symposium on Theory of Computing, (1987) 296-304.
12. B.K.Natarajan, Machine Learning: a theoretical approach, Morgan Kaufman, (1991).
13. L.G. Valiant, A theory of the learn able, Comm. ACM., (1984) 1134-1142.