Sciweavers

194 search results - page 11 / 39
» Learning to rank query reformulations
Sort
View
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
16 years 1 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 1 months ago
A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables
The LETOR website contains three information retrieval datasets used as a benchmark for testing machine learning ideas for ranking. Algorithms participating in the challenge are re...
Nir Ailon
117
Voted
BMVC
2010
14 years 11 months ago
Person Re-Identification by Support Vector Ranking
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...
Bryan Prosser, Wei-Shi Zheng, Shaogang Gong, Tao X...
CORR
2010
Springer
169views Education» more  CORR 2010»
14 years 8 months ago
Recommender Systems by means of Information Retrieval
In this paper we present a method for reformulating the Recommender Systems problem in an Information Retrieval one. In our tests we have a dataset of users who give ratings for s...
Alberto Costa, Fabio Roda
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
16 years 2 months ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...