Chinese Whispers clustering Clustering algorithm
Reading time: less than 1 minute
What is Chinese Whispers clustering?
Chinese Whispers is a randomized graph-clustering algorithm. It can be implemented iteratively, and increasing the number of edges has a linear time cost. The algorithm is simple to implement with primitive data structures.
- Assign a unique cluster label to each node. If you have 5 nodes, they can be labeled (0, 1, 2, 3, 4).
- Iterate the nodes in a random order. For each node, change its cluster label to the cluster with which we have the most connections. If there is a tie, pick one randomly from the tied clusters.
- Repeat step two for N steps, or until the clustering converges.
References and relevant links
If you find this work useful, please cite it as:
title = "Chinese Whispers clustering",
author = "Gokberk Yaltirakli",
journal = "gkbrk.com",
year = "2021",
url = "https://www.gkbrk.com/wiki/chinese-whispers-clustering/"
Not using BibTeX? Click here for more citation styles.
Gokberk Yaltirakli, "Chinese Whispers clustering", May, 2021. [Online]. Available: https://www.gkbrk.com/wiki/chinese-whispers-clustering/. [Accessed May. 30, 2021].
Yaltirakli, G. (2021, May 30). Chinese Whispers clustering. https://www.gkbrk.com/wiki/chinese-whispers-clustering/
Gokberk Yaltirakli, Chinese Whispers clustering, GKBRK.COM (May. 30, 2021), https://www.gkbrk.com/wiki/chinese-whispers-clustering/