High dimensional reverse nearest neighbor queries
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
ERkNN: efficient reverse k-nearest neighbors retrieval with local kNN-distance estimation
Proceedings of the 14th ACM international conference on Information and knowledge management
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
ELKI: A Software System for Evaluation of Subspace Clustering Algorithms
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Reverse k-nearest neighbor search in dynamic and general metric databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Reverse k-Nearest Neighbor Search Based on Aggregate Point Access Methods
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Incremental Reverse Nearest Neighbor Ranking in Vector Spaces
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Constrained reverse nearest neighbor search on mobile objects
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Reverse spatial and textual k nearest neighbor search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
| Hi-index | 0.00 |
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approximation of the nearest-neighbor-distances in order to prune the search space. In several experiments, our solution scales significantly better than existing non-approximative approaches while producing an approximation of the true query result with a high recall.