Distributed and Provably Good Seedings for k-Means in Constant Rounds.
Olivier BachemMario LucicAndreas KrausePublished in: ICML (2017)
Keyphrases
- k means
- distributed systems
- cooperative
- spectral clustering
- multi agent
- communication cost
- data clustering
- distributed environment
- self organizing maps
- clustering method
- clustering algorithm
- information retrieval
- peer to peer
- search engine
- computing environments
- communication overhead
- distributed data
- real time
- fault tolerant
- worst case
- query processing
- machine learning
- data sets