On the power of incremental learning

Theoretical Computer Science

Volumn 288, Issue 2, 2002, Pages 277-307

  Lange, Steffen ^a   Grieser, Gunter ^b  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATABASE SYSTEMS; FEEDBACK; INFORMATION ANALYSIS; ITERATIVE METHODS; LEARNING ALGORITHMS; SPURIOUS SIGNAL NOISE;

INCREMENTAL LEARNING;

LEARNING SYSTEMS;

EID: 0037120726     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00404-2     Document Type: Conference Paper

References (33)

1. Angluin D. Finding patterns common to a set of strings. J. Comput. System Sci. 21:1980;46-62.
2. Angluin D. Inductive inference of formal languages from positive data. Inform. Control. 45:1980;117-135.
3. Blum L., Blum M. Toward a mathematical theory of inductive inference. Inform. Control. 28:1975;122-155.
4. Case J., Jain S. Synthesizing learners tolerating computable noisy data. Proc. 9th Internat. Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence. Vol. 1501:1998;205-219 Springer, Berlin.
5. Case J., Jain S., Lange S., Zeugmann T. Incremental concept learning for bounded data mining. Inform. Comput. 152:1999;74-110.
6. Case J., Jain S., Sharma A. Synthesizing noise-tolerant language learners. Proc. 8th Internat. Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence. Vol. 1316:1997;228-243 Springer, Berlin.
7. Case J., Jain S., Stephan F. Vacillatory and BC learning on noisy data. Theoret. Comput. Sci. 241:2000;115-141.
8. Yu.L. Ers̃ov, Theory of Numberings, Nauka, Moscow, 1977 (in Russian).
9. Fayyad U.M., Piatetsky-Shapiro G., Smyth P., Uthurusamy R. Advances in Knowledge Discovery and Data Mining. 1996;MIT Press, Cambridge, MA.
10. Fulk M., Jain S., Osherson D.N. Open problems in systems that learn. J. Comput. System Sci. 49:1994;589-604.
11. Gennari J., Langley P., Fisher D. Models of incremental concept formation. Arti. Intell. 40:1989;11-62.
12. Godin R., Missaoui R. An incremental concept formation approach for learning from databases. Theoret. Comput. Sci. 133:1994;387-419.
13. Gold M.E. Language identification in the limit. Inform. Control. 10:1967;447-474.
14. Grieser G., Lange S., Zeugmann T. Learning of recursive concepts with anomalies. Proc. 11th Internat. Conf. on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence. Vol. 1968:2000;101-115 Springer, Berlin.
15. Hopcroft J.E., Ullman J.D. Formal Languages and their Relation to Automata. 1969;Addison, Reading, MA.
16. Jain S. Program synthesis in the presence of infinite number of inaccuracies. J. Comput. System Sci. 53:1996;583-591.
17. Jain S., Osherson D., Royer J., Sharma A. Systems that Learn - 2nd Edition, An Introduction to Learning Theory. 1999;MIT Press, Cambridge, MA.
18. Jantke K.P., Beick H.R. Combining postulates of naturalness in inductive inference. J. Inform. Process. Cybernetics (EIK). 17:1981;465-484.
19. Kinber E., Stephan F. Mind changes, limited memory, and monotonicity. Inform. Comput. 123:1995;224-241.
20. Lange S., Grieser G. On variants of iterative learning. Proc. First Internat. Conf. on Discovery Science, Lecture Notes in Artificial Intelligence. Vol. 1532:1998;72-83 Springer, Berlin.
21. Lange S., Wiehagen R. Polynomial-time inference of arbitrary pattern languages. New Generation Comput. 8:1991;361-370.
22. Lange S., Wiehagen R., Zeugmann T. Learning by erasing. Proc. 7th Internat. Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence. Vol. 1160:1996;228-241 Springer, Berlin.
23. Lange S., Zeugmann T. Language learning in dependence on the space of hypotheses. Proc. 6th Annual ACM Conf. on Computational Learning Theory. 1993;127-136 ACM Press, New York.
24. Lange S., Zeugmann T. Incremental learning from positive data. J. Comput. System Sci. 53:1996;88-103.
25. Langley P. Order effects in incremental learning. Reimann P., Spada H. Learning in Humans and Machines. Towards an Interdisciplinary Learning Science:1995;Elsevier, Amsterdam.
26. Maloof M.A., Michalski R.S. Selecting examples for partial memory learning. Mach. Learning. 41:2000;27-52.
27. Porat S., Feldman J.A. Learning automata from ordered examples. Mach. Learning. 7:1991;109-138.
28. Rivest R. Learning decision lists. Mach. Learning. 2:1988;229-246.
29. Stephan F. Noisy inference and oracles. Theoret. Comput. Sci. 185:1997;129-157.
30. Utgoff P.E. Incremental induction of decision trees. Mach. Learning. 4:1989;161-186.
31. Valiant L.G. A theory of the learnable. Commun. ACM. 27:1984;1134-1142.
32. Wiehagen R. Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. J. Inform. Process. Cybernetics (EIK). 12:1976;93-99.
33. Zeugmann T., Lange S. A guided tour across the boundaries of learning recursive languages. Jantke K.P., Lange S. Algorithmic Learning for Knowledge-Based Systems. Lecture Notes in Artificial Intelligence. Vol. 961:1995;190-258 Springer, Berlin.