Developments from enquiries into the learnability of the pattern languages from positive data

Theoretical Computer Science

Volumn 397, Issue 1-3, 2008, Pages 150-165

  Ng, Yen Kaow ^a   Shinohara, Takeshi ^b  

^a Department of Artificial Intelligence ^*  (Malaysia)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Chronology; Inductive inference; Pattern languages; Positive data

Indexed keywords

DATA REDUCTION; TEXT PROCESSING;

CHRONOLOGY; INDUCTIVE INFERENCE; PATTERN LANGUAGES; POSITIVE DATA;

COMPUTER PROGRAMMING LANGUAGES;

EID: 43049105334     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.02.028     Document Type: Article

References (70)

1. Angluin D. Finding patterns common to a set of strings. Journal of Computer and System Sciences 21 (1980) 46-62 First appeared in STOC'79
2. Angluin D. Inductive inference of formal languages from positive data. Information and Control 45 (1980) 117-135
3. Angluin D. Inference of reversible languages. Journal of the ACM 29 (1982) 741-765
4. Arikawa S. Elementary formal systems and formal languages - simple formal systems. Memoirs of the Faculty of Science, Kyushu University Series A, Mathematics vol. 24 (1970) 47-75
5. Arikawa S., Shinohara T., and Yamamoto A. Learning elementary formal systems. Theoretical Computer Science 95 (1992) 97-113 First appeared in COLT'89
6. Arimura H., Fujino R., Shinohara T., and Arikawa S. Protein motif discovery from positive examples by Minimal Multiple Generalization over regular patterns. Proceedings of the Genome Informatics Workshop 1994 (1994), Universal Academy Press 39-48
7. Arimura H., and Shinohara T. Inductive inference of Prolog programs with linear data dependency from positive data. Proc. Information Modelling and Knowledge Bases V (1994), IOS Press 365-375
8. H. Arimura, T. Shinohara, Compactness for unions of regular pattern languages, in: Proceedings of Symposium on Language and Automaton, Research on Computational Models and Complexity, RIMS Koukyuroku, vol. 950, 1996, pp. 246-249 (in Japanese)
9. Arimura H., Shinohara T., and Otsuki S. A polynomial time algorithm for finding finite unions of tree pattern languages. Proceedings of Nonmonotonic and Inductive Logic, Second International Workshop. Lecture Notes in Artificial Intelligence vol. 659 (1991), Springer-Verlag 118-131
10. Arimura H., Shinohara T., and Otsuki S. Polynomial time inference of unions of two tree pattern languages. IEICE Transactions on Information and Systems E75-D 7 (1992) 426-434 First appeared in ALT'91
11. Arimura H., Shinohara T., and Otsuki S. Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data. Proceedings of STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science vol. 775 (1994), Springer-Verlag 649-660
12. Arimura H., Shinohara T., Otsuki S., and Ishizaka H. A generalization of the least general generalization. Machine Intelligence 13 (1994) 59-85 First appeared as RIFIS Technical Report in 1992
13. J. Bārzdiņš, Inductive inference of automata, functions and programs, in: Int. Math. Congress, Vancouver, 1974, pp. 771-776
14. Dershowitz N., and Jouannaud J.-P. Rewrite systems. Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics (B) (1990), North-Holland 243-320
15. Erlebach T., Rossmanith P., Stadtherr H., Steger A., and Zeugmann T. Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. Theoretical Computer Science 261 1 (2001) 119-156 (special issue for ALT'97)
16. C. Costa Florêncio, Learning Categorial Grammars. Ph.D. Thesis, Utrecht institute of Linguistics OTS, Utrecht University, 2003
17. Freivalds R., Kinber E., and Wiehagen R. Inductive inference from good examples. Analogical and Inductive Inference, Proceedings of the Second International Workshop. Lecture Notes in Artificial Intelligence vol. 397 (1989), Springer-Verlag 1-17
18. Gold E.M. Language identification in the limit. Information and Control 10 (1967) 447-474
19. Ishizaka H., Arimura H., and Shinohara T. Efficient inductive inference of primitive prologs from positive data. Proceedings of Algorithmic Learning Theory, Third International Workshop, ALT'92. Lecture Notes in Artificial Intelligence vol. 743 (1992), Springer-Verlag 135-146
20. Jantke K.P. Polynomial time inference of general pattern languages. Proceedings of STACS 84, Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science vol. 166 (1984), Springer-Verlag 314-325
21. Jiang T., Salomaa A., Salomaa K., and Yu S. Decision problems for patterns. Journal of Computer and System Sciences 50 (1995) 53-63
22. Ko K.-I., and Hua C.-H. A note on the two-variable pattern-finding problem. Journal of Computer and System Sciences 34 1 (1987) 75-86
23. Kobayashi S., and Yokomori T. Identifiability of subspaces and homomorphic images of zero-reversible languages. Proceedings of Algorithmic Learning Theory, Eighth International Conference, ALT'97. Lecture Notes in Artificial Intelligence vol. 1316 (1997), Springer-Verlag 48-61
24. Kruskal J.B. The theory of well-quasi-ordering: A frequently discovered concept. Journal of Combinatorial Theory (A) 13 (1972) 297-305
25. Kyte J., and Doolittle R.F. A simple method for displaying the hydropathic character of a protein. Journal of Molecular Biology 157 (1982) 105-132
26. Lange S., Grieser G., and Jantke K.P. Advanced elementary formal systems. Theoretical Computer Science 1 298 (2003) 51-70 (special issue on ALT 2001)
27. Lange S., Nessel J., and Wiehagen R. Language learning from good examples. Algorithmic Learning Theory: Fourth International Workshop on Analogical and Inductive Inference, AII '94, and Fifth International Workshop on International Workshop, ALT'94. Lecture Notes in Artificial Intelligence vol. 872 (1994), Springer-Verlag 423-437
28. Lange S., and Wiehagen R. Polynomial-time inference of arbitrary pattern languages. New Generation Computing 8 (1991) 361-370 First appeared in ALT'90
29. Martin E., and Sharma A. On sufficient conditions for learnability of logic programs from positive data. Proceedings of Inductive Logic Programming: 9th International Workshop, ILP'99. Lecture Notes in Computer Science vol. 1634 (1999), Springer-Verlag 198-209
30. Mateescu A., Paun G., Rozenberg G., and Salomaa A. Simple splicing systems. Discrete Applied Mathematics 84 1-3 (1998) 145-163
31. Mitchell A. Learnability of a subclass of extended pattern languages. Proceedings of the Eleventh Annual Conference on Computational Learning Theory (1998), ACM Press
32. Motoki T., Shinohara T., and Wright K. The correct definition of finite elasticity: Corrigendum to identification of unions. In: Valiant L., and Warmuth M. (Eds). Proceedings of the Fourth Annual Workshop on Computational Learning Theory (1991), Morgan Kaufmann 375
33. Mukouchi Y. Containment problems for pattern languages. IEICE Transactions on Information and Systems E75-D 7 (1992) 420-425 (special issue for ALT'01)
34. Mukouchi Y., and Sato M. Learning languages generated by elementary formal systems and its application to SH languages. Proceedings of Algorithmic Learning Theory, Fifteenth International Conference, ALT'04. Lecture Notes in Artificial Intelligence vol. 3244 (2004), Springer-Verlag 380-394
35. Ng Y.K., Ono H., and Shinohara T. Measuring over-generalization in the minimal multiple generalizations of biosequences. Proceedings of Discovery Science, 8th International Conference, DS 2005. Lecture Notes in Artificial Intelligence vol. 3735 (2005), Springer-Verlag 176-188
36. Ng Y.K., and Shinohara T. Inferring unions of the pattern languages by the most fitting covers. Proceedings of Algorithmic Learning Theory, Sixteenth International Conference, ALT'05. Lecture Notes in Artificial Intelligence vol. 3734 (2005), Springer-Verlag 269-282
37. Ng Y.K., and Shinohara T. Finding consensus patterns in very scarce biosequence samples from their minimal multiple generalizations. Proceedings of Advances in Knowledge Discovery and Data Mining, 10th Pacific-Asia Conference, PAKDD 2006. Lecture Notes in Artificial Intelligence vol. 3918 (2006), Springer-Verlag 540-545
38. Plotkin G.D. A note on inductive generalization. Machine Intelligence vol. 5 (1970), Edinburgh University Press 153-163
39. Krishna Rao M.R.K. Some classes of prolog programs inferable from positive data. Theoretical Computer Science A 241 (2000) 211-234 (special issue for ALT'96)
40. Krishna Rao M.R.K. Inductive inference of term rewriting systems from positive data. Proceedings of Algorithmic Learning Theory, Fifteenth International Conference, ALT'04. Lecture Notes in Artificial Intelligence vol. 3244 (2004), Springer-Verlag 69-82
41. Krishna Rao M.R.K. A class of prolog programs with non-linear outputs inferable from positive data. Proceedings of Algorithmic Learning Theory, Sixteenth International Conference, ALT'05. Lecture Notes in Artificial Intelligence vol. 3734 (2005), Springer-Verlag 312-326
42. Krishna Rao M.R.K. Learnability of term rewrite systems from positive examples. Proceedings of the Twelfth Computing: The Australasian Theory Symposium, CATS 2006. Conferences in Research and Practice in Information Technology vol. 51 (2006), Australian Computer Society 133-137
43. Reidenbach D. A negative result on inductive inference of extended pattern languages. Proceedings of Algorithmic Learning Theory, Thirteenth International Conference, ALT'02. Lecture Notes in Artificial Intelligence vol. 2533 (2002), Springer-Verlag 308-320
44. Reidenbach D. A discontinuity in pattern inference. Proceedings of STACS 04, 21st Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science vol. 2996 (2004), Springer-Verlag 129-140
45. Reidenbach D. On the learnability of e-pattern languages over small alphabets. Proceedings of the Seventeenth Annual Conference on Computational Learning Theory. Lecture Notes in Computer Science vol. 3120 (2004), Springer-Verlag 140-154
46. Reischuk R., and Zeugmann T. An average case optimal one-variable pattern language learner. Journal of Computer and System Sciences 60 2 (1998) 302-335 (special issue for COLT'98)
47. Sato M. Inductive inference of formal languages. Bulletin of Informatics and Cybernetics 27 1 (1995) 85-106
48. Sato M., Mukouchi Y., and Zheng D. Characteristic sets for unions of regular pattern languages and compactness. Proceedings of Algorithmic Learning Theory, Ninth International Conference, ALT'98. Lecture Notes in Artificial Intelligence vol. 1501 (1998), Springer-Verlag 220-233
49. Shapiro E. Algorithmic Program Debugging (1983), MIT Press
50. Shinohara T. Polynomial time inference of extended regular pattern languages. RIMS Symposia on Software Science and Engineering, Kyoto, Japan. Lecture Notes in Computer Science vol. 147 (1982), Springer-Verlag 115-127
51. T. Shinohara, Polynomial time inference of pattern languages and its application, in: Proceedings of the 7th IBM Symposium on Mathematical Foundations of Computer Science, 1982, pp. 192-209
52. Shinohara T. Inferring unions of two pattern languages. Bulletin of Informatics and Cybernetics 20 (1983) 83-88
53. Shinohara T. Some problems on inductive inference from positive data. Mathematical Methods of Specification and Synthesis of Software Systems, Wendisch-Rietz, GDR. Lecture Notes in Computer Science vol. 215 (1985), Springer-Verlag 41-58
54. Shinohara T. Inductive inference of formal systems from positive data. Bulletin of Informatics and Cybernetics 22 (1986) 9-18
55. Shinohara T. Inductive inference of monotonic formal systems from positive data. New Generation Computing 8 (1991) 371-384 First appeared in ALT'90
56. Shinohara T. Rich classes inferable from positive data: Length-bounded elementary formal systems. Information and Computation 108 (1994) 175-186 First appeared in COLT'90
57. Shinohara T., and Arimura H. Inductive inference of unbounded unions of pattern languages from positive data. Theoretical Computer Science A 241 (2000) 191-209 (special issue for ALT'96)
58. Sigrist C.J., Cerutti L., Hulo N., Gattiker A., Falquet L., Pagni M., Bairoch A., and Bucher P. PROSITE: A documented database using patterns and profiles as motif descriptors. Brief Bioinformatics 3 (2002) 265-274
59. Smullyan R. Theory of formal systems. Annals of Mathematical Studies 47 (1961)
60. T. Takae, T. Kasai, H. Arimura, T. Shinohara, Knowledge discovery in biosequences using sort regular patterns. in: Workshop on Applied Learning Theory, 1998
61. Takashi M., and Sato M. Properties of language classes with finite elasticity. Proceedings of Algorithmic Learning Theory, Fourth International Workshop, ALT'93. Lecture Notes in Artificial Intelligence vol. 744 (1993), Springer-Verlag 187-196
62. Uemura J., and Sato M. Compactness and learning of classes of unions of erasing regular pattern languages. Proceedings of Algorithmic Learning Theory, Thirteenth International Conference, ALT'02. Lecture Notes in Artificial Intelligence vol. 2533 (2002), Springer-Verlag 293-307
63. Wiehagen R. Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. Journal of Information Processing and Cybernetics (EIK) 12 (1976) 93-99
64. Wiehagen R., and Zeugmann T. Ignoring data may be the only way to learn efficiently. Journal of Experimental and Theoretical Artificial Intelligence 6 (1994) 131-144 First appeared in AII'92
65. Wiehagen R., and Zeugmann T. Learning and consistency. Algorithmic Learning for Knowledge-Based Systems. Lecture Notes in Artificial Intelligence vol. 961 (1995), Springer-Verlag 1-24
66. Wright K. Identification of unions of languages drawn from an identifiable class. In: Rivest R., Haussler D., and Warmuth M. (Eds). Proceedings of the Second Annual Workshop on Computational Learning Theory (1989), Morgan Kaufmann 328-333
67. Yamaguchi M., Shimozono S., and Shinohara T. Finding minimal multiple generalization over regular patterns with alphabet indexing. Proceedings of the Seventh Workshop on Genome Informatics vol. 7 (1996), Universal Academy Press 51-60
68. Zeugmann T. 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 1-2 (1998) 117-145 First appeared as a RIFIS Technical Report in 1995
69. Zeugmann T. From learning in the limit to stochastic finite learning. Theoretical Computer Science 364 1 (2006) 77-97
70. Zeugmann T., and Lange S. A guided tour across the boundaries of learning recursive languages. Algorithmic Learning for Knowledge-Based Systems. Lecture Notes in Artificial Intelligence vol. 961 (1995), Springer-Verlag 190-258