Due to their ability to detect clusters with irregular boundaries, minimum spanning tree-based clusteringalgorithms have been widely used in practice. However, in such clusteringalgorithms, the search for nearest ne...
详细信息
Due to their ability to detect clusters with irregular boundaries, minimum spanning tree-based clusteringalgorithms have been widely used in practice. However, in such clusteringalgorithms, the search for nearest neighbor in the construction of minimum spanning trees is the main source of computation and the standard solutions take O(N(2)) time. In this paper, we present a fast minimum spanning tree-inspired clusteringalgorithm, which, by using an efficient implementation of the cut and the cycle property of the minimum spanning trees, can have much better performance than O(N(2))
暂无评论