Computer Science – Data Structures and Algorithms
Scientific paper
2009-09-11
Computer Science
Data Structures and Algorithms
19 pages, 4 figures
Scientific paper
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. In contrast with most existing approaches, we can only access the ``hidden'' space in which the objects live through a similarity oracle. The oracle, given two reference objects and a query object, returns the reference object closest to the query object. The oracle attempts to model the behavior of human users, capable of making statements about similarity, but not of assigning meaningful numerical values to distances between objects.
Diggavi Suhas
Tschopp Dominique
No associations
LandOfFree
Approximate Nearest Neighbor Search through Comparisons does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Approximate Nearest Neighbor Search through Comparisons, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Nearest Neighbor Search through Comparisons will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-428441