Performance guarantees for hierarchical clustering

Journal of Computer and System Sciences

Volumn 70, Issue 4, 2005, Pages 555-569

  Dasgupta, Sanjoy ^a   Long, Philip M ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b GENOME INSTITUTE OF SINGAPORE   (Singapore)

Author keywords

Complete linkage; Hierarchical clustering; k Center

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC METHODS; PROBLEM SOLVING; RECURSIVE FUNCTIONS; THEOREM PROVING;

COMPLETE LINKAGE; COST FUNCTIONS; HIERARCHICAL CLUSTERING; K-CENTER;

DATA HANDLING;

EID: 17444397705     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.10.006     Document Type: Conference Paper

References (16)

1. V. Arya, N. Garg, V. Khandekar, V. Pandit, A. Meyerson, K. Munagala, Local search heuristics for k-median and facility location problems, Proceedings of the 33rd ACM Symposium on the Theory of Computing, 2001.
2. A. Borodin, R. Ostrovsky, Y. Rabani, Subquadratic approximation algorithms for clustering problems in high dimensional spaces, Proceedings of the 31st ACM Symposium on the Theory of Computing, 1999.
3. M. Charikar, C. Chekuri, T. Feder, R. Motwani, Incremental clustering and dynamic information retrieval, Proceedings of the 29th ACM Symposium on the Theory of Computing, 1997.
4. S. Dasgupta, L.J. Schulman, A two-round variant of em for gaussian mixtures, Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence, 2000.
5. M.B. Eisen, P.T. Spellman, P.O. Brown, D. Botstein, Cluster analysis and display of genome-wide expression patterns, Proceedings of the National Academy of Sciences, 95 1998, pp. 14863-14868.
6. T. Feder, D. Greene, Optimal algorithms for approximate clustering, Proceedings of the 20th ACM Symposium on the Theory of Computing, 1988.
7. T.F. González Clustering to minimize the maximum intercluster distance Theoret. Comput. Sci. 38 1985 293 306
8. J.A. Hartigan, Statistical theory in clustering, J. Classifi. (2) (1985) 63-76.
9. D. Hochbaum, and D. Shmoys A best possible heuristic for the k-center problem Math. Oper. Res. 10 2 1985 180 184
10. M.J. Kearns, Y. Mansour, A. Ng, An information-theoretic analysis of hard and soft assignment methods for clustering, Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence, 1997.
11. P.M. Long The complexity of learning according to two models of a drifting environment Mach. Learn. 37 3 1999 337 354
12. R.R. Mettu, Approximation algorithms for NP-hard clustering problems, Ph.D. Thesis, Department of Computer Science, University of Texas at Austin, August 2002.
13. R. Motwani, S. Phillips, and E. Torng Non-clairvoyant scheduling Theoret. Comput. Sci. 130 1994 17 47
14. G. Plaxton, Approximation algorithms for hierarchical location problems, Proceedings of the 35th ACM Symposium on the Theory of Computing, 2003.
15. D. Pollard Convergence of Stochastic Processes 1984 Springer Berlin
16. M. Thorup. Quick k-median, k-center, and facility location for sparse graphs, International Colloquium on Automata, Languages, and Programming, 2001.