1605 search results - page 108 / 321 » Metric Learning to Rank |
147
Voted
WWW
2010
ACM
15 years 10 months ago
2010
ACM
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
134
click to vote
BMVC
2010
15 years 1 months ago
2010
Solving the person re-identification problem involves matching observations of individuals across disjoint camera views. The problem becomes particularly hard in a busy public sce...
266
click to vote
SIGIR
2012
ACM
13 years 5 months ago
2012
ACM
As ever-larger training sets for learning to rank are created, scalability of learning has become increasingly important to achieving continuing improvements in ranking accuracy [...
151
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
125
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
In this paper, we formulate the shape localization problem in the Bayesian framework. In the learning stage, we propose the Constrained RankBoost approach to model the likelihood ...