Clustering by soft-constraint affinity propagation: applications to gene-expression data

@article{citeulike:1918852, abstract = {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 10.1093/bioinformatics/btm414}, author = {Leone, Michele and Sumedha and Weigt, Martin }, citeulike-article-id = {1918852}, doi = {10.1093/bioinformatics/btm414}, journal = {Bioinformatics}, keywords = {bioinformatics, clustering, propagation}, month = {October}, number = {20}, pages = {2708--2715}, posted-at = {2008-05-20 16:18:01}, priority = {0}, title = {Clustering by soft-constraint affinity propagation: applications to gene-expression data}, url = {http://dx.doi.org/10.1093/bioinformatics/btm414}, volume = {23}, year = {2007} }

TY - JOUR ID - citeulike:1918852 L3 - citeulike-article-id:1918852 TI - Clustering by soft-constraint affinity propagation: applications to gene-expression data JF - Bioinformatics VL - 23 IS - 20 SP - 2708 EP - 2715 N2 - 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 10.1093/bioinformatics/btm414 KW - bioinformatics KW - clustering KW - propagation AU - Leone, Michele AU - Sumedha AU - Weigt, Martin PY - 2007/10/15/ UR - http://dx.doi.org/10.1093/bioinformatics/btm414 ER -