Log In Sign Up

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

by   Tom Hess, et al.

We study k-median clustering under the sequential no-substitution setting. In this setting, a data stream is sequentially observed, and some of the points are selected by the algorithm as cluster centers. However, a point can be selected as a center only immediately after it is observed, before observing the next point. In addition, a selected center cannot be substituted later. We give a new algorithm for this setting that obtains a constant approximation factor on the optimal risk under a random arrival order. This is the first such algorithm that holds without any assumptions on the input data and selects a non-trivial number of centers. The number of selected centers is quasi-linear in k. Our algorithm and analysis are based on a careful risk estimation that avoids outliers, a new concept of a linear bin division, and repeated calculations using an offline clustering algorithm.


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...

Consistent k-Clustering for General Metrics

Given a stream of points in a metric space, is it possible to maintain a...

k-Median clustering under discrete Fréchet and Hausdorff distances

We give the first near-linear time (1+)-approximation algorithm for k-me...

No-substitution k-means Clustering with Adversarial Order

We investigate k-means clustering in the online no-substitution setting ...

Unexpected Effects of Online K-means Clustering

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

Improved constant approximation factor algorithms for k-center problem for uncertain data

In real applications, database systems should be able to manage and proc...

Coresets for Ordered Weighted Clustering

We design coresets for Ordered k-Median, a generalization of classical c...