Processing transitive nearest-neighbor queries in multi-channel access environments
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Approximate similarity search: A multi-faceted problem
Journal of Discrete Algorithms
Keypoint design and evaluation for place recognition in 2D lidar maps
Robotics and Autonomous Systems
Efficient methods in finding aggregate nearest neighbor by projection-based filtering
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Approximate high-dimensional nearest neighbor queries using R-forests
Proceedings of the 17th International Database Engineering & Applications Symposium
| Hi-index | 0.00 |
We explore using index structures for effective approximate and on-line nearest neighbor queries. While many index structures have showed to suffer from the dimensionality curse, we believe that indexes can still be useful in providing quick approximate solutions to the nearest neighbor queries. Moreover, the information provided by the indexes can provide certain bounds that can be invaluable for on-line nearest neighbor queries. This paper explores the idea of applying current R-tree based indexes to approximate and on-line nearest neighbors with bounds. We experiment with various heuristics and compare the trade-off between accuracy and efficiency. Our results are compared to locality sensitive hashing (LSH) and they show the effectiveness of the proposed scheme. We also provide guidelines on how this can be useful in a practical sense.