Federated k-Means via Generalized Total Variation Minimization

• URL: http://arxiv.org/abs/2510.09718v1
• Date: Fri, 10 Oct 2025 06:32:28 GMT
• Title: Federated k-Means via Generalized Total Variation Minimization
• Authors: A. Jung,
• Abstract summary: We consider the problem of federated clustering, where interconnected devices have access to private local datasets and need to jointly cluster the overall dataset without sharing their local dataset.<n>Our focus is on hard clustering based on the k-means principle.<n>We formulate federated k-means clustering as an instance of GTVMin.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider the problem of federated clustering, where interconnected devices have access to private local datasets and need to jointly cluster the overall dataset without sharing their local dataset. Our focus is on hard clustering based on the k-means principle. We formulate federated k-means clustering as an instance of GTVMin. This formulation naturally lends to a federated k-means algorithm where each device updates local cluster centroids by solving a modified local k-means problem. The modification involves adding a penalty term to measure the discrepancy between the cluster centroid of neighbouring devices. Our federated k-means algorithm is privacy-friendly as it only requires sharing aggregated information among interconnected devices.

Related papers

• K*-Means: A Parameter-free Clustering Algorithm [55.20132267309382]
  k*-means is a novel clustering algorithm that eliminates the need to set k or any other parameters.<n>It uses the minimum description length principle to automatically determine the optimal number of clusters, k*, by splitting and merging clusters.<n>We prove that k*-means is guaranteed to converge and demonstrate experimentally that it significantly outperforms existing methods in scenarios where k is unknown.
  arXiv  Detail & Related papers  (2025-05-17T08:41:07Z)
• How to optimize K-means? [8.206124331448931]
  Center-based clustering algorithms (e.g., K-means) are popular for clustering tasks, but they usually struggle to achieve high accuracy on complex datasets.<n>We believe the main reason is that traditional center-based clustering algorithms identify only one clustering center in each cluster.<n>We propose a general optimization method called ECAC, and it can optimize different center-based clustering algorithms.
  arXiv  Detail & Related papers  (2025-03-25T03:37:52Z)
• Self-Supervised Graph Embedding Clustering [70.36328717683297]
  K-means one-step dimensionality reduction clustering method has made some progress in addressing the curse of dimensionality in clustering tasks. We propose a unified framework that integrates manifold learning with K-means, resulting in the self-supervised graph embedding framework.
  arXiv  Detail & Related papers  (2024-09-24T08:59:51Z)
• Fuzzy K-Means Clustering without Cluster Centroids [21.256564324236333]
  Fuzzy K-Means clustering is a critical technique in unsupervised data analysis. This paper proposes a novel Fuzzy textitK-Means clustering algorithm that entirely eliminates the reliance on cluster centroids.
  arXiv  Detail & Related papers  (2024-04-07T12:25:03Z)
• Dynamically Weighted Federated k-Means [0.0]
  Federated clustering enables multiple data sources to collaboratively cluster their data, maintaining decentralization and preserving privacy. We introduce a novel federated clustering algorithm named Dynamically Weighted Federated k-means (DWF k-means) based on Lloyd's method for k-means clustering. We conduct experiments on multiple datasets and data distribution settings to evaluate the performance of our algorithm in terms of clustering score, accuracy, and v-measure.
  arXiv  Detail & Related papers  (2023-10-23T12:28:21Z)
• Federated K-means Clustering [0.0]
  Federated learning is a technique that enables the use of distributed datasets for machine learning purposes without requiring data to be pooled. This work introduces an algorithm which implements K-means clustering in a federated manner.
  arXiv  Detail & Related papers  (2023-10-02T13:32:00Z)
• Federated clustering with GAN-based data synthesis [12.256298398007848]
  Federated clustering (FC) is an extension of centralized clustering in federated settings. We propose a new federated clustering framework, named synthetic data aided federated clustering (SDA-FC) It trains generative adversarial network locally in each client and uploads the generated synthetic data to the server, where KM or FCM is performed on the synthetic data. The synthetic data can make the model immune to the non-IID problem and enable us to capture the global similarity characteristics more effectively without sharing private data.
  arXiv  Detail & Related papers  (2022-10-29T07:42:11Z)
• Machine Unlearning of Federated Clusters [36.663892269484506]
  Federated clustering is an unsupervised learning problem that arises in a number of practical applications, including personalized recommender and healthcare systems. We introduce, for the first time, the problem of machine unlearning for FC. We propose an efficient unlearning mechanism for a customized secure FC framework.
  arXiv  Detail & Related papers  (2022-10-28T22:21:29Z)
• Towards Federated Clustering: A Federated Fuzzy $c$-Means Algorithm (FFCM) [0.0]
  Federated Learning (FL) is a setting where multiple parties with distributed data collaborate in training a joint Machine Learning (ML) model. We describe how this area of research can be of interest to itself, or how it helps addressing issues like non-independently-identically-distributed (i.i.d.) data. We propose two methods to calculate global cluster centers and evaluate their behaviour through challenging numerical experiments.
  arXiv  Detail & Related papers  (2022-01-18T21:22:28Z)
• Differentially-Private Clustering of Easy Instances [67.04951703461657]
  In differentially private clustering, the goal is to identify $k$ cluster centers without disclosing information on individual data points. We provide implementable differentially private clustering algorithms that provide utility when the data is "easy" We propose a framework that allows us to apply non-private clustering algorithms to the easy instances and privately combine the results.
  arXiv  Detail & Related papers  (2021-12-29T08:13:56Z)
• Anomaly Clustering: Grouping Images into Coherent Clusters of Anomaly Types [60.45942774425782]
  We introduce anomaly clustering, whose goal is to group data into coherent clusters of anomaly types. This is different from anomaly detection, whose goal is to divide anomalies from normal data. We present a simple yet effective clustering framework using a patch-based pretrained deep embeddings and off-the-shelf clustering methods.
  arXiv  Detail & Related papers  (2021-12-21T23:11:33Z)
• Robust Trimmed k-means [70.88503833248159]
  We propose Robust Trimmed k-means (RTKM) that simultaneously identifies outliers and clusters points. We show RTKM performs competitively with other methods on single membership data with outliers and multi-membership data without outliers.
  arXiv  Detail & Related papers  (2021-08-16T15:49:40Z)
• FedMix: Approximation of Mixup under Mean Augmented Federated Learning [60.503258658382]
  Federated learning (FL) allows edge devices to collectively learn a model without directly sharing data within each device. Current state-of-the-art algorithms suffer from performance degradation as the heterogeneity of local data across clients increases. We propose a new augmentation algorithm, named FedMix, which is inspired by a phenomenal yet simple data augmentation method, Mixup.
  arXiv  Detail & Related papers  (2021-07-01T06:14:51Z)
• Local Connectivity in Centroid Clustering [3.4925763160992402]
  We propose 'local connectivity' as a crucial factor in assessing membership desert in centroid clustering. We use local connectivity to refer to the support offered by the local neighborhood of an object towards supporting its membership to the cluster in question. We then exploit concepts from density-based clustering and devise LOFKM, a clustering method that seeks to deepen local connectivity in clustering outputs.
  arXiv  Detail & Related papers  (2020-10-11T21:56:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.