Journal
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
Volume 21, Issue 7, Pages 945-958Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TKDE.2009.37
Keywords
Clustering; graph algorithms; minimum spanning tree; divisive hierarchical clustering algorithm
Categories
Funding
- US National Science Foundation [0325641]
- Div Of Information & Intelligent Systems
- Direct For Computer & Info Scie & Enginr [0325641] Funding Source: National Science Foundation
Ask authors/readers for more resources
Due to their ability to detect clusters with irregular boundaries, minimum spanning tree-based clustering algorithms have been widely used in practice. However, in such clustering algorithms, 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 clustering algorithm, 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))
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available