Performance guarantees for hierarchical clustering
- 30 November 2004
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 70 (4), 555-569
- https://doi.org/10.1016/j.jcss.2004.10.006
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Quick k-Median, k-Center, and Facility Location for Sparse GraphsLecture Notes in Computer Science, 2001
- Subquadratic approximation algorithms for clustering problems in high dimensional spacesPublished by Association for Computing Machinery (ACM) ,1999
- An Information-Theoretic Analysis of Hard and Soft Assignment Methods for ClusteringPublished by Springer Science and Business Media LLC ,1998
- Incremental clustering and dynamic information retrievalPublished by Association for Computing Machinery (ACM) ,1997
- Nonclairvoyant schedulingTheoretical Computer Science, 1994
- Optimal algorithms for approximate clusteringPublished by Association for Computing Machinery (ACM) ,1988
- Statistical theory in clusteringJournal of Classification, 1985
- A Best Possible Heuristic for the k-Center ProblemMathematics of Operations Research, 1985
- Clustering to minimize the maximum intercluster distanceTheoretical Computer Science, 1985
- Convergence of stochastic processesBulletin of the American Mathematical Society, 1961