메뉴 건너뛰기




Volumn , Issue , 2004, Pages 335-338

Matching in frequent tree discovery

Author keywords

[No Author keywords available]

Indexed keywords

TREE INCORPORATION; TREE MATCHING; TREE MINING; WEB MINING;

EID: 19544384137     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2004.10064     Document Type: Conference Paper
Times cited : (8)

References (9)
  • 2
    • 84880874770 scopus 로고    scopus 로고
    • The levelwise version space algorithm and its application to molecular fragement finding
    • L. De Raedt and S. Kramer. The levelwise version space algorithm and its application to molecular fragement finding. In Proc. of IJCAI-01, pages 853-862, 2001.
    • (2001) Proc. of IJCAI-01 , pp. 853-862
    • De Raedt, L.1    Kramer, S.2
  • 3
    • 84974733299 scopus 로고    scopus 로고
    • An apriori-based algorithm for mining frequent substructures from graph data
    • A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. of PKDD, pages 13-23, 2000.
    • (2000) Proc. of PKDD , pp. 13-23
    • Inokuchi, A.1    Washio, T.2    Motoda, H.3
  • 7
    • 78149333073 scopus 로고    scopus 로고
    • Gspan: Graph-based substructure pattern mining
    • X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In Proc. of ICDM, 2002.
    • (2002) Proc. of ICDM
    • Yan, X.1    Han, J.2
  • 8
    • 0242709382 scopus 로고    scopus 로고
    • Efficiently mining frequent trees in a forest
    • M. Zaki. Efficiently mining frequent trees in a forest. In Proc. of KDD, 2002.
    • (2002) Proc. of KDD
    • Zaki, M.1
  • 9
    • 77952397753 scopus 로고    scopus 로고
    • Xrules: An effective structural classifier for xml data
    • M. J. Zaki and C. C. Aggarwal. Xrules: An effective structural classifier for xml data. In Proc. of SIGKDD 03, 2003.
    • (2003) Proc. of SIGKDD 03
    • Zaki, M.J.1    Aggarwal, C.C.2


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