F-DPC: Fuzzy Neighborhood-Based Density Peak Algorithm

Clustering is a concept in data mining, which divides a data set into different classes or clusters according to a specific standard, making the similarity of data objects in the same cluster as large as possible. Clustering by fast search and find of density peaks (DPC) is a novel clustering algorithm based on density. It is simple and novel, only requiring fewer parameters to achieve better clustering effect, without the requirement for iterative solution. And it has expandability and can detect the clustering of any shape. However, DPC algorithm still has some defects, such as it employs the clear neighborhood relations to calculate local density, so it cannot identify the neighborhood membership of different values of points from the distance of points and It is impossible to accurately cluster the data of the multi-density peak. The fuzzy neighborhood density peak clustering algorithm is proposed for this shortcoming (F-DPC): novel local density is defined by the fuzzy neighborhood relationship. The fuzzy set theory can be used to make the fuzzy neighborhood function of local density more sensitive, so that the clustering for data set of various shapes and densities is more robust. Experiments show that the algorithm has high accuracy and robustness.

[1]  Aristides Gionis,et al.  Clustering aggregation , 2005, 21st International Conference on Data Engineering (ICDE'05).

[2]  Wei Pang,et al.  FREDPC: A Feasible Residual Error-Based Density Peak Clustering Algorithm With the Fragment Merging Strategy , 2019, IEEE Access.

[3]  Liang Ji,et al.  Theory and method of granular computing for big data mining , 2015 .

[4]  Lei Wang,et al.  Identifying cluster centroids from decision graph automatically using a statistical outlier detection method , 2019, Neurocomputing.

[5]  Chunyan Miao,et al.  A novel density peak clustering algorithm based on squared residual error , 2017, 2017 International Conference on Security, Pattern Analysis, and Cybernetics (SPAC).

[6]  Keqin Li,et al.  GDPC: Gravitation-based Density Peaks Clustering algorithm , 2018, Physica A: Statistical Mechanics and its Applications.

[7]  Nozha Boujemaa,et al.  Active semi-supervised fuzzy clustering for image database categorization , 2005, MIR '05.

[8]  Sean Hughes,et al.  Clustering by Fast Search and Find of Density Peaks , 2016 .

[9]  Wei Zhou,et al.  HaloDPC: An Improved Recognition Method on Halo Node for Density Peak Clustering Algorithm , 2019, Int. J. Pattern Recognit. Artif. Intell..

[10]  Evgueni A. Haroutunian,et al.  Information Theory and Statistics , 2011, International Encyclopedia of Statistical Science.

[11]  Keqin Li,et al.  A novel density peaks clustering algorithm based on k nearest neighbors for improving assignment process , 2019 .

[12]  Vipin Kumar,et al.  Chameleon: Hierarchical Clustering Using Dynamic Modeling , 1999, Computer.

[13]  Chunyan Miao,et al.  REDPC: A residual error-based density peak clustering algorithm , 2019, Neurocomputing.

[14]  Weiliang Jiang,et al.  An Adaptive Clustering Algorithm by Finding Density Peaks , 2018, PRICAI.

[15]  Delbert Dueck,et al.  Clustering by Passing Messages Between Data Points , 2007, Science.

[16]  Limin Fu,et al.  FLAME, a novel fuzzy clustering method for the analysis of DNA microarray data , 2007, BMC Bioinformatics.

[17]  Xie Juan-ying,et al.  K-nearest neighbors optimized clustering algorithm by fast search and finding the density peaks of a dataset , 2016 .

[18]  Yunchuan Sun,et al.  Adaptive fuzzy clustering by fast search and find of density peaks , 2015, 2015 International Conference on Identification, Information, and Knowledge in the Internet of Things (IIKI).

[19]  Yunni Xia,et al.  Efficient Clustering Method Based on Density Peaks With Symmetric Neighborhood Relationship , 2019, IEEE Access.

[20]  Keqin Li,et al.  DFC: Density Fragment Clustering without Peaks , 2018, J. Intell. Fuzzy Syst..

[21]  Jing Li,et al.  Extended fast search clustering algorithm: widely density clusters, no density peaks , 2015, ArXiv.

[22]  Sun Ji,et al.  Clustering Algorithms Research , 2008 .

[23]  Charles T. Zahn,et al.  Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.

[24]  Murat Erisoglu,et al.  A new algorithm for initial cluster centers in k-means algorithm , 2011, Pattern Recognit. Lett..

[25]  Michal Daszykowski,et al.  Revised DBSCAN algorithm to cluster data with dense adjacent clusters , 2013 .

[26]  Pasi Fränti,et al.  Iterative shrinking method for clustering problems , 2006, Pattern Recognit..

[27]  Jiawei Han,et al.  Document clustering using locality preserving indexing , 2005, IEEE Transactions on Knowledge and Data Engineering.

[28]  Arun K. Pujari,et al.  QROCK: A quick version of the ROCK algorithm for clustering of categorical data , 2005, Pattern Recognit. Lett..

[29]  Vipin Kumar,et al.  Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data , 2003, SDM.

[30]  Wang Shunye,et al.  An improved k-means clustering algorithm based on dissimilarity , 2013, Proceedings 2013 International Conference on Mechatronic Sciences, Electric Engineering and Computer (MEC).

[31]  Anil K. Jain.  Data Clustering: User's Dilemma , 2007, MLDM.

[32]  Rongfang Bie,et al.  Clustering by fast search and find of density peaks via heat diffusion , 2016, Neurocomputing.

[33]  Haiqiao Huang,et al.  A robust adaptive clustering analysis method for automatic identification of clusters , 2012, Pattern Recognit..

[34]  Jun Liang,et al.  Constraint-based clustering by fast search and find of density peaks , 2019, Neurocomputing.

[35]  Weixin Xie,et al.  Robust clustering by detecting density peaks and assigning points based on fuzzy weighted K-nearest neighbors , 2016, Inf. Sci..

[36]  Weiliang Jiang,et al.  Clustering by Searching Density Peaks via Local Standard Deviation , 2017, IDEAL.