Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Virmajoki, O. ; Dept. of Comput. Sci., Joensuu Univ., Finland ; Franti, P.

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.

Published in:

Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on  (Volume:1 )

Date of Conference:

23-26 Aug. 2004