Incremental Concept Learning for Bounded Data Mining

Information and Computation

Volumn 152, Issue 1, 1999, Pages 74-110

  Case, John ^a   Jain, Sanjay ^b   Lange, Steffen ^c   Zeugmann, Thomas ^d  

^a UNIVERSITY OF DELAWARE   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c UNIVERSITY OF LEIPZIG   (Germany)

^d KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002633967     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2784     Document Type: Article

References (52)

1. Angluin, D. (1980a), Finding patterns common to a set of strings, J. Comput. System Sci. 21, 46-62.
2. Angluin, D. (1980b), Inductive inference of formal languages from positive data, Inform. and Control 45, 117-135.
3. Arikawa, S., Shinohara, T., and Yamamoto, A. (1992), Learning elementary formal systems, Theoret. Comput. Sci. 95, 97-113.
4. Arimura, H., and Shinohara, T. (1994), Inductive inference of Prolog programs with linear data dependency from positive data, in "Proceedings Information Modeling and Knowledge Bases V," pp. 365-375, IOS Press, Burke, VA.
5. Blum, M. (1967), A machine independent theory of the complexity of recursive functions, J. Assoc. Comput. Mach. 14, 322-336.
6. Blum, L., and Blum, M. (1975), Toward a mathematical theory of inductive inference, Inform. and Control 28, 122-155.
7. Brachman, R., and Anand, T. (1996), The process of knowledge discovery in databases: A human centered approach, in "Advances in Knowledge Discovery and Data Mining" (U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, Eds.), pp. 37-58, AAAI Press, Menlo Park, CA.
8. Case, J. (1974), Periodicity in generation of automata, Math. Systems Theory 8, 15-32.
9. Case, J. (1988), The power of vacillation, in "Proceedings of the 1st Workshop on Computational Learning Theory" (D. Haussler and L. Pitt, Eds.), pp. 196-205, Morgan Kaufmann, San Mateo, CA.
10. Case, J. (1994), Infinitary self-reference in learning theory, J. Experimental & Theoretical Artificial Intelligence 6, 3-16.
11. Case, J. (1996), "The Power of Vacillation in Language Learning," Technical Report LP-96-08, Logic, Philosophy and Linguistics Series of the Institute for Logic, Language and Computation, University of Amsterdam, The Netherlands.
12. Case, J., and Smith, C. H. (1983), Comparison of identification criteria for machine inductive inference, Theoret. Comput. Sci. 25, 193-220.
13. Fayyad, U. M., Djorgovski, S. G., and Weir, N. (1996a), Automating the analysis and cataloging of sky surveys, in "Advances in Knowledge Discovery and Data Mining" (U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, Eds.), pp. 471-494, AAAI Press, Menlo Park, CA.
14. Fayyad, U. M., Piatetsky-Shapiro, G., and Smyth, P. (1996b), From data mining to knowledge discovery: An overview, in "Advances in Knowledge Discovery and Data Mining" (U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, Eds.), pp. 1-34, AAAI Press, Menlo Park, CA.
15. Filé, G. (1988), The relation of two patterns with comparable languages, in "Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science" (R. Cori and M. Wirsing, Eds.), Lecture Notes in Computer Science, Vol. 294, pp. 184-192, Springer-Verlag, Berlin.
16. Freivalds, R., and Smith, C. H. (1993), On the role of procrastination for machine learning, Inform. and Comput. 107, 237-271.
17. Fulk, M., Jain, S., and Osherson, D. N. (1994), Open problems in systems that learn, J. Comput. System Sci. 49, 589-604.
18. Gold, M. E. (1967), Language identification in the limit, Inform. and Control 10, 447-474.
19. Hopcroft, J. E., and Ullman, J. D. (1969), "Formal Languages and their Relation to Automata," Addison-Wesley, Reading, MA.
20. Jain, S., and Sharma, A. (1994), On monotonic strategies for learning r.e. languages, in "Proceedings of the 5th International Workshop on Algorithmic Learning Theory" (K. P. Jantke and S. Arikawa, Eds.), Lecture Notes in Artificial Intelligence, Vol. 872, pp. 349-364, Springer-Verlag, Berlin.
21. Jain, S., and Sharma, A. (1995), On identification by teams and probabilistic machines, in "Algorithmic Learning for Knowledge-Based Systems" (K. P. Jantke and S. Lange, Eds.), Lecture Notes in Artificial Intelligence, Vol. 961, pp. 108-145, Springer-Verlag, Berlin.
22. Jiang, T., Salomaa, A., Salomaa, K., and Yu, S. (1993), Inclusion is undecidable for pattern languages, in "Proceedings 20th International Colloquium on Automata, Languages and Programming" (A. Lingas, R. Karlsson, and S. Carlsson, Eds.), Lecture Notes in Computer Science, Vol. 700, pp. 301-312, Springer-Verlag, Berlin.
23. Kloesgen, W. (1995), Efficient discovery of interesting statements in databases, J. Intell. Inform. Systems 4, 53-69.
24. Krishna Rao, M. R. K. (1996), A class of Prolog programs inferable from positive data, in "Proceedings of the 7th International Workshop on Algorithmic Learning Theory" (S. Arikawa and A. K. Sharma, Eds.), Lecture Notes in Artificial Intelligence, Vol. 1160, pp. 272-284, Springer-Verlag, Berlin.
25. Lange, S., and Wiehagen, R. (1991), Polynomial-time inference of arbitrary pattern languages, New Generation Computing 8, 361-370.
26. Lange, S., and Zeugmann, T. (1993a), Language learning in dependence on the space of hypotheses, in "Proceedings of the 6th Annual ACM Conference on Computational Learning Theory" (L. Pitt, Ed.), pp. 127-136, ACM Press, New York.
27. Lange, S., and Zeugmann, T. (1993b), Learning recursive languages with bounded mind changes, International Journal of Foundations of Computer Science 4, 157-178.
28. Lange, S., and Zeugmann, T. (1993c), Monotonic versus non-monotonic language learning, in "Proceedings 2nd International Workshop on Nonmonotonic and Inductive Logic" (G. Brewka, K. P. Jantke, and P. H. Schmitt, Eds.), Lecture Notes in Artificial Intelligence, Vol. 659, pp. 254-269, Springer-Verlag, Berlin.
29. Lange, S., and Zeugmann, T. (1996a), Incremental learning from positive data, J. Comput. System Sci. 53, 88-103.
30. Lange, S., and Zeugmann, T. (1996b), Set-driven and rearrangement-independent learning of recursive languages, Math. Systems Theory 29, 599-634.
31. Matheus, C. J., Piatetsky-Shapiro, G., and McNeil, D. (1996), Selecting and reporting what is interesting, in "Advances in Knowledge Discovery and Data Mining" (U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, Eds.), pp. 495-515, AAAI Press, Menlo Park, CA.
32. Meyer, L. (1995), Probabilistic language learning under monotonicity constraints, in "Proceedings 6th International Workshop on Algorithmic Learning Theory" (K. P. Jantke, T. Shinohara, and T. Zeugmann, Eds.), Lecture Notes in Artificial Intelligence, Vol. 997, pp. 169-184, Springer-Verlag, Berlin.
33. Meyer, L. (1997), Monotonic and dual monotonic probabilistic language learning of indexed families with high probability, in "Proceedings 3rd European Conference on Computational Learning Theory" (S. Ben-David, Ed.), Lecture Notes in Artificial Intelligence, Vol. 1208, pp. 66-78, Springer-Verlag, Berlin.
34. Nix, R. P. (1983), "Editing by Examples," Yale University, Dept. Computer Science, Technical Report 280.
35. Osherson, D. N., Stob, M., and Weinstein, S. (1986), "Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists," MIT Press, Cambridge, MA.
36. Rogers, H. (1967), "Theory of Recursive Functions and Effective Computability," McGraw Hill, New York, 1967. [Reprinted, MIT Press, Cambridge, MA, 1987]
37. Rossmanith, P., and Zeugmann, T. (1998), Learning k-variable pattern languages efficiently stochastically finite on average from positive data, in "Proceedings 4th International Colloquium on Grammatical Inference - ICGI'98" (V. Honavar and G. Slutzki, Eds.), Lecture Notes in Artificial Intelligence, Vol. 1433, pp. 13-24, Springer-Verlag, Berlin.
38. Salomaa, A. (1994a), Patterns (The formal language theory column), EATCS Bull. 54, 46-62.
39. Salomaa, A. (1994b), Return to patterns (The formal language theory column), EATCS Bull. 55, 144-157.
40. Shimozono, S., Shinohara, A., Shinohara, T., Miyano, S., Kuhara, S., and Arikawa, S. (1994), Knowledge acquisition from amino acid sequences by machine learning system BONSAI, Trans. Inform. Process. Soc. Jpn. 35, 2009-2018.
41. Shinohara, T. (1983), Inferring unions of two pattern languages, Bull. Inform. Cybern. 20, 83-88.
42. Shinohara, T. (1991), Inductive inference of monotonic formal systems from positive data, New Generation Computing 8, 371-384.
43. Shinohara, T., and Arikawa, S. (1995), Pattern inference, in "Algorithmic Learning for Knowledge-Based Systems" (K. P. Jantke and S. Lange, Eds.), Lecture Notes in Artificial Intelligence, Vol. 961, pp. 259-291, Springer-Verlag, Berlin.
44. Shinohara, T., and Arimura, H. (1996), Inductive inference of unbounded unions of pattern languages from positive data, in "Proceedings 7th International Workshop on Algorithmic Learning Theory" (S. Arikawa and A. K. Sharma, Eds.), Lecture Notes in Artificial Intelligence, Vol. 1160, pp. 256-271, Springer-Verlag, Berlin.
45. Smullyan, R. (1961), "Theory of Formal Systems," Annals of Mathematical Studies, Vol. 47, Princeton Univ. Press, Princeton, NJ.
46. Wiehagen, R. (1976), Limes-Erkennung rekursiver Funktionen durch spezielle Strategien, Journal of Information Processing and Cybernetics (EIK) 12, 93-99.
47. Wiehagen, R., and Zeugmann, T. (1994), Ignoring data may be the only way to learn efficiently, Journal of Experimental & Theoretical Artificial Intelligence 6, 131-144.
48. Wright, K. (1989), Identification of unions of languages drawn from an identifiable class, in "Proceedings of the 2nd Workshop on Computational Learning Theory" (R. Rivest, D. Haussler, and M. Warmuth, Eds.), pp. 328-333, Morgan Kaufmann, San Mateo, CA.
49. Zeugmann, T. (1995), "Lange and Wiehagen's Pattern Language Learning Algorithm: An Average-Case Analysis with Respect to its Total Learning Time," RIFIS Technical Report RIFIS-TR-CS-111, RIFIS, Kyushu University.
50. Zeugmann, T. (1998), Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time, Annals of Mathematics and Artificial Intelligence 23, 117-145.
51. Zeugmann, T., and Lange, S. (1995), A guided tour across the boundaries of learning recursive languages, in "Algorithmic Learning for Knowledge-Based Systems" (K. P. Jantke and S. Lange, Eds.), Lecture Notes in Artificial Intelligence, Vol. 961, pp. 190-258, Springer-Verlag, Berlin.
52. Zeugmann, T., Lange, S., and Kapur, S. (1995), Characterizations of monotonic and dual monotonic language learning, Inform. and Comput. 120, 155-173.