Clustering Based on Dominant Set and Cluster Expansion
While numerous clustering algorithms can be found in the literature, existing algorithms are usually afflicted by two major problems. First, the majority of clustering algorithms requires user-specified parameters as input, and their clustering results rely heavily on these parameters. Second, many algorithms generate clusters of only spherical shapes. In this paper we try to solve these two problems based on dominant set and cluster expansion. We firstly use a modified dominant sets clustering algorithm to generate initial clusters which are parameter independent and usually smaller than the real clusters. Then we expand the initial clusters based on two density based clustering algorithms to generate clusters of arbitrary shapes. In experiments on various datasets our algorithm outperforms the original dominant sets algorithm and several other algorithms. It is also shown to be effective in image segmentation experiments.
KeywordsCluster Center Cluster Result Arbitrary Shape Spectral Cluster Density Peak
This work is supported in part by the National Natural Science Foundation of China under Grant No. 61473045 and by China Scholarship Council.
- 1.Achtert, E., Bohm, C., Kroger, P.: DeLi-CLu: boosting robustness, completeness, usability, and efficiency of hierarchical clustering by a closest pair ranking. In: International Conference on Knowledge Discovery and Data Mining, pp. 119–128 (2006)Google Scholar
- 2.Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: Optics: ordering points to identify the clustering structure. In: ACM SIGMOD International Conference on Management of Data, pp. 49–60 (1999)Google Scholar
- 8.Ester, M., Kriegel, H.P., Sander, J., Xu, X.W.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: International Conference on Knowledge Discovery and Data Mining, pp. 226–231 (1996)Google Scholar
- 19.Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 167–172 (2000)Google Scholar
- 20.Torsello, A., Bulo, S.R., Pelillo, M.: Beyond partitions: allowing overlapping groups in pairwise clustering. In: International Conference on Pattern Recognition, pp. 1–4 (2008)Google Scholar
- 21.Tripodi, R., Pelillo, M.: Document clustering games. In: The 5th International Conference on Pattern Recognition Applications and Methods, pp. 109–118 (2016)Google Scholar
- 25.Zhu, X., Loy, C.C., Gong, S.: Constructing robust affinity graphs for spectral clustering. In: IEEE International Conference on Computer Vision and Pattern Recognition, pp. 1450–1457 (2014)Google Scholar