Sciweavers

121 search results - page 3 / 25
» Anytime K-Nearest Neighbor Search for Database Applications
Sort
View
SSDBM
2009
IEEE
149views Database» more  SSDBM 2009»
14 years 11 days ago
Reverse k-Nearest Neighbor Search Based on Aggregate Point Access Methods
Abstract. We propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem in Euclidean spaces. Compared to the limitations of existing methods for ...
Hans-Peter Kriegel, Peer Kröger, Matthias Ren...
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
14 years 7 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
CIKM
2006
Springer
13 years 9 months ago
k nearest neighbor classification across multiple private databases
Distributed privacy preserving data mining tools are critical for mining multiple databases with a minimum information disclosure. We present a framework including a general model...
Li Xiong, Subramanyam Chitti, Ling Liu
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
11 years 8 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
14 years 7 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...