Characteristic sets for inferring the unions of the tree pattern languages by the most fitting hypotheses

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

Volumn 4201 LNAI, Issue , 2006, Pages 307-319

  Ng, Yen Kaow ^a   Shinohara, Takeshi ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; LEARNING SYSTEMS; TREES (MATHEMATICS);

CHARACTERISTIC SETS; TREE PATTERN LANGUAGES;

CHARACTER SETS;

EID: 33750340163     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11872436_25     Document Type: Conference Paper

References (18)

1. D. Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117-135, 1980.
2. D. Angluin. Inference of reversible languages. J. of the ACM, 29:741-765, 1982.
3. H. Arimura, H. Ishizaka, and T. Shinohara. Learning unions of tree patterns using queries. Theoretical Computer Science, 185(1):47-62, 1997.
4. H. Arimura, T. Shinohara, and S. Otsuki. A polynomial time algorithm for finding finite unions of tree pattern languages. In Proc. of Nonmonotonic and Inductive Logic, Second Int. Workshop, volume 659 of LNAI, pages 118-131. Springer-Verlag, 1991.
5. H. Arimura, T. Shinohara, and S. Otsuki. Polynomial time inference of unions of two tree pattern languages. IEICE Transactions on Information and Systems, E75-D(7):426-434, 1992.
6. 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 STAGS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, volume 775 of LNCS, pages 649-660. Springer-Verlag, 1994.
7. H. Arimura, T. Shinohara, S. Otsuki, and H. Ishizaka. A generalization of the least general generalization. Machine Intelligence 13, 13:59-85, 1994.
8. C. Chan, M. Garofalakis, and R. Rastogi. RE-tree: an efficient index structure for regular expressions. The VLDB Journal, 12(2):102-119, 2003.
9. E. M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
10. W3C XML Core Working Group. Extensible Markup Language (XML) 1.0 (Third Edition). W3C Recommendation, 2004.
11. S. Kobayashi and T. Yokomori. Identifiability of subspaces and homomorphic images of zero-reversible languages. In Proc. of Algorithmic Learning Theory, 8th Int. Conf., ALT'97, volume 1316 of LNAI, pages 48-61. Springer-Verlag, 1997.
12. Y. K. Ng, H. Ono, and T. Shinohara. Measuring over-generalization in the minimal multiple generalizations of biosequences. In Proc. of Discovery Science, 8th Int. Conf., DS 2005, volume 3735 of LNAI, pages 176-188. Springer-Verlag, 2005.
13. Y. K. Ng and T. Shinohara. Inferring unions of the pattern languages by the most fitting covers. In Proc. of Algorithmic Learning Theory, 16th Int. Conf., ALT 2005, volume 3734 of LNAI, pages 269-282. Springer-Verlag, 2005.
14. Y. K. Ng and T. Shinohara. Finding consensus patterns in very scarce biosequence samples from their minimal multiple generalizations. In Proc. of Advances in Knowledge Discovery and Data Mining, 10th Pacific-Asia Conf., PAKDD 2006, volume 3918 of LNAI, pages 540-545. Springer-Verlag, 2006.
15. G.D. Plotkin. A note on inductive generalization. In Machine Intelligence, volume 5, pages 153-163. Edinburgh University Press, 1970.
16. M. Sato. Inductive inference of formal languages. Bulletin of Informatics and Cybernetics, 27(1):85-106, 1995.
17. T. Shinohara. Polynomial time inference of extended regular pattern languages. In RIMS Symposia on Software Science and Engineering, Kyoto, Japan, volume 147 of LNCS, pages 115-127. Springer-Verlag, 1982.
18. K. Wright. Identification of unions of languages drawn from an identifiable class. In Proc. of the Second Annual Workshop on Computational Learning Theory, pages 328-333. Morgan Kaufmann, 1989.