Coresets for Ordered Weighted Clustering

by   Vladimir Braverman, et al.

We design coresets for Ordered k-Median, a generalization of classical clustering problems such as k-Median and k-Center, that offers a more flexible data analysis, like easily combining multiple objectives (e.g., to increase fairness or for Pareto optimization). Its objective function is defined via the Ordered Weighted Averaging (OWA) paradigm of Yager (1988), where data points are weighted according to a predefined weight vector, but in order of their contribution to the objective (distance from the centers). A powerful data-reduction technique, called a coreset, is to summarize a point set X in R^d into a small (weighted) point set X', such that for every set of k potential centers, the objective value of the coreset X' approximates that of X within factor 1±ϵ. When there are multiple objectives (weights), the above standard coreset might have limited usefulness, whereas in a simultaneous coreset, which was introduced recently by Bachem and Lucic and Lattanzi (2018), the above approximation holds for all weights (in addition to all centers). Our main result is a construction of a simultaneous coreset of size O_ϵ, d(k^2 ^2 |X|) for Ordered k-Median. To validate the efficacy of our coreset construction we ran experiments on a real geographical data set. We find that our algorithm produces a small coreset, which translates to a massive speedup of clustering computations, while maintaining high accuracy for a range of weights.


page 1

page 2

page 3

page 4


Constant-Factor Approximation for Ordered k-Median

We study the Ordered k-Median problem, in which the solution is evaluate...

Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median

We consider a generalization of k-median and k-center, called the order...

Approximation Algorithms for Clustering with Dynamic Points

In many classic clustering problems, we seek to sketch a massive data se...

A Method for Image Reduction Based on a Generalization of Ordered Weighted Averaging Functions

In this paper we propose a special type of aggregation function which ge...

Sequential no-Substitution k-Median-Clustering

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

Coresets for Clustering in Graphs of Bounded Treewidth

We initiate the study of coresets for clustering in graph metrics, i.e.,...

Coresets for Clustering with Missing Values

We provide the first coreset for clustering points in ℝ^d that have mult...

Please sign up or login with your details

Forgot password? Click here to reset