Fast PNN-based Clustering Using K-nearest Neighbor Graph

Pasi Fr?nti; Olli Virmajoki; Ville Hautam?ki

doi:10.1109/ICDM.2003.1250968

Third IEEE International Conference on Data Mining

Fast PNN-based Clustering Using K-nearest Neighbor Graph

Year: 2003, Pages: 525

DOI Bookmark: 10.1109/ICDM.2003.1250968

Authors

Pasi Fr?nti, University of Joensuu, Finland
Olli Virmajoki, University of Joensuu, Finland
Ville Hautam?ki, University of Joensuu, Finland

Abstract

Search for nearest neighbor is the main source of computation in most clustering algorithms. We propose the use of nearest neighbor graph for reducing the number of candidates. The number of distance calculations per search can be reduced from O(N) to O(k) where N is the number of clusters, and k is the number of neighbors in the graph. We apply the proposed scheme within agglomerative clustering algorithm known as the PNN algorithm.

Like what you’re reading?

Already a member?

Get this article FREE with a new membership!

Practical k nearest neighbor queries with location privacy
2014 IEEE 30th International Conference on Data Engineering (ICDE)
Prediction of Moving Objects_ K-Nearest Neighbor Based on Fuzzy-Rough Sets Theory
Fuzzy Systems and Knowledge Discovery, Fourth International Conference on
Visible Reverse k-Nearest Neighbor Queries
2009 IEEE 25th International Conference on Data Engineering
Continuous Reverse k-Nearest-Neighbor Monitoring
The Ninth International Conference on Mobile Data Management (mdm 2008)
Dimensionality Reduction by Unsupervised K-Nearest Neighbor Regression
Machine Learning and Applications, Fourth International Conference on
Poster: A neighbor-weighted K-nearest neighbor method for predicting protein subnuclear localizations
2011 IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)
Fast Agglomerative Clustering Using a k-Nearest Neighbor Graph
IEEE Transactions on Pattern Analysis & Machine Intelligence
Range Nearest-Neighbor Query
IEEE Transactions on Knowledge & Data Engineering
K-Nearest Neighbor Finding Using MaxNearestDist
IEEE Transactions on Pattern Analysis & Machine Intelligence
Non-classical K-nearest Neighbor Clustering Algorithm
2022 2nd International Conference on Networking, Communications and Information Technology (NetCIT)

Fast PNN-based Clustering Using K-nearest Neighbor Graph

Authors

Abstract

Related Articles