Title :
Optimal clustering method in ultrametric spaces
Author :
Fouchal, Said ; Ahat, Murat ; Lavallée, Ivan
Author_Institution :
CHArt & Laisc, Univ. of Paris 8, Paris, France
fDate :
June 28 2011-July 1 2011
Abstract :
Resume 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 of ultrametric space we demonstrate that we can deduce the proximities between all data in this space with just a few informations. 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; computational cost; optimal clustering method; ultrametric space; ultratriangle inequality property; Clustering algorithms; Computational complexity; Computational efficiency; Electronic mail; Extraterrestrial measurements; Partitioning algorithms; clustering; complexity; ultrametric;
Conference_Titel :
Computers and Communications (ISCC), 2011 IEEE Symposium on
Conference_Location :
Kerkyra
Print_ISBN :
978-1-4577-0680-6
Electronic_ISBN :
1530-1346
DOI :
10.1109/ISCC.2011.5984038
