Data Streaming with Affinity Propagation
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
Toward autonomic grids: analyzing the job flow with affinity streaming
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Distributed and Incremental Clustering Based on Weighted Affinity Propagation
Proceedings of the 2008 conference on STAIRS 2008: Proceedings of the Fourth Starting AI Researchers' Symposium
Cancer profiles by affinity propagation
International Journal of Knowledge Engineering and Soft Data Paradigms
Convergence Analysis of Affinity Propagation
KSEM '09 Proceedings of the 3rd International Conference on Knowledge Science, Engineering and Management
An incremental affinity propagation algorithm and its applications for text clustering
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Brief communication: A Poisson-based adaptive affinity propagation clustering for SAGE data
Computational Biology and Chemistry
On Graph-Based Name Disambiguation
Journal of Data and Information Quality (JDIQ)
Learning factorizations in estimation of distribution algorithms using affinity propagation
Evolutionary Computation
Fast density-weighted low-rank approximation spectral clustering
Data Mining and Knowledge Discovery
Affinity propagation enhanced by estimation of distribution algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Molecular Pattern Discovery Based on Penalized Matrix Decomposition
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Biclustering of expression microarray data using affinity propagation
PRIB'11 Proceedings of the 6th IAPR international conference on Pattern recognition in bioinformatics
Engineering Applications of Artificial Intelligence
Clustering with uncertainties: an affinity propagation-based approach
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part V
Hi-index | 3.84 |
Motivation: Similarity-measure-based clustering is a crucial problem appearing throughout scientific data analysis. Recently, a powerful new algorithm called Affinity Propagation (AP) based on message-passing techniques was proposed by Frey and Dueck (2007a). In AP, each cluster is identified by a common exemplar all other data points of the same cluster refer to, and exemplars have to refer to themselves. Albeit its proved power, AP in its present form suffers from a number of drawbacks. The hard constraint of having exactly one exemplar per cluster restricts AP to classes of regularly shaped clusters, and leads to suboptimal performance, e.g. in analyzing gene expression data. Results: This limitation can be overcome by relaxing the AP hard constraints. A new parameter controls the importance of the constraints compared to the aim of maximizing the overall similarity, and allows to interpolate between the simple case where each data point selects its closest neighbor as an exemplar and the original AP. The resulting soft-constraint affinity propagation (SCAP) becomes more informative, accurate and leads to more stable clustering. Even though a new a priori free parameter is introduced, the overall dependence of the algorithm on external tuning is reduced, as robustness is increased and an optimal strategy for parameter selection emerges more naturally. SCAP is tested on biological benchmark data, including in particular microarray data related to various cancer types. We show that the algorithm efficiently unveils the hierarchical cluster structure present in the data sets. Further on, it allows to extract sparse gene expression signatures for each cluster. Contact:leone@isi.it, sumedha@isi.it and weigt@isi.it