Loading [a11y]/accessibility-menu.js
Divide-and-conquer algorithm for creating neighborhood graph for clustering | IEEE Conference Publication | IEEE Xplore

Divide-and-conquer algorithm for creating neighborhood graph for clustering


Abstract:

K-nearest neighbor graph has been used for reducing the number of distance calculations in PNN-based clustering. The bottleneck of the approach is the creation of the gra...Show More

Abstract:

K-nearest neighbor graph has been used for reducing the number of distance calculations in PNN-based clustering. The bottleneck of the approach is the creation of the graph. In this paper, we develop a fast divide-and-conquer method for graph creation based on the algorithm previously used in the closest pair problem. The proposed algorithm is then applied to agglomerative clustering, in which it outperforms previous projection-based algorithm for high dimensional spatial data sets.
Date of Conference: 26-26 August 2004
Date Added to IEEE Xplore: 20 September 2004
Print ISBN:0-7695-2128-2
Print ISSN: 1051-4651
Conference Location: Cambridge, UK

References

References is not available for this document.