Clustering by soft-constraint affinity propagation: Applications to gene-expression data
Michele Leone, Sumedha, Martin Weigt

TL;DR
This paper introduces Soft-Constraint Affinity Propagation (SCAP), an improved clustering algorithm that relaxes the hard constraints of the original AP, leading to more accurate, stable, and hierarchical clustering especially useful for gene expression data.
Contribution
The paper proposes a novel variant of Affinity Propagation with relaxed constraints, enhancing clustering flexibility, robustness, and applicability to biological data.
Findings
SCAP outperforms original AP in gene expression clustering.
It reveals hierarchical structures in biological datasets.
The method extracts sparse gene signatures for clusters.
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 \cite{Frey07}. 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, {\it 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
