Inferring unions of the pattern languages by the most fitting covers

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

Volumn 3734 LNAI, Issue , 2005, Pages 269-282

  Ng, Yen Kaow ^a   Shinohara, Takeshi ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; IDENTIFICATION (CONTROL SYSTEMS); LEARNING SYSTEMS; PATTERN RECOGNITION SYSTEMS; SEARCH ENGINES;

FINITE ELASTICITY; LEARNING STRATEGY; PATTERN LANGUAGES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33646515069     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564089_22     Document Type: Conference Paper

References (17)

1. D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21:46-62, 1980.
2. D. Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117-135, 1980.
3. H. Arimura, T. Shinohara, and S. Otsuki. Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data. In Proc. of the 11th Ann. Symp. on Theoretical Aspects of Comp. Sci. (STACS'94), volume 775 of Lecture Notes in Computer Science, pages 649-660. Springer-Verlag, 1994.
4. E. M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
5. M. Hirao, H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. A practical algorithm to find the best subsequence patterns. In Proceedings of the Third International Conference on Discovery Science, volume 1967 of Lecture Notes in Artificial Intelligence, pages 141-154, 2000.
6. T. Jiang, E. Kinber, A. Salomaa, K. Salomaa, and S. Yu. Pattern languages with and without erasing. International Journal Of Computer Mathematics, 50:147-163, 1994.
7. T. Jiang, A. Salomaa, K. Salomaa, and S. Yu. Decision problems for patterns. Journal of Computer and System Sciences, 50:53-63, 1995.
8. S. Kobayashi and T. Yokomori. Identifiability of subspaces and homomorphic images of zero-reversible languages. In Algorithmic Learning Theory: Eighth International Workshop (ALT '97), volume 1316 of Lecture Notes in Artificial Intelligence, pages 48-61, 1997.
9. T. Motoki, T. Shinohara, and K. Wright. The correct definition of finite elasticity: Corrigendum to identification of unions. In L. Valiant and M. Warmuth, editors, Proceedings of the Fourth Annual Workshop on Computational Learning Theory, page 375. Morgan Kaufmann, 1991.
10. Y. K. Ng, H. Ono, and T. Shinohara. Measuring over-generalization in the minimal multiple generalizations of biosequences. In Proceedings of The Eighth Conference on Discovery Science (DS'05). to appear.
11. H. Ono and Y. K. Ng. Best fitting fixed-length substring patterns for a set of strings. In Proceedings of The Eleventh International Computing and Combinatorics Conference (COCOON'05), to appear.
12. M. Sato. Inductive inference of formal languages. Bulletin of Informatics and Cybernetics, 27(1):85-106, 1995.
13. M. Sato, Y. Mukouchi, and D. Zheng. Characteristic sets for unions of regular pattern languages and compactness. In Algorithmic Learning Theory: Ninth International Conference (ALT' 98), volume 1501 of Lecture Notes in Computer Science, pages 220-233. Springer-Verlag, 1998.
14. T. Shinohara. Polynomial time inference of extended regular pattern languages. In RIMS Symposia on Software Science and Engineering, Kyoto, Japan, volume 147 of Lecture Notes in Computer Science, pages 115-127. Springer-Verlag, 1982.
15. T. Shinohara and H. Arimura. Inductive inference of unbounded unions of pattern languages from positive data. Theoretical Computer Science A, 241:191-209, 2000.
16. J. Uemura and M. Sato. Compactness and learning of classes of unions of erasing regular pattern languages. In Algorithmic Learning Theory: Thirteenth International Conference (ALT' 02), vol. 2533, pages 293-307. Springer-Verlag, 2002.
17. K. Wright. Identification of unions of languages drawn from an identifiable class. In R. Rivest, D. Haussler, and M. Warmuth, editors, Proceedings of the Second Annual Workshop on Computational Learning Theory, pages 328-333. Morgan Kaufmann, 1989.