Complexity of computing Vapnik-Chervonenkis dimension

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

Volumn 744 LNAI, Issue , 1993, Pages 279-287

  Shinohara, Ayumi ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

COMPUTABLE SETS; CONCEPT CLASS; CONJUNCTIVE NORMAL FORMS; DECISION PROBLEMS; PAC LEARNING MODEL; POLYNOMIAL-TIME; SATISFIABILITY PROBLEMS; VAPNIK-CHERVONENKIS DIMENSIONS;

POLYNOMIAL APPROXIMATION;

EID: 0040666498     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57370-4_54     Document Type: Conference Paper

References (8)

1. S. Ben-David, N. Cesa-Bianchi, and P.M. Long. Characterizations of learnability for classes of {0,…, n}-valued functions. In Proc. 5th Annual Workshop on Computational Learning Theory, pages 333-340, 1992.
2. A. Blumer, A. Ehrenfeucht, D. Haussler, and M.K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. JACM, 36(4):929-965, 1989.
3. N. Linial, Y. Mansour, and R.L. Rivest. Results on learnability and the Vapnik-Chervonenkis dimension. Information and Computation, 90:33-49, 1991.
4. N. Megiddo and U. Vishkin. On finding a minimum dominating set in a tournament. Theoretical Computer Science, 61:307-316, 1988.
5. B.K. Natarajan. Machine Learning — A Theoretical Approach. Morgan Kaufmann Publishers, 1991.
6. S.H. Nienhuys-Cheng and M. Polman. Complexity dimensions and learnability. In Proc. European Conference on Machine Learning, (Lecture Notes in Artificial Intelligence 667), pages 348-353, 1993.
7. K. Romanik. Approximate testing and learnability. In Proc. 5th Annual Workshop on Computational Learning Theory, pages 327-332, 1992.
8. L.G. Valiant. A theory of the learnable. CACM, 27(11):1134-1142, 1984.