Incremental Affinity Propagation Clustering Based on Message Passing

Affinity Propagation (AP) clustering has been successfully used in a lot of clustering problems. However, most of the applications deal with static data. This paper considers how to apply AP in incremental clustering problems. First, we point out the difficulties in Incremental Affinity Propagation (IAP) clustering, and then propose two strategies to solve them. Correspondingly, two IAP clustering algorithms are proposed. They are IAP clustering based on K-Medoids (IAPKM) and IAP clustering based on Nearest Neighbor Assignment (IAPNA). Five popular labeled data sets, real world time series and a video are used to test the performance of IAPKM and IAPNA. Traditional AP clustering is also implemented to provide benchmark performance. Experimental results show that IAPKM and IAPNA can achieve comparable clustering performance with traditional AP clustering on all the data sets. Meanwhile, the time cost is dramatically reduced in IAPKM and IAPNA. Both the effectiveness and the efficiency make IAPKM and IAPNA able to be well used in incremental clustering tasks.

[1]  Anil K. Jain Data clustering: 50 years beyond K-means , 2008, Pattern Recognit. Lett..

[2]  Michèle Sebag,et al.  Frugal and Online Affinity Propagation , 2008 .

[3]  Lorenzo Bruzzone,et al.  Incremental and Decremental Affinity Propagation for Semisupervised Clustering in Multispectral Images , 2013, IEEE Transactions on Geoscience and Remote Sensing.

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

[5]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[6]  Philip S. Yu,et al.  A Framework for Clustering Evolving Data Streams , 2003, VLDB.

[7]  Hesham H. Ali,et al.  A new clustering algorithm using message passing and its applications in analyzing microarray data , 2005, Fourth International Conference on Machine Learning and Applications (ICMLA'05).

[8]  Nicolas Labroche New incremental fuzzy c medoids clustering algorithms , 2010, 2010 Annual Meeting of the North American Fuzzy Information Processing Society.

[9]  J. R. Berrendero,et al.  Time series clustering based on forecast densities , 2006, Comput. Stat. Data Anal..

[10]  Aidong Zhang,et al.  A novel functional module detection algorithm for protein-protein interaction networks , 2006, Algorithms for Molecular Biology.

[11]  Deepayan Chakrabarti,et al.  Evolutionary clustering , 2006, KDD '06.

[12]  Brendan J. Frey,et al.  Response to Comment on "Clustering by Passing Messages Between Data Points" , 2008, Science.

[13]  Jiang Zhang,et al.  Analysis of fMRI Data Using an Integrated Principal Component Analysis and Supervised Affinity Propagation Clustering Approach , 2011, IEEE Transactions on Biomedical Engineering.

[14]  Qiang Wu,et al.  Face recognition using message passing based clustering method , 2009, J. Vis. Commun. Image Represent..

[15]  Ji Chen,et al.  An Incremental Chinese Text Classification Algorithm Based on Quick Clustering , 2008, 2008 International Symposiums on Information Processing.

[16]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[17]  Judea Pearl,et al.  Fusion, Propagation, and Structuring in Belief Networks , 1986, Artif. Intell..

[18]  Luigi Chisci,et al.  Real-Time Epileptic Seizure Prediction Using AR Models and Support Vector Machines , 2010, IEEE Transactions on Biomedical Engineering.

[19]  Rajeev Motwani,et al.  Incremental clustering and dynamic information retrieval , 1997, STOC '97.

[20]  Xiaolong Wang,et al.  An adaptive affinity propagation document clustering , 2010, 2010 The 7th International Conference on Informatics and Systems (INFOS).

[21]  Fabio Tozeto Ramos,et al.  Unsupervised incremental learning for long-term autonomy , 2012, 2012 IEEE International Conference on Robotics and Automation.

[22]  James Bailey,et al.  Information theoretic measures for clusterings comparison: is a correction for chance necessary? , 2009, ICML '09.

[23]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.

[24]  Marc Mézard,et al.  1993 , 1993, The Winning Cars of the Indianapolis 500.

[25]  Nikos A. Vlassis,et al.  The global k-means clustering algorithm , 2003, Pattern Recognit..

[26]  William T. Freeman,et al.  Constructing free-energy approximations and generalized belief propagation algorithms , 2005, IEEE Transactions on Information Theory.

[27]  Adil M. Bagirov,et al.  Fast modified global k-means algorithm for incremental cluster construction , 2011, Pattern Recognit..

[28]  Eyke Hüllermeier,et al.  Online clustering of parallel data streams , 2006, Data Knowl. Eng..

[29]  Yanchun Liang,et al.  An incremental affinity propagation algorithm and its applications for text clustering , 2009, 2009 International Joint Conference on Neural Networks.

[30]  Sudipto Guha,et al.  Clustering Data Streams: Theory and Practice , 2003, IEEE Trans. Knowl. Data Eng..

[31]  T. Warren Liao,et al.  Clustering of time series data - a survey , 2005, Pattern Recognit..