pith. sign in

arxiv: 0910.0767 · v2 · pith:R25JL352new · submitted 2009-10-05 · ❄️ cond-mat.dis-nn · cs.DS· q-bio.QM

Clustering with shallow trees

classification ❄️ cond-mat.dis-nn cs.DSq-bio.QM
keywords methodclusteringinterpolationtreesaffinityalgorithmallowsanalyze
0
0 comments X
read the original abstract

We propose a new method for hierarchical clustering based on the optimisation of a cost function over trees of limited depth, and we derive a message--passing method that allows to solve it efficiently. The method and algorithm can be interpreted as a natural interpolation between two well-known approaches, namely single linkage and the recently presented Affinity Propagation. We analyze with this general scheme three biological/medical structured datasets (human population based on genetic information, proteins based on sequences and verbal autopsies) and show that the interpolation technique provides new insight.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.