In this work, we present a clustering algorithm to find clusters of different sizes, shapes and densities, to deal with overlapping cluster distributions and background noise. The algorithm is divided in two stages. In a first step, local density is estimated at each data point. In a second stage, a hierarchical approach is used by merging clusters according to the introduced cluster distance, based on heuristic measures about how modes overlap in a distribution. Experimental results on synthetic and real databases show the validity of the method. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Pascual, D., Pla, F., & Salvador Sánchez, J. (2006). Non parametric local density-based clustering for multimodal overlapping distributions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4224 LNCS, pp. 671–678). Springer Verlag. https://doi.org/10.1007/11875581_81
Mendeley helps you to discover research relevant for your work.