论文标题
改善反向K最近的邻居查询
Improving Reverse k Nearest Neighbors Queries
论文作者
论文摘要
反向$ k $最近的邻居查询找到了所有具有查询点的点，这些点是其$ k $最近的邻居之一，$ k $ nn查询找到了$ k $最接近其查询点的点。根据锥体，我们提出了一种有效的R $ K $ NN验证方法。通过使用建议的验证方法，我们在VOR-Tree上实现了有效的R $ K $ NN算法，该算法的计算复杂度为$ O（k^{1.5} \ CDOT log \，k）$。比较实验是在我们的算法和其他两种最先进的R $ K $ NN算法之间进行的。实验结果表明，我们的算法的效率明显高于其竞争对手。
The reverse $k$ nearest neighbor query finds all points that have the query point as one of their $k$ nearest neighbors, where the $k$NN query finds the $k$ closest points to its query point. Based on conics, we propose an efficent R$k$NN verification method. By using the proposed verification method, we implement an efficient R$k$NN algorithm on VoR-tree, which has a computational complexity of $O(k^{1.5}\cdot log\,k)$. The comparative experiments are conducted between our algorithm and other two state-of-the-art R$k$NN algorithms. The experimental results indicate that the efficiency of our algorithm is significantly higher than its competitors.
