Vacillatory and BC learning on noisy data

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

Volumn 1160, Issue , 1996, Pages 285-298

  Case, John ^a   Jain, Sanjay ^b   Stephan, Frank ^c  

^a University of Delaware   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

MIND CHANGES; NOISY DATA; POSITIVE DATA;

ARTIFICIAL INTELLIGENCE;

EID: 0004513413     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61863-5_53     Document Type: Conference Paper

References (29)

1. Angluin, D. (1980), Inductive inference of formal languages from positive data, Information and Control 45, pp. 117-135.
2. Angluin, D., and Smith, C.H. (1983), Inductive inference: theory and methods, Computing Surveys 15, pp. 237-269.
3. Baliga, G., J. Case, and S. Jain. (1996), Synthesizing enumeration techniques for language learning. In Proceedings of the Ninth Annual Conference on Computational Learning Theory, Desenzano del Garda, Italy. ACM Press, July.
4. Baliga, G., Jain, S., and Sharma, A. (1992), Learning from Multiple Sources of Inaccurate Data, in "Proceedings of the International Workshop on Analogical and Inductive Inference in Dagstuhl Castle, Germany", October 1992, pp. 108-128.
5. Barzdin, J. (1974), Two Theorems on the Limiting Synthesis of Functions, in "Theory of Algorithms and Programs" (in Russian), Latvian State University, Riga, 210, pp. 82-88.
6. Barzdin, J. and Freivalds, R. (1972), On the prediction of general recursive functions. 13:1224-1228.
7. Barzdin, J., and Podnieks, K. (1973), The Theory of Inductive Inference, in "Proceedings of the Mathematical Foundations of Computer Science", Mathematical Institute of the Slovak Academy of Sciences, p. 9-15.
8. Berwick, R. The Acquisition of Syntactic Knowledge. MIT Press, Cambridge, MA, 1985.
9. Blum, M., and Blum, L. (1975), Towards a mathematical theory of inductive inference, Information and Control, 28, pp. 125-155.
10. Case, J. (1988) The power of vacillation, "Proceedings of the 1st Annual ACM Conference on Computational Learning Theory", Morgan Kaufmann Publishers, San Mateo, California, pp. 196-205.
11. Case, J. (1992), The power of vacillation in language learning. Technical Report 93-08, University of Delaware. Expands on [10]; journal version revised for possible publication.
12. Case, J., Jain, S., and Sharma, A. (1994), Vacillatory Learning of Nearly Minimal Size Grammars, Journal of Computer and System Sciences, 49, 189-207.
13. Case, J., Jain, S., and Sharma, A. (1995), Complexity Issues for Vacillatory Function Identification, Information and Computation, 116, 174-192.
14. Case, J., and Lynes, C. (1982), Inductive inference and language identification, in "Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP)", Springer-Verlag, 107-115.
15. Case, J., and Smith, C. (1983), Comparison of Identification Criteria for Machine Inductive Inference, Theoretical Computer Science 25, 193-220.
16. Fulk, M., and Jain, S. (1989), Learning in the presence of inaccurate information, in "Proceedings of the 2nd Annual ACM Conference on Computational Learning Theory," Santa Cruz, July 1989, pp. 175-188, Morgan Kaufmann Publishers.
17. Gasarch, W., and Pleszkoch, M. (1989), Learning via Queries to an Oracle, in "Proceedings of the 2nd Annual ACM Conference on Computational Learning Theory", Morgan Kaufman, Los Altos, California, pp. 214-229.
18. Gold, E.M. (1967), Language identification in the limit, Information and Control 10, pp. 447-474.
19. Kapur, S. and Bilardi, G. (1992), Language learning without overgeneralization. In Proceedings of the Ninth Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, 577.
20. Kapur S., B. Lust, W. Harbert, and G. Martohardjono. (1993), Universal grammar and learnability theory: The case of binding domains and the 'subset principleq In E. Reuland and W. Abraham, editors, Knowledge and Language, volume I, pages 185-216. Kluwer.
21. Lange, S. and Zeugmann, T. (1993), Monotonic versus non-monotonic language learning. In Proceedings of the Second International Workshop on Nonmonotonic and Inductive Logic, pages 254-269. Lecture Notes in Artificial Intelligence, 659.
22. Lange, S., and Zeugmann, T. (1992), Types of monotonic language learning and their characterization, in Proceedings of the 5th Annual ACM Conference on Computational Learning Theory, Pittsburgh, July, pp. 377-390, ACM Press, New York.
23. Lange, S., Zeugmann, T., and Kapur, S. (1992), Monotonic and dual monotonic language learning, to appear in Theoretical Computer Science. A preliminary version appeared as GOSLERReport 14/94, TH Leipzig, FB Mathematik und Informatik, August 1992.
24. Mukouchi, Y. (1992), Characterization of finite identification. In K. P. Jantke, editor, Proceedings of the Third International Workshop on Analogical and Inductive Inference, Dagstuhl Castle, Germany, pages 260-267, October.
25. Odifreddi, P. (1989), "Classical Recursion Theory", North-Holland, Amsterdam.
26. Osherson, D., Stob, M., and Weinstein, S. (1986), "Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists," MiT-Press, Cambridge, Massachusetts.
27. Soare, R. (1987), Recursively Enumerable Sets and Degrees, Springer-Verlag, Heidelberg.
28. Stephan, F. (1995), Noisy Inference and Oracles, in "Proceedings of the 6th International Workshop on Algorithmic Learning Theory (ALT)', Springer-Verlag, Lecture Notes on Artificial Intelligence 997, pp. 185-200.
29. Wexler, K. (1993), The subset principle is an intensional principle. In E. Reuland and W. Abraham, editors, Knowledge and Language, volume I, pages 217-239. Kluwer.