Learning by switching type of information

Information and Computation - Tập 185 - Trang 89-104 - 2003
Sanjay Jain1, Frank Stephan2
1School of Computing, National University of Singapore, 3 Science Drive 2, Singapore 117543, Singapore
2Mathematisches Institut, Im Neuenheimer Feld 294, Universität Heidelberg, 69120 Heidelberg, Germany, EU

Tài liệu tham khảo

Angluin, 1987, Learning regular sets from queries and counter-examples, Information and Computation, 75, 87, 10.1016/0890-5401(87)90052-6 Baliga, 1995, Language learning with some negative information, Journal of Computer and System Sciences, 51, 273, 10.1006/jcss.1995.1066 Blum, 1975, Toward a mathematical theory of inductive inference, Information and Control, 28, 125, 10.1016/S0019-9958(75)90261-2 Case, 1999, The power of vacillation in language learning, SIAM Journal of Computing, 28, 1941, 10.1137/S0097539793249694 Case, 1995, Not-so-nearly-minimal-size program inference, vol. 961, 77 Case, 1982, Machine inductive inference and language identification, vol. 140, 107 Case, 1983, Comparison of identification criteria for machine inductive inference, Theoretical Computer Science, 25, 193, 10.1016/0304-3975(83)90061-0 Freivalds, 1993, On the role of procrastination in machine learning, Information and Computation, 107, 237, 10.1006/inco.1993.1068 Fulk, 1990, Prudence and other conditions on formal language learning, Information and Computation, 85, 1, 10.1016/0890-5401(90)90042-G Gasarch, 1989, Learning via queries to an oracle, 214 Mark Gold, 1967, Language identification in the limit, Information and Control, 10, 447, 10.1016/S0019-9958(67)91165-5 V. Harizanov and F. Stephan, On the Learnability of Vector Spaces, Forschungsberichte Mathematische Logik 55/2002, Mathematical Institute, University of Heidelberg, 2002 Jain, 1999 Jain, 1993, On the non-existence of maximal inference degrees for language identification, Information Processing Letters, 47, 81, 10.1016/0020-0190(93)90229-3 S. Jain, W. Menzel, F. Stephan, Classes with easily learnable subclasses. in: Algorithmic Learning Theory: Thirteenth International Conference (ALT 2002), 2002 (To appear) Kleene, 1938, Notations for ordinal numbers, The Journal of Symbolic Logic, 3, 150, 10.2307/2267778 Machtey, 1978 W. Merkle, F. Stephan, Refuting learning revisited. in: Algorithmic Learning Theory: Twelfth International Conference (ALT 2001), vol. 2225, Lecture Notes in Artificial Intelligence, Springer, Berlin, 2001, pp. 299–314 Motoki, 1991, Inductive inference from all positive and some negative data, Information Processing Letters, 39, 177, 10.1016/0020-0190(91)90176-I Osherson, 1986 Rogers, 1967 Sacks, 1990 R. Wiehagen, Identification of formal languages. in: Mathematical Foundations of Computer Science, vol. 53, Lecture Notes in Computer Science, Springer, Berlin, 1977, pp. 571–579