Randomized Algorithms for Comparison-based Search
| Citations: | 3 - 0 self |
BibTeX
@MISC{Delgosha_randomizedalgorithms,
author = {Payam Delgosha and Suhas Diggavi and Soheil Mohajer},
title = {Randomized Algorithms for Comparison-based Search},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper addresses the problem of finding the nearest neighbor (or one of the R-nearest neighbors) of a query object q in a database of n objects, when we can only use a comparison oracle. The comparison oracle, given two reference objects and a query object, returns the reference object most similar to the query object. The main problem we study is how to search the database for the nearest neighbor (NN) of a query, while minimizing the questions. The difficulty of this problem depends on properties of the underlying database. We show the importance of a characterization: combinatorial disorder D which defines approximate triangle inequalities on ranks. We present a lower bound of Ω(D log n D + D2) average number of questions in the search phase for any randomized algorithm, which demonstrates the fundamental role of D for worst case behavior. We develop a randomized scheme for NN retrieval in O(D3 log 2 n + D log 2 n loglog nD3) questions. The learning requires asking O(nD3 log 2 n + D log 2 n loglog nD3) questions and O(n log 2 n / log(2D)) bits to store. 1
Keyphrases
query object comparison-based search comparison oracle loglog nd3 reference object fundamental role randomized algorithm underlying database randomized scheme nn retrieval main problem nd3 log r-nearest neighbor case behavior approximate triangle inequality combinatorial disorder search phase
