2000 character limit reached
A density-sensitive hierarchical clustering method
Published 23 Oct 2012 in cs.LG | (1210.6292v2)
Abstract: We define a hierarchical clustering method: $\alpha$-unchaining single linkage or $SL(\alpha)$. The input of this algorithm is a finite metric space and a certain parameter $\alpha$. This method is sensitive to the density of the distribution and offers some solution to the so called chaining effect. We also define a modified version, $SL*(\alpha)$, to treat the chaining through points or small blocks. We study the theoretical properties of these methods and offer some theoretical background for the treatment of chaining effects.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.