메뉴 건너뛰기




Volumn 3918 LNAI, Issue , 2006, Pages 292-302

XCLS: A fast and effective clustering algorithm for heterogenous XML documents

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE; DATA PROCESSING; INFORMATION RETRIEVAL; XML;

EID: 33745775475     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11731139_35     Document Type: Conference Paper
Times cited : (17)

References (15)
  • 1
    • 0242578166 scopus 로고    scopus 로고
    • A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications
    • Bertino, E., Guerrini, G. & Mesiti, M. (2004). A Matching Algorithm for Measuring the Structural Similarity between an XML Document and a DTD and its applications. Information Systems, 29(1): 23-46.
    • (2004) Information Systems , vol.29 , Issue.1 , pp. 23-46
    • Bertino, E.1    Guerrini, G.2    Mesiti, M.3
  • 6
    • 23844475451 scopus 로고    scopus 로고
    • On the use of hierarchical information in sequential mining-based XML document similarity computation
    • Leung, H.-p., Chung, F.-l., & Chan, S. C.-f. (2005). On the use of hierarchical information in sequential mining-based XML document similarity computation. Knowledge and Information Systems, 7(4),pp 476-498.
    • (2005) Knowledge and Information Systems , vol.7 , Issue.4 , pp. 476-498
    • Leung, H.-P.1    Chung, F.-L.2    Chan, S.C.-F.3
  • 7
    • 33745790524 scopus 로고    scopus 로고
    • XMine: A methodology for mining XML structure
    • To appear in. January 2006, China
    • Nayak R and Iryadi W (2006). XMine: A methodology for mining XML structure. To appear in The Eighth Asia Pacific Web Conference. January 2006, China.
    • (2006) The Eighth Asia Pacific Web Conference
    • Nayak, R.1    Iryadi, W.2
  • 10
    • 0034860127 scopus 로고    scopus 로고
    • Xylem: A dynamic Warehouse for XML data of the Web
    • 2001
    • Xylem L. (2001). Xylem: A dynamic Warehouse for XML data of the Web," IDEAS'01, pp3-7, 2001.
    • (2001) IDEAS'01 , pp. 3-7
    • Xylem, L.1
  • 13
    • 24644433353 scopus 로고    scopus 로고
    • Clustering transactions using large items
    • Kansas, Missouri
    • Wang, K., Xu, C. (1999), Clustering Transactions Using Large Items, in the proceedings of ACM CIKM-99, Kansas, Missouri.
    • (1999) Proceedings of ACM CIKM-99
    • Wang, K.1    Xu, C.2
  • 14
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • Zhang, K., & Shasha, D. (1989). Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems. SIAM Journal Computing, 18(6), 1245-1262.
    • (1989) SIAM Journal Computing , vol.18 , Issue.6 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2
  • 15
    • 0038156237 scopus 로고    scopus 로고
    • Evaluation of hierarchical clustering algorithms for document datasets
    • USA
    • Zhao, Y., & Karypis, G. (2002). Evaluation of Hierarchical Clustering Algorithms for Document Datasets. The 2002 ACM CIKM, USA.
    • (2002) The 2002 ACM CIKM
    • Zhao, Y.1    Karypis, G.2


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