Clustering with shallow trees
arXiv:0910.0767 · doi:10.1088/1742-5468/2009/12/P12010
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.
11 pages, 7 figures
References in corpus (5)
- Learning by message-passing in networks of discrete synapses
- Clustering by soft-constraint affinity propagation: Applications to gene-expression data
- Verbal Autopsy Methods with Multiple Causes of Death
- Statistical Mechanics of Steiner trees
- A rigorous analysis of the cavity equations for the minimum spanning tree