Ruprecht-Karls-Universitšt Heidelberg

Density Clustering with Basin Spanning Trees

Sören Hader, Fred Hamprecht


Basin spanning trees are an efficient method of clustering multivariate data according to their density. The root of each tree corresponds to a local density maximum. The algorithm allows the creation of arbitrary cluster shapes.


  • density estimation
  • neighborhood graphs like Delaunay triangulation





"Efficient density clustering using basin spanning trees"
S. Hader, F. A. Hamprecht; Proceedings of the GfKl 2002, Springer (2003)

Last update: 06.10.2010, 12:26
zum Seitenanfang