Concept learning with geometric hypotheses

Proceedings of the 8th Annual Conference on Computational Learning Theory, COLT 1995

Volumn 1995-January, Issue , 1995, Pages 329-336

  Dobkin, David P ^a   Gunopulos, Dimitrios ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

CONCEPT LEARNING; PAC LEARNING; SET SYSTEM; THREE DIMENSIONS; VC DIMENSION;

APPROXIMATION ALGORITHMS;

EID: 84961365937     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/225298.225338     Document Type: Conference Paper

References (22)

1. D. Angluin and P. Laird, Learning from noisy examples. Machine Learning, 2(1988), 343-370.
2. W. Buntine and T. Niblett, A further comparison of splitting rules for decision-tree induction. Machine Learning, 8(1992), 75-82.
3. B. Chazelle, Geometric Discrepancy Revisited. 34th IEEE Syrup. Foundat. Computer Science (1993).
4. M. deBerg, Computing Half-Plane and Strip Discrepancy of Planar Point Sets. Manuscript, (1994).
5. D. Dobkin, D. Eppstein and D. Mitchell Computing the Discrepancy with Applications to Supersampling Patterns. ACM Transactions on Graphics, to appear.
6. D. Dobkin, D. Gunopulos and W. Maass, Computing the maximum Bichromatic Discrepancy, with applications in Computer Graphics and Machine Learning. JCSS, to appear.
7. H. Edelsbrunner and L. J. Guibas, Topologically Sweeping an Arrangement. JCSS, 38, 165-194 (1989).
8. P. Fisher, Learning unions of convex polygons. Proc. of EURO-COLT'93, 1993.
9. P. Fisher, More or Less Efficient Agnostic Learning of Convex Polygons, these proceedings (COLT-95), to appear.
10. D. Haussler, Decision theoretic generations of the PAC-model for neural nets and other applications. Inf. and Comp., 100(1992), 78-150.
11. R. C. Holte, Very simple classification rules perform well on most commonly used datasets. Machine Learning, 11(1993), 63-91.
12. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979).
13. M. Kearns, R. E. Schapire and L. M. Sellie, Toward efficient agnostic learning. 5th ACM Workshop on Computational Learning Theory (1992) 341-352.
14. W. Maass, Efficient Agnostic PAC-Learning with Simple Hypotheses. 7th Ann. ACM Conference on Computational Learning Theory (1994), 67-75.
15. W. Maass, private communication.
16. J. Matousek, E. Welzl and L. Wernish, Discrepancy and ∈-approximations for bounded VC-dimension. 25th ACM Symp. on Theory of Computing (1993), 424-430.
17. L. G. Valiant, A theory of the learnable. Coram, of the ACM 27(1984), 1134-1142.
18. V. N. Vapnik and A. Ya. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Applic. 16(1971), 264-280.
19. S. M. Weiss, R. Galen and P. V. Tadepalli, Maximizing the predictive value of production rules. Art. Int. 45(1990), 47-71.
20. S. M. Weiss and I. Kapouleas, An empirical comparison of pattern recognition, neural nets, and machine learning classification methods. 11th Int. Joint Conf. on Art. Int. (1990), Morgan Kauffmann, 781-787.
21. S. M. Weiss and C. A. Kulikowski, Computer Systems that Learn (1991), Morgan Kauffmann.
22. E. Welzl, personal communication.