Sciweavers

26 search results - page 3 / 6
» Similarity between Euclidean and cosine angle distance for n...
Sort
View
CVPR
2003
IEEE
14 years 9 months ago
Nearest Neighbor Search for Relevance Feedback
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
Jelena Tesic, B. S. Manjunath
BTW
2007
Springer
183views Database» more  BTW 2007»
13 years 11 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
CVPR
2004
IEEE
14 years 9 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 7 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
12 years 10 months ago
Flexible aggregate similarity search
Aggregate similarity search, a.k.a. aggregate nearest neighbor (Ann) query, finds many useful applications in spatial and multimedia databases. Given a group Q of M query objects...
Yang Li, Feifei Li, Ke Yi, Bin Yao 0002, Min Wang