Fast PNN-based Clustering Using K-nearest Neighbor Graph

Authors:
Pasi Fränti;Olli Virmajoki;Ville Hautamäki
Affiliations:
-;-;-
Venue:
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Year:
2003

Citing 2
Cited 1

Fast and memory efficient implementation of the exact PNN

IEEE Transactions on Image Processing
A fast exact GLA based on code vector activity detection

IEEE Transactions on Image Processing

Fast Agglomerative Clustering Using a k-Nearest Neighbor Graph

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Search for nearest neighbor is the main source ofcomputation in most clustering algorithms. We proposethe use of nearest neighbor graph for reducing thenumber of candidates. The number of distancecalculations per search can be reduced from O(N) to O(k)where N is the number of clusters, and k is the number ofneighbors in the graph. We apply the proposed schemewithin agglomerative clustering algorithm known as thePNN algorithm.