mlsanityData to 14 Oct 2026

Lightweight Trustworthy Distributed Clustering

arXiv 2504.10109 ↗First posted 14 Apr 2025cs.DC cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Ensuring data trustworthiness within individual edge nodes while facilitating collaborative data processing poses a critical challenge in edge computing systems (ECS), particularly in resource-constrained scenarios such as autonomous systems sensor networks, industrial IoT, and smart cities. This paper presents a lightweight, fully distributed k-means clustering algorithm specifically adapted for edge environments, leveraging a distributed averaging approach with additive secret sharing, a secure multiparty computation technique, during the cluster center update phase to ensure the accuracy and trustworthiness of data across nodes.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 5 of its 41 references that are in the map. First posted on arXiv 14 Apr 2025.

Builds on

5 of 41 references.

References · 5

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  2. 2017Distributed Optimization Using the Primal-Dual Method of Multiplierscited by 13
  3. 2023Adaptive Differentially Quantized Subspace Perturbation (ADQSP): A Unified Framework for Privacy-Preserving Distributed Average Consensuscited by 6
  4. 2023On the privacy of federated Clustering: A Cryptographic Viewcited by 4
  5. 2024Trustworthiness of Stochastic Gradient Descent in Distributed Learningcited by 2

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.