Consistent k-Clustering for General Metrics

by   Hendrik Fichtenberger, et al.

Given a stream of points in a metric space, is it possible to maintain a constant approximate clustering by changing the cluster centers only a small number of times during the entire execution of the algorithm? This question received attention in recent years in the machine learning literature and, before our work, the best known algorithm performs O(k^2) center swaps (the O(·) notation hides polylogarithmic factors in the number of points n and the aspect ratio Δ of the input instance). This is a quadratic increase compared to the offline case – the whole stream is known in advance and one is interested in keeping a constant approximation at any point in time – for which O(k) swaps are known to be sufficient and simple examples show that Ω(k log(n Δ)) swaps are necessary. We close this gap by developing an algorithm that, perhaps surprisingly, matches the guarantees in the offline setting. Specifically, we show how to maintain a constant-factor approximation for the k-median problem by performing an optimal (up to polylogarithimic factors) number O(k) of center swaps. To obtain our result we leverage new structural properties of k-median clustering that may be of independent interest.


page 1

page 2

page 3

page 4


Sequential no-Substitution k-Median-Clustering

We study the sample-based k-median clustering objective under a sequenti...

Fully Dynamic k-Center Clustering in Doubling Metrics

In the k-center clustering problem, we are given a set of n points in a ...

A Constant Approximation Algorithm for Sequential No-Substitution k-Median Clustering under a Random Arrival Order

We study k-median clustering under the sequential no-substitution settin...

Unexpected Effects of Online K-means Clustering

In this paper we study k-means clustering in the online setting. In the ...

Approximation Algorithms for Continuous Clustering and Facility Location Problems

We consider the approximability of center-based clustering problems wher...

Improved Algorithms for Time Decay Streams

In the time-decay model for data streams, elements of an underlying data...

Information Elicitation Meets Clustering

In the setting where we want to aggregate people's subjective evaluation...