CURE: an efficient clustering algorithm for large databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Unsupervised Learning of Finite Mixture Models
IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Cluster Isolation Criterion Based on Dissimilarity Increments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Cluster Stability Assessment Based on Theoretic Information Measures
CIARP '08 Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications
Learning and Forgetting with Local Information of New Objects
CIARP '08 Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications
DECODE: a new method for discovering clusters of different densities in spatial data
Data Mining and Knowledge Discovery
Multi-spectral Texture Characterisation for Remote Sensing Image Segmentation
IbPRIA '09 Proceedings of the 4th Iberian Conference on Pattern Recognition and Image Analysis
Cluster validation using information stability measures
Pattern Recognition Letters
Proceedings of the 2010 conference on Artificial Intelligence Research and Development: Proceedings of the 13th International Conference of the Catalan Association for Artificial Intelligence
Multi-scale decomposition of point process data
Geoinformatica
Hi-index | 0.00 |
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.