Analysis of agglomerative clustering

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 9, Issue , 2011, Pages 308-319

  Ackermann, Marcel R ^a   Blömer, Johannes ^a   Kuntze, Daniel ^a   Sohler, Christian ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Agglomerative clustering; Approximation guarantees; Complete linkage; Hierarchical clustering

Indexed keywords

AGGLOMERATIVE CLUSTERING; AGGLOMERATIVE CLUSTERING ALGORITHM; APPROXIMATE SOLUTION; APPROXIMATION GUARANTEES; COMPLETE LINKAGE; EUCLIDEAN DISTANCE; FINITE SUBSETS; HIER-ARCHICAL CLUSTERING;

APPROXIMATION ALGORITHMS; COMPUTER SCIENCE;

CLUSTERING ALGORITHMS;

EID: 84880274618     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2011.308     Document Type: Conference Paper

References (14)

1. M. R. Ackermann, J. Blömer, D. Kuntze, and C. Sohler. Analysis of Agglomerative Clustering. CoRR: Computing Research Repository, 2010. arXiv:1012.3697 [cs.DS].
2. M. Badoiu, S. Har-Peled, and P. Indyk. Approximate Clustering via Core-Sets. In Proceedings of STOC '02, pages 250-257, 2002.
3. A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic Clustering of the Web. In Selected papers from the sixth intern. conf. on WWW, pages 1157-1166, Essex, UK, 1997. Elsevier Science Publishers Ltd.
4. M. Charikar, C. Chekuri, T. Feder, and R. Motwani. Incremental Clustering and Dynamic Information Retrieval. SIAM J. Comput., 3:1417-1440, June 2004.
5. S. Dasgupta and P. M. Long. Performance Guarantees for Hierarchical Clustering. JCSS: Journal of Computer and System Sciences, 70(4):555-569, 2005.
6. M. B. Eisen, P. T. Spellman, P. O. Brown, and D. Botstein. Cluster analysis and display of genome-wide expression patterns. PNAS: Proceedings of the National Academy of Sciences, 95(25):14863-14868, December 1998.
7. T. Feder and D. Greene. Optimal algorithms for approximate clustering. In Proceedings of STOC '88, pages 434-444, New York, NY, USA, 1988. ACM.
8. K. Florek, J. Lukaszewicz, J. Perkal, H. Steinhaus, and S. Zubrzycki. Sur la liaison et la division des points d'un ensemble fini. Colloqium Math., 2:282-285, 1951.
9. T. F. Gonzalez. Clustering to Minimize the Maximum Intercluster Distance. Theoretical Computer Science, 38:293-306, 1985.
10. K. Lee, J. Kim, K. Kwon, Y. Han, and S. Kim. DDoS attack detection method using cluster analysis. Expert Systems with Applications, 34(3):1659-1665, 2008.
11. L. L. McQuitty. Elementary Linkage Analysis for Isolating Orthogonal and Oblique Types and Typal Relevancies. Educational and Psychological Measurement, 17:207-209, 1957.
12. M. Naszódi. Covering a Set with Homothets of a Convex Body. Positivity, 2009.
13. F. Pereira, N. Tishby, and L. Lee. Distributional Clustering of English Words. In Proceedings of the 31st Annual Meeting of the Association for Computational Linguistics, pages 183-190, 1993.
14. P. H. A. Sneath and R. R. Sokal. Numerical taxonomy: the principles and practice of numerical classification. W. H. Freeman, 1973.