Abstract
This paper presents a novel hybrid clustering approach that takes advantage of the efficiency of k-Means clustering and the effectiveness of hierarchical clustering. It employs the combination of geometrical information defined by k-Means and topological information formed by the Voronoi diagram to advantage. Our proposed approach is able to identify clusters of arbitrary shapes and clusters of different densities in O(n) time. Experimental results confirm the effectiveness and efficiency of our approach.
Original language | English |
---|---|
Pages (from-to) | 938-941 |
Number of pages | 4 |
Journal | Lecture Notes in Computer Science |
Volume | Vol. 3809 |
DOIs | |
Publication status | Published - 2005 |
Keywords
- clustering
- databases