Clustering to Minimize Cluster-Aware Norm Objectives
Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase

TL;DR
This paper introduces a generalized clustering framework called $(f,g)$-Clustering, which captures cluster-aware objectives like Min-Sum of Radii, and provides constant-factor approximation algorithms for specific cases.
Contribution
The paper formulates a new general clustering problem that models cluster-aware objectives and develops approximation algorithms for particular norm-based cases.
Findings
Designed a constant-factor approximation for $( extsf{top}_ll,\u2113_1)$-Clustering.
Developed a constant-factor approximation for $(\u2113_infty, extsf{Ord})$-Clustering.
Generalizes many fundamental clustering problems including $k$-Center and $k$-Median.
Abstract
We initiate the study of the following general clustering problem. We seek to partition a given set of data points into clusters by finding a set of centers and assigning each data point to one of the centers. The cost of a cluster, represented by a center , is a monotone, symmetric norm (inner norm) of the vector of distances of points assigned to . The goal is to minimize a norm (outer norm) of the vector of cluster costs. This problem, which we call -Clustering, generalizes many fundamental clustering problems such as -Center, -Median , Min-Sum of Radii, and Min-Load -Clustering . A recent line of research (Chakrabarty, Swamy [STOC'19]) studies norm objectives that are oblivious to the cluster structure such as -Median and -Center. In contrast, our problem models cluster-aware objectives including Min-Sum of Radii and Min-Load…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Clustering Algorithms Research
MethodsSparse Evolutionary Training
