Affinity propagation
PulseAugur coverage of Affinity propagation — every cluster mentioning Affinity propagation across labs, papers, and developer communities, ranked by signal.
1 day(s) with sentiment data
-
New research proves inherent NP-hardness of clustering algorithms
A research paper introduces the Universal Clustering Problem (UCP) to unify and explain the inherent computational difficulty in various clustering algorithms. The study proves that UCP is NP-hard through reductions fro…
-
New Factor-Graph Approach Optimizes Protein MSA Subsampling
Researchers have developed AP-REASONER, a novel factor-graph approach for subsampling Multiple Sequence Alignments (MSAs) in protein language models. This method treats MSA subsampling as an optimization problem, allowi…
-
Self-Organizing Maps: An Underappreciated Clustering Algorithm
This article examines clustering algorithms, focusing on Self-Organizing Maps (SOMs) and their underappreciated potential. The author advocates for a deeper look into SOMs, suggesting that tuning them can yield signific…