Decentralized K-means using randomized Gossip protocols for clustering large datasets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Decentralized K-means using randomized Gossip protocols for clustering large datasets

Résumé

In this paper, we consider the clustering of very large datasets distributed over a network of computational units using a decentralized K-means algorithm. To obtain the same codebook at each node of the network, we use a randomized gossip aggregation protocol where only small messages are ex- changed. We theoretically show the equivalence of the algorithm with a centralized K-means, provided a bound on the number of messages each node has to send is met. We provide experiments showing that the consensus is reached for a number of messages consistent with the bound, but also for a smaller number of messages, albeit with a less smooth evolution of the objective function.
Fichier principal
Vignette du fichier
fellus13kdcloud.pdf (385.5 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00915822 , version 1 (09-12-2013)

Identifiants

  • HAL Id : hal-00915822 , version 1

Citer

Jérôme Fellus, David Picard, Philippe-Henri Gosselin. Decentralized K-means using randomized Gossip protocols for clustering large datasets. International Workshop on Knowledge Discovery Using Cloud and Distributed Computing Platforms, Dec 2013, Dallas, Texas, United States. pp.8. ⟨hal-00915822⟩
479 Consultations
465 Téléchargements

Partager

Gmail Facebook X LinkedIn More