Clustering XML documents by structure

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3025, Issue , 2004, Pages 112-121

  Dalamagas, Theodore ^a   Cheng, Tao ^b   Winkel, Klaas Jan ^c   Sellis, Timos ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b University of California   (United States)

^c UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Clustering; Structural similarity; Structural summary; Tree distance; XML

Indexed keywords

ALGORITHMS; DATA TRANSFER; ESTIMATION; INTEROPERABILITY; MATHEMATICAL MODELS; TREES (MATHEMATICS); WORLD WIDE WEB; ARTIFICIAL INTELLIGENCE; XML;

CLUSTERING; STRUCTURAL SIMILARITY; STRUCTURAL SUMMARY; TREE DISTANCE; CLUSTERING METHODS; DISTANCE CALCULATION; ORDERED LABELED TREES;

XML; CLUSTERING ALGORITHMS;

EID: 9444279053     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-24674-9_13     Document Type: Conference Paper

References (17)

1. S. Abiteboul, P. Buneman, D. Suciu, Data on the Web., Morgan Kaufmann, 2000.
2. M. Garofalakis, A. Gionis, R. Rastogi, S. Seshadri, K. Shim, XTRACT: A system for extracting document type descriptors from XML documents, in: Proceedings of the ACM SIGMOD Conference,Texas, USA, 2000.
3. D. Sankoff, J. Kruskal, Time Warps, String Edits and Macromolecules, The Theory and Practice of Sequence Comparison, CSLI Publications, 1999.
4. H. G. Direen, M. S. Jones, Knowledge management in bioinformatics, in: A. B. Chaudhri, A. Rashid, R. Zicari (Eds.), XML Data Management, 2003, Addison Wesley.
5. R. Wagner, M. Fisher, The string-to-string correction problem, Journal of ACM 21 (1) (1974) 168-173.
6. K. C. Tai, The tree-to-tree correction problem, Journal of ACM 26 (1979) 422-433.
7. S. M. Selkow, The tree-to-tree editing problem, Information Processing Letters 6 (1977) 184-186.
8. S. S. Chawathe, Comparing hierarchical data in external memory, in: Proceedings of the VLDB Conference, Edinburgh, Scotland, UK, 1999, pp. 90-101.
9. S. S. Chawathe, A. Rajaraman, H. Garcia-Molina, J. Widom, Change Detection in Hierarchically Structured Information, in: Proceedings of the ACM SIGMOD Conference, USA, 1996.
10. K. Zhang, D. Shasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM Journal of Computing 18 (1989) 1245-1262.
11. E. Rasmussen, Clustering algorithms, in: W. Frakes, R. Baeza-Yates (Eds.), Information Retrieval: Data Structures and Algorithms, Prentice Hall, 1992.
12. M. Halkidi, Y. Batistakis, M. Vazirgiannis, Clustering algorithms and validity measures, in: SSDBM Conference, Virginia, USA, 2001.
13. C. J. van Rijsbergen, Information Retrieval, Butterworths, London, 1979.
14. J. C. Gower, G. J. S. Ross, Minimum spanning trees and single linkage cluster analysis, Applied Statistics 18 (1969) 54-64.
15. L. J. Hubert, J. R. Levin, A general statistical framework for accessing categorical clustering in free recall, Psychological Bulletin 83 (1976) 1072-1082.
16. G. W. Milligan, M. C. Cooper, An examination of procedures for determining the number of clusters in a data set, Psychometrika 50 (1985) 159-179.
17. A. Nierman, H. V. Jagadish, Evaluating structural similarity in xml documents, in: Proceedings of the WebDB Workshop, Madison, Wisconsin, USA, 2002.