The VC-dimension of subclasses of pattern languages

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

Volumn 1720, Issue , 1999, Pages 93-105

  Mitchell, Andrew ^a   Scheffer, Tobias ^b   Sharma, Arun ^a   Stephan, Frank ^c  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

^c UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EFFICIENT LEARNING; NON-ERASING PATTERN; OPTIMAL BOUNDS; PATTERN LANGUAGES; POLYNOMIAL ORDER; VAPNIK-CHERVONENKIS DIMENSIONS; VC DIMENSION;

COMPUTATION THEORY;

EID: 84957053481     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46769-6_8     Document Type: Conference Paper

References (25)

1. D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21:46-62, 1980.
2. D. Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117-135, 1980.
3. P. Auer, R. C. Holte, and W. Maass. Theory and applications of agnostic PAClearning with small decision trees. In Proceedings of the 12th International Conference on Machine Learning, pages 21-29. Morgan Kaufmann, 1995.
4. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. Occam's razor. Information Processing Letters, 24:377-380, 1987.
5. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36(4):929-965, 1989.
6. D. Dobkin, D. Gunopoulos, and S. Kasif. Computing optimal shallow decision trees. In Proceedings of the International Workshop on Mathematics in Artificial Intelligence, 1996.
7. T. Erlebach, P. Rossmanith, H. Stadtherr, A. Steger, and T. Zeugmann. Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. In Ming Li and Akira Maruoka, editors, Algorithmic Learning Theory: Eighth International Workshop (ALT '97), volume 1316 of Lecture Notes in Artificial Intelligence, pages 260-276, 1997.
8. E. M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
9. D. Haussler. Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1):78-150, 1992.
10. K. Hoeffgen, H. Simon, and K. van Horn. Robust trainability of single neurons. Preprint, 1993.
11. M. Kearns and L. Pitt. A polynomial-time algorithm for learning k-variable pattern languages. In R. Rivest, D. Haussler, and M.Warmuth, editors, Proceedings of the Second Annual Workshop on Computational Learning Theory. Morgan Kaufmann, 1989.
12. M. Kearns, R. Schapire, and L. Sellie. Towards efficient agnostic learning. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory, pages 341-352. ACM Press, 1992.
13. K.-I Ko, A. Marron, and W.-G. Tseng. Learning string patterns and tree patterns from examples. In Machine Learning: Proceedings of the Seventh International Conference, pages 384-391, 1990.
14. S. Lange and T. Zeugmann. Monotonic versus non-monotonic language learning. In G. Brewka, K. Jantke, and P. H. Schmitt, editors, Proceedings of the Second International Workshop on Nonmonotonic and Inductive Logic, volume 659 of Lecture Notes in Artificial Intelligence, pages 254-269. Springer-Verlag, 1993.
15. A. Marron. Learning pattern languages from a single initial example and from queries. In D Haussler and L. Pitt, editors, Proceedings of the First Annual Workshop on Computational Learning Theory, pages 345-358. Morgan Kaufmann, 1988.
16. A. Marron and K. Ko. identification of pattern languages from examples and queries. Information and Computation, 74(2), 1987.
17. A. Mitchell. Learnability of a subclass of extended pattern languages. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory. ACM Press, 1998.
18. R. Reischuk and T. Zeugmann. Learning one-variable pattern languages in linear average time. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, pages 198-208. ACM Press, 1998.
19. P. Rossmanith and T. Zeugmann. Learning k-variable pattern languages efficiently stochastically finite on average from positive data. In Proc. 4th International Colloquium on Grammatical Inference (ICGI-98), LNAI 1433, pages 13-24. Springer, 1998.
20. A. Salomma. Patterns (The Formal Language Theory Column). EATCS Bulletin, 54:46-62, 1994.
21. A. Salomma. Return to patterns (The Formal Language Theory Column). EATCS Bulletin, 55:144-157, 1994.
22. R.E. Schapire. Pattern languages are not learnable. In M. Fulk and J. Case, editors, Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 122-129. Morgan Kaufmann, 1990.
23. T. Shinohara. Polynomial time inference of extended regular pattern languages. In RIMS Symposia on Software Science and Engineering, Kyoto, Japan, volume 147 of Lecture Notes in Computer Science, pages 115-127. Springer-Verlag, 1982.
24. T. Shinohara and A. Arikawa. Pattern inference. In Klaus P. Jantke and Steffen Lange, editors, Algorithmic Learning for Knowledge-Based Systems, volume 961 of Lecture Notes in Artificial Intelligence, pages 259-291. Springer-Verlag, 1995.
25. L. Valiant. A theory of the learnable. Communications of the ACM, 27:1134-1142, 1984.