paper-with-me

Papers

A Unified Framework for Center-based Clustering of Distributed Data

2024-02-02 · Aleksandar Armacki, Dragana Bajović, Dušan Jakovetić, Soummya Kar

We develop a family of distributed center-based clustering algorithms that work over networks of users. In the proposed scenario, users contain a local dataset and communicate only with their immediate neighbours, with the aim of finding a clustering of the full, joint data. The proposed family, termed Distributed Gradient Clustering (DGC-$\mathcal{F}_\rho$), is parametrized by $\rho \geq 1$, controling the proximity of users' center estimates, with $\mathcal{F}$ determining the clustering loss. Our framework allows for a broad class of smooth convex loss functions, including popular clustering losses like $K$-means and Huber loss. Specialized to popular clustering losses like $K$-means and Huber loss, DGC-$\mathcal{F}_\rho$ gives rise to novel distributed clustering algorithms DGC-KM$_\rho$ and DGC-HL$_\rho$, while novel clustering losses based on Logistic and Fair functions lead to DGC-LL$_\rho$ and DGC-FL$_\rho$. We provide a unified analysis and establish several strong results, under mild assumptions. First, we show that the sequence of centers generated by the methods converges to a well-defined notion of fixed point, under any center initialization and value of $\rho$. Second, we prove that, as $\rho$ increases, the family of fixed points produced by DGC-$\mathcal{F}_\rho$ converges to a notion of consensus fixed points. We show that consensus fixed points of DGC-$\mathcal{F}_{\rho}$ are equivalent to fixed points of gradient clustering over the full data, guaranteeing a clustering of the full data is produced. For the special case of Bregman losses, we show that our fixed points converge to the set of Lloyd points. Extensive numerical experiments on synthetic and real data confirm our theoretical findings, show strong performance of our methods and demonstrate the usefulness and wide range of potential applications of our general framework, such as outlier detection.

📄 PDF Abstract BibTeX arXiv:2402.01302

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringOutlier Detection

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically
Huber loss The Huber loss function describes the penalty incurred by an estimation procedure f. Huber (1964) defines the loss function piecewise by[1] L δ ( a ) = { 1 2 a 2 for | a |…

Similar Papers 제목 키워드 기반

Fast Distributed k-Center Clustering with Outliers on Massive Data

2015-12-01 · NeurIPS 2015 12 · Gustavo Malkomes, Matt J. Kusner, Wenlin Chen, Kilian Q. Weinberger 외

Clustering large data is a fundamental problem with a vast number of applications. Due to the increasing size of data, practitioners interested in clustering have turned to distributed computation methods. In this work…

ClusteringDistributed Computing

Distributed Balanced Clustering via Mapping Coresets

2014-12-01 · NeurIPS 2014 12 · Mohammadhossein Bateni, Aditya Bhaskara, Silvio Lattanzi, Vahab Mirrokni

Large-scale clustering of data points in metric spaces is an important problem in mining big data sets. For many applications, we face explicit or implicit size constraints for each cluster which leads to the problem of …

Clustering

Distributed Gradient Clustering: Convergence and the Effect of Initialization

2026-03-20 · Aleksandar Armacki, Himkant Sharma, Dragana Bajović, Dušan Jakovetić 외 arxiv

We study the effects of center initialization on the performance of a family of distributed gradient-based clustering algorithms introduced in [1], that work over connected networks of users. In the considered scenario, …

A Fixed point view: A Model-Based Clustering Framework

2020-02-19 · Jianhao Ding, Lansheng Han

With the inflation of the data, clustering analysis, as a branch of unsupervised learning, lacks unified understanding and application of its mathematical law. Based on the view of fixed point, this paper restates the mo…

Clustering

Socially Fair Center-based and Linear Subspace Clustering

2022-08-22 · Sruthi Gorantla, Kishen N. Gowda, Amit Deshpande, Anand Louis

Center-based clustering (e.g., $k$-means, $k$-medians) and clustering using linear subspaces are two most popular techniques to partition real-world data into smaller clusters. However, when the data consists of sensitiv…

ClusteringFairness