Approximate reverse k-nearest neighbor queries in general metric spaces
Lists
Only you see this
Abstract
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.
BibTeX
@inproceedings{achtert2006approximate,
author = {Elke Achtert and Christian Böhm and Peer Kröger and Peter Kunath and Alexey Pryakhin and Matthias Renz},
title = {{Approximate reverse k-nearest neighbor queries in general metric spaces}},
booktitle = {ACM International Conference on Information and Knowledge Management},
year = {2006},
url = {https://openreview.net/forum?id=zeOnnrCrFJ7t},
}Loading related content...