|
Abstract : |
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object can be a very expensive task, because of the poor partitioning operated by index structures ? the so-called ?curse of dimensionality?. This also affects approximately correct (AC) algorithms, which return as result a point whose distance from is less than times the distance between and its true NN. In this paper we introduce a new approach to approximate similarity search, called PAC-NN queries, where the error bound can be exceeded with probability and both and parameters can be tuned at query time to trade the quality of the result for the cost of the search. We describe sequential and index-based PAC-NN algorithms that exploit the distance distribution of the query object in order to determine a stopping condition that respects the error bound. Analysis and experimental evaluation of the sequential algorithm confirm that, for moderately large data sets and suitable and values, PAC-NN queries can be efficiently solved and the error controlled. Then, we provide experimental evidence that indexing can further speed-up the retrieval process by up to 1-2 orders of magnitude without giving up the accuracy of the result. 1., |
