96 search results - page 4 / 20 » Average-Case Analysis of a Nearest Neighbor Algorithm |
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
Given a set of objects and a query q, a point p is
called the reverse k nearest neighbor (RkNN) of q if q is one of
the k closest objects of p. In this paper, we introduce the c...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
Delaunay tessellations and Voronoi diagrams capture proximity relationships among sets of points in any dimension. When point coordinates are not known exactly, as in the case of ...
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
TKDE
2010
13 years 6 months ago
2010
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in t...
PODS
1997
ACM
13 years 11 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...