Fast PNN-based Clustering Using K-nearest Neighbor Graph

I
ICDM
2003
Third IEEE International Conference on Data Mining (ICDM'03)
Abstract - Fast PNN-based Clustering Using K-nearest Neighbor Graph

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Pasi Fr?nti Articles by Olli Virmajoki Articles by Ville Hautam?ki

Third IEEE International Conference on Data Mining (ICDM'03)

Melbourne, Florida

November 19-November 22

ISBN: 0-7695-1978-4

	ASCII Text	x
	Pasi Fr?nti, Olli Virmajoki, Ville Hautam?ki, "Fast PNN-based Clustering Using K-nearest Neighbor Graph," Data Mining, IEEE International Conference on, pp. 525, Third IEEE International Conference on Data Mining (ICDM'03), 2003.

	BibTex	x
	@article{ 10.1109/ICDM.2003.1250968, author = {Pasi Fr?nti and Olli Virmajoki and Ville Hautam?ki}, title = {Fast PNN-based Clustering Using K-nearest Neighbor Graph}, journal ={Data Mining, IEEE International Conference on}, volume = {0}, year = {2003}, isbn = {0-7695-1978-4}, pages = {525}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2003.1250968}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Mining, IEEE International Conference on TI - Fast PNN-based Clustering Using K-nearest Neighbor Graph SN - 0-7695-1978-4 SP EP A1 - Pasi Fr?nti, A1 - Olli Virmajoki, A1 - Ville Hautam?ki, PY - 2003 KW - null VL - 0 JA - Data Mining, IEEE International Conference on ER -

Pasi Fr?nti, University of Joensuu, Finland

Olli Virmajoki, University of Joensuu, Finland

Ville Hautam?ki, University of Joensuu, Finland

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2003.1250968

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.

Citation:

Pasi Fr?nti, Olli Virmajoki, Ville Hautam?ki, "Fast PNN-based Clustering Using K-nearest Neighbor Graph," icdm, pp.525, Third IEEE International Conference on Data Mining (ICDM'03), 2003

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.