Sciweavers

Share
SDM
2012
SIAM

Nearest-Neighbor Search on a Time Budget via Max-Margin Trees

9 years 3 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approaches which use multidimensional trees for either exact or approximate search, possibly in combination with hashing approaches. Moreover, a number of these applications only have a limited amount of time to answer nearest-neighbor queries. However, we observe empirically that the correct neighbor is often found early within the tree-search process, while the bulk of the time is spent on verifying its correctness. Motivated by this, we propose an algorithm for finding the best neighbor given any particular time limit, and develop a new data structure, the max-margin tree, to achieve accurate results even with small time budgets. Max-margin trees perform better in the limited-time setting than current commonly-used data structures such as the kd-tree and more recently developed data structures like the RP-tree.
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
Added 29 Sep 2012
Updated 29 Sep 2012
Type Journal
Year 2012
Where SDM
Authors Parikshit Ram, Dongryeol Lee, Alexander G. Gray
Comments (0)
books