Depth-First K-Nearest Neighbor Finding Using the MaxNearestDist Estimator

Authors:
Hanan Samet
Affiliations:
-
Venue:
ICIAP '03 Proceedings of the 12th International Conference on Image Analysis and Processing
Year:
2003

Citing 0
Cited 7

An efficient nearest neighbor algorithm for P2P settings

dg.o '05 Proceedings of the 2005 national conference on Digital government research
Building and Querying a P2P Virtual World

Geoinformatica
Cluster analysis of traffic flows on a campus network

AIA'06 Proceedings of the 24th IASTED international conference on Artificial intelligence and applications
On using B+-tree for efficient processing for the boundary neighborhood problem

WSEAS TRANSACTIONS on SYSTEMS
A novel optimization approach to efficiently process aggregate similarity queries in metric access methods

Proceedings of the 17th ACM conference on Information and knowledge management
Improving the space cost of k-NN search in metric spaces by using distance estimators

Multimedia Tools and Applications
Evaluation of k-Nearest Neighbor classifier performance for direct marketing

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A description is given of how to use an estimate of the maximum possible distance at which a nearest neighbor can be found to prune the search process in a depth-first branch and bound k-nearest neighbor finding algorithm.