Density peaks clustering (DPC) algorithm is able to get a satisfactory result with the help of artificial selecting the clustering centers, but such selection can be hard for a large amount of clustering tasks or the data set with a complex decision diagram. The purpose of this paper is to propose an automatic clustering approach without human intervention. Inspired by the visual selection rule of DPC, the judgment index which equals the lower value within density and distance (after normalization) is proposed for selecting the clustering centers. The judgment index approximately follows the generalized extreme value (GEV) distribution, and each clustering center’s judgment index is much higher. Hence, it is reasonable that the points are selected as clustering centers if their judgment indices are larger than the upper quantile of GEV. This proposed method is called density peaks clustering based on generalized extreme value distribution (DPC-GEV). Furthermore, taking the computational complexity into account, an alternative method based on density peak detection using Chebyshev inequality (DPC-CI) is also given. Experiments on both synthetic and real-world data sets show that DPC-GEV and DPC-CI can achieve the same accuracy as DPC on most data sets but consume much less time.
Density peak Judgment index Generalized extreme value distribution Chebyshev inequality Optimization
This is a preview of subscription content, log in to check access.
The authors acknowledge the financial support from the National Natural Science Foundation of China (61473262, 61503340), Zhejiang Provincial Natural Science Foundation (LQ12A01022) and Educational Commission of Zhejiang Province (Y201121764).
Compliance with ethical standards
Conflicts of interest
The authors declare that they have no conflict of interest.
This article does not contain any studies with human participants or animals performed by any of the authors.
Informed consent was obtained from all individual participants included in the study.
Andreeva G, Calabrese R, Osmetti SA (2016) A comparative analysis of the UK and Italian small businesses using generalised extreme value models. Eur J Oper Res 249(2):506–516CrossRefGoogle Scholar
Chen Y, Zhao P, Li P et al (2016) Finding communities by their centers. Sci Rep 6. doi:10.1038/srep24017
Dikshit AMO (2015) Comparative study on projected clustering methods for hyperspectral imagery classification. Geocarto Int 31(3):1–32Google Scholar
Du M, Ding S, Jia H (2016) Study on density peaks clustering based on k-nearest neighbors and principal component analysis. Knowl Based Syst 99:135–145CrossRefGoogle Scholar
Ester M, Kriegel HP, Sander J et al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. Kdd 96(34):226–231Google Scholar
Fu L, Medico E (2007) FLAME, a novel fuzzy clustering method for the analysis of DNA microarray data. Bmc Bioinform 8(1):1–15CrossRefGoogle Scholar
Huang Z (1997) Clustering large data sets with mixed numeric and categorical values. In: Proceedings of the 1st Pacific-Asia conference on knowledge discovery and data mining (PAKDD), pp 21–34Google Scholar
Jia S, Tang G, Zhu J et al (2016) A novel ranking-based clustering approach for hyperspectral band selection. IEEE Trans Geosci Remote Sens 54(1):88–102CrossRefGoogle Scholar
Jiang B, Wang N (2013) Cooperative bare-bone particle swarm optimization for data clustering. Soft Comput. 18(6):1079–1091CrossRefGoogle Scholar
Zheng YJ, Ling HF, Chen SY et al (2014) A hybrid neuro-fuzzy network based on differential biogeography-based optimization for online population classification in earthquakes. IEEE Trans Fuzzy Syst 3(4):1–1Google Scholar
Zheng YJ, Ling HF, Xue JY et al (2014) Population classification in fire evacuation: a multiobjective particle swarm optimization approach. IEEE Trans Evolut Comput 18(1):70–81CrossRefGoogle Scholar
Zhou L, Hu ZC (2012) Chebyshev’s inequality for Banach-space-valued random elements. Stat Probab Lett 82(5):925C931MathSciNetGoogle Scholar