Subscribe
Issue No.07  July (2009 vol.21)
pp: 945958
Xiaochun Wang , Vanderbilt University, Nashville
Xiali Wang , Changan University, Xi'an
D. Mitchell Wilkes , Vanderbilt University, Nashville
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.37
ABSTRACT
Due to their ability to detect clusters with irregular boundaries, minimum spanning treebased 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 treeinspired 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}).
INDEX TERMS
Clustering, graph algorithms, minimum spanning tree, divisive hierarchical clustering algorithm.
CITATION
Xiaochun Wang, Xiali Wang, D. Mitchell Wilkes, "A DivideandConquer Approach for Minimum Spanning TreeBased Clustering", IEEE Transactions on Knowledge & Data Engineering, vol.21, no. 7, pp. 945958, July 2009, doi:10.1109/TKDE.2009.37
REFERENCES
