Efficient agnostic PAC-learning with simple hypotheses

Proceedings of the Annual ACM Conference on Computational Learning Theory

Volumn Part F129415, Issue , 1994, Pages 67-75

  Maass, Wolfgang ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; LEARNING SYSTEMS; OPTIMIZATION;

APPLIED MACHINE LEARNING; EMPIRICAL STUDIES; PAC LEARNING; PREDICTION RULES; REAL-WORLD; SIMPLE TYPES; TRAINING SETS;

APPROXIMATION ALGORITHMS;

EID: 84958088127     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/180139.181016     Document Type: Conference Paper

References (22)

1. D. Angluin, P. Laird, Learning from noisy examples, Machine Learning, vol. 2, 1988, 343-370
2. W. Buntine, T. Niblett, A further com-parison of splitting rules for decision-tree induction, Machine Learning, vol. 8, 1992, 75-82
3. S. E. Decatur, Statistical queries and faulty PAC oracles, Proc. of the 6th ACM Conference on Computational Learning Theory, 1993, 262-268
4. D. P. Dobkin, D. Gunopulos, Comput-ing the rectangle discrepancy (video), 3rd Annual Video Review of Computational Geometry
5. D. P. Dobkin, D. Gunopulos, Comput-ing the rectangle discrepancy, Tech Report 443-94, Princeton University
6. D. Haussler, Decision theoretic general-izations of the PAC-model for neural nets and other learning applications, Inf. and Comp., vol. 100, 1992, 78-150
7. K. U. Hoeffgen, H. U. Simon, K. S. Van Horn, Robust trainability of single neurons, preprint (1993)
8. R. C. Holte, Very simple classification rules perform well on most commonly used datasets, Machine Learning, vol. 11, 1993, 63-91
9. M. Kearns, Efficient noise-tolerant learn-ing from statistical queries, Proc. of the 25th ACM Symp. on the Theory of Computing, 1993, 392-401
10. M. Kearns, M. Li, Learning in the pres-ence of malicious errors, SIAM J. Corn-put., vol. 22, 1993, 807-837
11. M. J. Kearns, R. E. Schapire, Efficient distribution-free learning of probabilistic concepts, Proc. of the 31st Annual IEEE Symp. on Foundations of Computer Science, 1990, 382-391
12. M. J. Kearns, R. E. Schapire, L. M. Sellie, Toward efficient agnostic learning, Proc. of the 5th ACM Workshop on Computational Learning Theory, 1992, 341-352
13. J. Mingers, An empirical comparision of pruning methodes for decision tree induction, Machine Learning, vol. 4, 1989, 227-243
14. K. Mehlhorn, Multi-Dimensional Searching and Computational Geometry, Springer, 1984
15. F. P. Preparata, M. I. Shamos, Computa-tional Geometry, Springer, 1985
16. J. R. Quinlan, C4-5: Programs for Ma-chine Learning, Morgan Kaufmann, 1992
17. M. Talagrand, Sharper bounds for em-pirical processes, to appear in Annals of Probability and its Applications
18. L. G. Valiant, A theory of the learnable, Comm. of the ACM, vol. 27, 1984, 1134-1142
19. L. G. Valiant, Learning disjunctions of conjunctions, Proc. of the 9th Intern. Joint Conf. on Art. Int., 1985, 560-566
20. S. M. Weiss, R. Galen, P. V. Tadepalli, Maximizing the predictive value of production rules, Art. Int., vol. 45, 1990, 47-71
21. S. M. Weiss, I. Kapouleas, An empirical comparison of pattern recognition, neural nets, and machine learning classification methods, Proc. of the 11th Int. Joint Conf. on Art. Int. 1990, Morgan Kaufmann, 781-787
22. S. M. Weiss, C. A. Kulikowski, Computer Systems that Learn, 1991, Morgan Kaufmann