Title :
An O(N) clustering method on ultrametric data
Author :
Fouchal, Said ; Ahat, Murat ; Lavallée, Ivan ; Bui, Marc
Author_Institution :
CHArt & Laisc, Univ. of Paris 8, Paris, France
Abstract :
We propose in this paper a novel clustering algorithm in ultrametric spaces. It has a computational cost of O(n). This method is based on the ultratriangle inequality property. Using the order induced by an ultrametric in a given space, we demonstrate how we explore quickly data proximities in this space. We present an example of our results and show the efficiency and the consistency of our algorithm compared with another.
Keywords :
computational complexity; pattern clustering; ON clustering method; computational cost; data proximities; ultrametric data; ultratriangle inequality property; Clustering algorithms; Computational efficiency; Extraterrestrial measurements; Humans; Mice; Partitioning algorithms; clustering; complexity; ultrametric;
Conference_Titel :
Data Mining and Optimization (DMO), 2011 3rd Conference on
Conference_Location :
Putrajaya
Print_ISBN :
978-1-61284-211-0
Electronic_ISBN :
2155-6938
DOI :
10.1109/DMO.2011.5976497
