Sciweavers

Share
213 search results - page 1 / 43
» BoostMap: A Method for Efficient Approximate Similarity Rank...
Sort
View
CVPR
2004
IEEE
10 years 5 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...
CIKM
2009
Springer
9 years 7 months ago
Efficient feature weighting methods for ranking
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...
Hwanjo Yu, Jinoh Oh, Wook-Shin Han
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
9 years 8 months ago
Ranking - Methods for Flexible Evaluation and Efficient Comparison of Classification Performance
We present the notion of Ranking for evaluation of two-class classifiers. Ranking is based on using the ordering information contained in the output of a scoring model, rather tha...
Saharon Rosset
ADC
2006
Springer
136views Database» more  ADC 2006»
9 years 9 months ago
A multi-step strategy for approximate similarity search in image databases
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Paul Wing Hing Kwan, Junbin Gao
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
9 years 10 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
books