메뉴 건너뛰기




Volumn , Issue , 2004, Pages 188-197

Discovering frequently changing structures from historical structural deltas of unordered XML

Author keywords

Data mining; XML

Indexed keywords

ALGORITHMS; DATA ACQUISITION; DATA MINING; DATABASE SYSTEMS; INDEXING (OF INFORMATION); OPTIMIZATION;

EID: 18744403708     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1031171.1031210     Document Type: Conference Paper
Times cited : (11)

References (12)
  • 2
    • 7444269920 scopus 로고    scopus 로고
    • Mining association rules from structural deltas of historical XML documents
    • L. Chen, S. S. Bhowmick and C. Chia. Mining Association Rules from Structural Deltas of Historical XML Documents. In In Proc. PAKDD, 452-457, 2004.
    • (2004) Proc. PAKDD , pp. 452-457
    • Chen, L.1    Bhowmick, S.S.2    Chia, C.3
  • 4
    • 18744365900 scopus 로고    scopus 로고
    • Fast difference and update of XML documents
    • Curbera and D. A. Epstein. Fast difference and update of XML documents. In Proc. XTech'99, 1999.
    • (1999) Proc. XTech'99
    • Curbera1    Epstein, D.A.2
  • 5
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. SIGMOD, 1-12, 2000.
    • (2000) Proc. SIGMOD , pp. 1-12
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 6
    • 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. PKDD, 13-23, 2000.
    • (2000) Proc. PKDD , pp. 13-23
    • Inokuchi, A.1    Washio, T.2    Motoda, H.3
  • 7
    • 78149312583 scopus 로고    scopus 로고
    • Frequent subgraph discovery
    • M, Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc. ICDM, 313-320, 2001.
    • (2001) Proc. ICDM , pp. 313-320
    • Kuramochi, M.1    Karypis, G.2
  • 8
    • 0344927764 scopus 로고    scopus 로고
    • X-diff: An effective change detection algorithm for XML documents
    • Y. Wang, D. J. DeWitt, and J.-Y. Cai. X-diff: An effective change detection algorithm for XML documents. In Proc. ICDE, 519-530, 2003.
    • (2003) Proc. ICDE , pp. 519-530
    • Wang, Y.1    DeWitt, D.J.2    Cai, J.-Y.3
  • 9
    • 78149333073 scopus 로고    scopus 로고
    • GSpan: Graph-based substructure pattern mining
    • X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In Proc. ICDM, 721-724, 2002.
    • (2002) Proc. ICDM , pp. 721-724
    • Yan, X.1    Han, J.2
  • 10
    • 0242709382 scopus 로고    scopus 로고
    • Efficiently mining frequent trees in a forest
    • M. J. Zaki. Efficiently mining frequent trees in a forest. In Proc. SIGKDD, 71-80, 2002.
    • (2002) Proc. SIGKDD , pp. 71-80
    • Zaki, M.J.1
  • 11
    • 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. SIGKDD, 316-325, 2003.
    • (2003) Proc. SIGKDD , pp. 316-325
    • Zaki, M.J.1    Aggarwal, C.C.2
  • 12
    • 18744379585 scopus 로고    scopus 로고
    • Mining changes to historical web access patterns
    • Q. Zhao and S. S. Bhowmick. Mining changes to historical web access patterns. In Pro. PKDD, 2004.
    • (2004) Pro. PKDD
    • Zhao, Q.1    Bhowmick, S.S.2


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