Coresets for Weight-Constrained Anisotropic Assignment and Clustering

by   Maximilian Fiedler, et al.

The present paper constructs coresets for weight-constrained anisotropic assignment and clustering. In contrast to the well-studied unconstrained least-squares clustering problem, approximating the centroids of the clusters no longer suffices in the weight-constrained anisotropic case, as even the assignment of the points to best sites is involved. This assignment step is often the limiting factor in materials science, a problem that partially motivates our work. We build on a paper by Har-Peled and Kushal, who constructed coresets of size π’ͺ(k^3/Ο΅^d+1) for unconstrained least-squares clustering. We generalize and improve on their results in various ways, leading to even smaller coresets with a size of only π’ͺ(k^2/Ο΅^d+1) for weight-constrained anisotropic clustering. Moreover, we answer an open question on coreset designs in the negative, by showing that the total sensitivity can become as large as the cardinality of the original data set in the constrained case. Consequently, many techniques based on importance sampling do not apply to weight-constrained clustering.


page 1

page 2

page 3

page 4

βˆ™ 02/10/2023

Neural Capacitated Clustering

Recent work on deep clustering has found new promising methods also for ...
βˆ™ 09/05/2022

The Power of Uniform Sampling for Coresets

Motivated by practical generalizations of the classic k-median and k-mea...
βˆ™ 10/02/2018

A Unified Framework for Clustering Constrained Data without Locality Property

In this paper, we consider a class of constrained clustering problems of...
βˆ™ 02/09/2023

Importance Sampling Deterministic Annealing for Clustering

A current assumption of most clustering methods is that the training dat...
βˆ™ 02/20/2020

Reliable Distributed Clustering with Redundant Data Assignment

In this paper, we present distributed generalized clustering algorithms ...
βˆ™ 05/22/2017

Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization

Plain vanilla K-means clustering is prone to produce unbalanced clusters...
βˆ™ 09/24/2019

Applicability and Interpretability of Hierarchical Agglomerative Clustering With or Without Contiguity Constraints

Hierarchical Agglomerative Classification (HAC) with Ward's linkage has ...

Please sign up or login with your details

Forgot password? Click here to reset