DAPPFC: Density-Based Affinity Propagation for Parameter Free Clustering

In the clustering algorithms, it is a bottleneck to identify clusters with arbitrarily. In this paper, a new method DAPPFC (density-based affinity propagation for parameter free clustering) is proposed. Firstly, it obtains a group of normalized density from the unsupervised clustering results. Then, the density is used for density clustering for multiple times. Finally, the multiple-density clustering results undergo a two-stage synthesis to achieve the final clustering result. The experiment shows that the proposed method does not require the user’s intervention, and it can also get an accurate clustering result in the presence of arbitrarily shaped clusters with a minimal additional computation cost.

[1]  Alessandro Laio,et al.  Clustering by fast search and find of density peaks , 2014, Science.

[2]  Brendan J. Frey,et al.  Non-metric affinity propagation for unsupervised image categorization , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[3]  Yasuhiro Fujiwara,et al.  Fast Algorithm for Affinity Propagation , 2011, IJCAI.

[4]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

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

[6]  Charu C. Aggarwal,et al.  Data Clustering , 2013 .

[7]  Cor J. Veenman,et al.  A Maximum Variance Cluster Algorithm , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Brendan J. Frey,et al.  Constructing Treatment Portfolios Using Affinity Propagation , 2008, RECOMB.

[9]  Wang Kai Fast Algorithm of Affinity Propagation Clustering under Given Number of Clusters , 2010 .

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

[11]  Fu Hui A fast affinity propagation clustering algorithm , 2011 .

[12]  Charles Seife Big data: The revolution is digitized , 2015, Nature.

[13]  Brendan J. Frey,et al.  Semi-Supervised Affinity Propagation with Instance-Level Constraints , 2009, AISTATS.

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

[15]  Jian-Huang Lai,et al.  APSCAN: A parameter free algorithm for clustering , 2011, Pattern Recognit. Lett..

[16]  Hong Zhu,et al.  Optimizing radial basis function neural network based on rough sets and affinity propagation clustering algorithm , 2012, Journal of Zhejiang University SCIENCE C.

[17]  Dit-Yan Yeung,et al.  Robust path-based spectral clustering , 2008, Pattern Recognit..