Polynomial time algorithms for finding unordered tree patterns with internal variables

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

Volumn 2138, Issue , 2001, Pages 335-346

  Shoudai, Takayoshi ^a   Uchida, Tomoyuki ^b   Miyahara, Tetsuhiro ^b  

^a KYUSHU UNIVERSITY   (Japan)

^b HIROSHIMA CITY UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA MINING; POLYNOMIAL APPROXIMATION;

HIDDEN KNOWLEDGE; INTERNAL VARIABLES; MINIMAL LANGUAGES; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; TREE-STRUCTURED DATA; TREE-STRUCTURED DOCUMENTS; UNORDERED TREES;

TREES (MATHEMATICS);

EID: 84974715476     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44669-9_32     Document Type: Conference Paper

References (12)

1. T. R. Amoth, P. Cull, and P. Tadepalli. Exact learning of unordered tree patterns from queries. Proc. COLT-99, ACM Press, pages 323–332, 1999.
2. D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Science, 21:46–62, 1980.
3. H. Arimura, T. Shinohara, and S. Otsuki. Polynomial time algorithm for finding finite unions of tree pattern languages. Proc. NIL-91, Springer-Verlag, LNAI 659, pages 118–131, 1993.
4. S. Goldman and S. Kwek. On learning unions of pattern languages and tree patterns. Proc. ALT-99, Springer-Verlag, LNAI 1720, 1720:347–363, 1999.
5. S. Matsumoto, Y. Hayashi, and T. Shoudai. Polynomial time inductive inference of regular term tree languages from positive data. Proc. ALT-97, Springer-Verlag, LNAI 1316, pages 212–227, 1997.
6. T. Miyahara, T. Shoudai, T. Uchida, T. Kuboyama, K. Takahashi, and H. Ueda. Discovering new knowledge from graph data using inductive logic programming. Proc. ILP-99, Springer-Verlag, LNAI 1634, pages 222–233, 1999.
7. T. Miyahara, T. Shoudai, T. Uchida, K. Takahashi, and H. Ueda. Polynomial time matching algorithms for tree-like structured patterns in knowledge discovery. Proc. PAKDD-2000, Springer-Verlag, LNAI 1805, pages 5–16, 2000.
8. T. Miyahara, T. Shoudai, T. Uchida, K. Takahashi, and H. Ueda. Discovery of frequent tree structured patterns in semistructured web documents. Proc. PAKDD-2001, Springer-Verlag, LNAI 2035, pages 47–52, 2001.
9. S. Nestorov, S. Abiteboul, and R. Motwani. Extracting schema from semistructured data. Proceedings of ACM SIGMOD International Conference on Management of Data, pages 295–306, 1998.
10. T. Shinohara. Polynomial time inference of extended regular pattern languages. In Springer-Verlag, LNCS 147, pages 115–127, 1982.
11. T. Shoudai, T. Miyahara, T. Uchida, and S. Matsumoto. Inductive inference of regular term tree languages and its application to knowledge discovery. Information Modelling and Knowledge Bases XI, IOS Press, pages 85–102, 2000.
12. K. Wang and H. Liu. Discovering structural association of semistructured data. IEEE Trans. Knowledge and Data Engineering, 12:353–371, 2000.