• Documents
  • Authors
  • Tables

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Routing and searching on large scale networks (2009)

by Dominique Tschopp
Add To MetaCart

Tools

Sorted by:
Results 1 - 1 of 1

Randomized Algorithms for Comparison-based Search

by Payam Delgosha, Suhas Diggavi, Soheil Mohajer
"... 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 simi ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
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
(Show Context)

Citation Context

...h that dissimilar objects are likely to get separated, and similar objects have the tendency to stay together; generalizing the notion of randomized k-d-trees [2]. This is developed in more detail in =-=[3]-=-. Due to space constraints, we give statements of the results along with an outline of proof ideas in the main text. Additionally we provide proof details in the appendix [4] as extra material allowed...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University