Small Space Representations for Metric Min-sum k-Clustering and Their Applications
Czumaj, A. and Sohler, C. (2009) Small Space Representations for Metric Min-sum k-Clustering and Their Applications. In: Theory of Computing Systems. Springer Science+Business Media, LLC 2009, pp. 416-442.
Restricted to Repository staff only
Official URL: http://dx.doi.org/10.1007/s00224-009-9235-1
The min-sum k -clustering problem is to partition a metric space (P,d) into k clusters C 1,…,C k ⊆P such that is minimized. We show the first efficient construction of a coreset for this problem. Our coreset construction is based on a new adaptive sampling algorithm. With our construction of coresets we obtain two main algorithmic results.
The first result is a sublinear-time (4+ε)-approximation algorithm for the min-sum k-clustering problem in metric spaces. The running time of this algorithm is for any constant k and ε, and it is o(n 2) for all k=o(log n/log log n). Since the full description size of the input is Θ(n 2), this is sublinear in the input size. The fastest previously known o(log n)-factor approximation algorithm for k>2 achieved a running time of Ω(n k ), and no non-trivial o(n 2)-time algorithm was known before.
Our second result is the first pass-efficient data streaming algorithm for min-sum k-clustering in the distance oracle model, i.e., an algorithm that uses poly(log n,k) space and makes 2 passes over the input point set, which arrives in form of a data stream in arbitrary order. It computes an implicit representation of a clustering of (P,d) with cost at most a constant factor larger than that of an optimal partition. Using one further pass, we can assign each point to its corresponding cluster.
To develop the coresets, we introduce the concept of α -preserving metric embeddings. Such an embedding satisfies properties that the distance between any pair of points does not decrease and the cost of an optimal solution for the considered problem on input (P,d′) is within a constant factor of the optimal solution on input (P,d). In other words, the goal is to find a metric embedding into a (structurally simpler) metric space that approximates the original metric up to a factor of α with respect to a given problem. We believe that this concept is an interesting generalization of coresets.
|Item Type:||Book Section|
|Uncontrolled Keywords:||focs sublinear-time algorithms sublinear-space algorithms clustering min-sum k-clustering balanced k-median streaming algorithms coresets|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Faculty of Science > Computer Science|
|Depositing User:||Ms Saima Arif|
|Date Deposited:||05 Jan 2011 09:04|
|Last Modified:||07 Dec 2011 15:57|
Actions (login required)