메뉴 건너뛰기




Volumn 3268, Issue , 2004, Pages 547-556

Clustering XML documents using structural summaries

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; XML;

EID: 35048847659     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30192-9_54     Document Type: Article
Times cited : (44)

References (16)
  • 2
    • 0002816102 scopus 로고    scopus 로고
    • Comparing hierarchical data in external memory
    • Edinburgh, Scotland, UK
    • S. S. Chawathe. Comparing hierarchical data in external memory. In Proc. of the VLDB Conference, Edinburgh, Scotland, UK, 1999.
    • (1999) Proc. of the VLDB Conference
    • Chawathe, S.S.1
  • 5
    • 9444250082 scopus 로고    scopus 로고
    • Knowledge management in bioinformatics
    • A. B. Chaudhri, A. Rashid, and R. Zicari, editors, Addison Wesley.
    • H. G. Direen and M. S. Jones. Knowledge management in bioinformatics. In A. B. Chaudhri, A. Rashid, and R. Zicari, editors, XML Data Management. 2003. Addison Wesley.
    • (2003) XML Data Management.
    • Direen, H.G.1    Jones, M.S.2
  • 8
    • 34250115918 scopus 로고
    • An examination of procedures for determining the number of clusters in a data set
    • G. W. Milligan and M. C. Cooper. An examination of procedures for determining the number of clusters in a data set. Psychometrika, 50, 1985.
    • (1985) Psychometrika , vol.50
    • Milligan, G.W.1    Cooper, M.C.2
  • 9
    • 14644393851 scopus 로고    scopus 로고
    • Evaluating structural similarity in xml documents
    • Madison, Wisconsin, USA, June
    • A. Nierman and H. V. Jagadish. Evaluating structural similarity in xml documents. In Proc. of the WebDB Workshop, Madison, Wisconsin, USA, June 2002.
    • (2002) Proc. of the WebDB Workshop
    • Nierman, A.1    Jagadish, H.V.2
  • 12
    • 0018491659 scopus 로고
    • The tree-to-tree correction problem
    • K. C. Tai. The tree-to-tree correction problem. Journal of ACM, 26, 1979.
    • (1979) Journal of ACM , vol.26
    • Tai, K.C.1
  • 14
    • 0015960104 scopus 로고
    • The string-to-string correction problem
    • R. Wagner and M. Fisher. The string-to-string correction problem. Journal of ACM, 21(1):168-173, 1974.
    • (1974) Journal of ACM , vol.21 , Issue.1 , pp. 168-173
    • Wagner, R.1    Fisher, M.2
  • 15
    • 0344927764 scopus 로고    scopus 로고
    • X-Diff: An effective change detection algorithm for XML documents
    • Bangalore, India
    • Y. Wang, D. DeWitt, and Jin-Yi Cai. X-Diff: An effective change detection algorithm for XML documents. In Proc. of the ICDE Conference, Bangalore, India, 2003.
    • (2003) Proc. of the ICDE Conference
    • Wang, Y.1    Dewitt, D.2    Cai, J.-Y.3
  • 16
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • K. Zhang and D. Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing, 18:1245-1262, 1989.
    • (1989) SIAM Journal of Computing , vol.18 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2


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