메뉴 건너뛰기




Volumn 2035, Issue , 2001, Pages 47-52

Discovery of frequent tree structured patterns in semistructured web documents

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; FORESTRY; WORLD WIDE WEB; XML;

EID: 84942855474     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45357-1_8     Document Type: Conference Paper
Times cited : (34)

References (10)
  • 2
    • 0000621555 scopus 로고
    • Constant time generation of rooted trees
    • T. Beyer and S. Hedetniemi. Constant time generation of rooted trees. SIAM J. Comput., 9:706-712, 1980.
    • (1980) SIAM J. Comput. , vol.9 , pp. 706-712
    • Beyer, T.1    Hedetniemi, S.2
  • 4
    • 79952406246 scopus 로고
    • Polynomial time matching algorithms for tree-like structured patterns in knowledge discovery
    • Springer-Verlag, LNAI
    • 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.
    • (1805) Proc. PAKDD-2000 , vol.2000 , pp. 5-16
    • Miyahara, T.1    Shoudai, T.2    Uchida, T.3    Takahashi, K.4    Ueda, H.5
  • 5
    • 84947796655 scopus 로고    scopus 로고
    • KD-FGS: A knowledge discovery system from graph data using formal graph sys- tem
    • Springer-Verlag, LNAI 1574
    • T. Miyahara, T. Uchida, T. Kuboyama, T. Yamamoto, K. Takahashi, and H. Ueda. KD-FGS: A knowledge discovery system from graph data using formal graph sys- tem. Proc. PAKDD-99, Springer-Verlag, LNAI 1574, pages 438-442, 1999.
    • (1999) Proc. PAKDD-99 , pp. 438-442
    • Miyahara, T.1    Uchida, T.2    Kuboyama, T.3    Yamamoto, T.4    Takahashi, K.5    Ueda, H.6
  • 6
    • 84942892691 scopus 로고    scopus 로고
    • Discovery of maximally frequent tag tree patterns in semistructured data
    • T. Miyahara, T. Shoudai and T. Uchida. Discovery of maximally frequent tag tree patterns in semistructured data. Proc. LA Winter Symposium, Kyoto, pages 15-1 - 15-10, 2001.
    • (2001) Proc. LA Winter Symposium, Kyoto , pp. 151-1510
    • Miyahara, T.1    Shoudai, T.2    Uchida, T.3
  • 8
    • 9444275081 scopus 로고    scopus 로고
    • Inductive inference of regular term tree languages and its application to knowledge discovery
    • IOS Press
    • 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 Base XI, IOS Press, pages 85-102, 2000.
    • (2000) Information Modelling and Knowledge Base XI , pp. 85-102
    • Shoudai, T.1    Miyahara, T.2    Uchida, T.3    Matsumoto, S.4
  • 9
    • 0029252137 scopus 로고
    • Parallel algorithm for refutation tree problem on formal graph systems
    • T. Uchida, T. Shoudai, and S. Miyano. Parallel algorithm for refutation tree problem on formal graph systems. IEICE Trans. Inf. Syst., E78-D(2):99-112, 1995.
    • (1995) IEICE Trans. Inf. Syst. , vol.E78-D , Issue.2 , pp. 99-112
    • Uchida, T.1    Shoudai, T.2    Miyano, S.3
  • 10
    • 0033699332 scopus 로고    scopus 로고
    • Discovering structural association of semistructured data
    • K. Wang and H. Liu. Discovering structural association of semistructured data. IEEE Trans. Knowledge and Data Engineering, 12:353-371, 2000.
    • (2000) IEEE Trans. Knowledge and Data Engineering , vol.12 , pp. 353-371
    • Wang, K.1    Liu, H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.