14 search results - page 1 / 3 » K-Nearest Neighbor Finding Using MaxNearestDist |
PAMI
2008
13 years 4 months ago
2008
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
ICIAP
2003
ACM
14 years 4 months ago
2003
ACM
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 ...
PVLDB
2008
13 years 3 months ago
2008
A Reverse k-Nearest-Neighbor (RkNN) query finds the objects that take the query object as one of their k nearest neighbors. In this paper we propose new solutions for evaluating R...
ICDE
2010
IEEE
13 years 11 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
BTW
2007
Springer
13 years 8 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...