Fast and flexible unsupervised custering algorithm based on ultrametric properties
Proceedings of the 7th ACM symposium on QoS and security for wireless and mobile networks
| Hi-index | 0.00 |
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.