Approximate testing and its relationship to learning

Theoretical Computer Science

Volumn 188, Issue 1-2, 1997, Pages 79-99

  Romanik, Kathleen ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR CORRECTION; LEARNING ALGORITHMS; LEARNING SYSTEMS; MATHEMATICAL MODELS;

APPROXIMATE TESTING; COMPUTATIONAL LEARNING THEORY;

COMPUTATION THEORY;

EID: 0347703073     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00241-1     Document Type: Article

References (15)

1. Y.S. Abu-Mostafa and J.-M. St. Jacques, Information capacity of the Hopfield model, IEEE Trans. Inform. Theory IT-31 (4) (1985) 461-464.
2. M. Anthony, G. Brightwell, D. Cohen and J. Shawe-Taylor, Specification by examples, in: D. Haussler, ed., Proc. 5th ACM Workshop on Computational Learning Theory, Pittsburgh, PA, 27-29 July 1992 (ACM, New York, 1992).
3. G.M. Benedek and A. Itai, Learnability by fixed distributions, in: D. Haussler and L. Pitt, eds., Proc. 1988 Workshop on Computational Learning Theory, MIT, 3-5 August 1988 (Morgan Kaufmann, Los Altos, CA, 1991) 80-90.
4. A. Blumer, A. Ehrenfeucht, D. Haussler and M. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. ACM 36 (4) (1989) 929-965.
5. J.C. Cherniavsky and C.H. Smith, A recursion theoretic approach to program testing, IEEE Trans. Software Eng. SE-13 (7) (1987) 777-784.
6. S.A. Goldman and M.J. Kearns, On the complexity of teaching, J. Comput. System Sci. 50 (1) (1995) 20-31.
7. D. Haussler and E. Welzl, ε-Nets and simplex range queries, Discrete Comput. Geom. 2 (1987) 127-151.
8. J. Jackson and A. Tomkins, A computational model of teaching, in: D. Haussler, ed., Proc. 5th ACM Workshop on Computational Learning Theory, Pittsburgh, PA, 27-29 July 1992 (ACM, New York, 1992).
9. K. Romanik, Approximate testing theory, Ph.D. Thesis, Univ. of Maryland at College Park, College Park, MD, 1992; Tech. Report CS-TR-2947/UMIACS-TR-92-89.
10. K. Romanik and C. Smith, Testing geometric objects, Comput. Geom. Theory Appl. 4 (1994) 157-176.
11. S. Salzberg, A. Delcher, D. Heath and S. Kasif, Learning with a helpful teacher, in: Proc. 12th Internat. Joint Conf. on Artificial Intelligence, Sydney, Australia, August 1991 (Morgan Kaufmann, Los Altos, CA, 1991) 705-711.
12. A. Shinohara and S. Miyano, Teachability in computational learning, in: New Generation Computing, Vol. 8 (Ohmsha, Ltd. and Springer, Berlin, 1991) 337-347.
13. E.D. Sontag, Feedforward nets for interpolation and classification, J. Comput. System Sci. 45 (1) (1992) 20-48.
14. L.G. Valiant, A theory of the learnable, Comm. ACM 27 (11) (1984) 1134-1142.
15. V.N. Vapnik and A.Ya. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16 (2) (1971) 264-280.