155 search results - page 20 / 31 » On learning linear ranking functions for beam search |
115
Voted
IR
2010
15 years 8 days ago
2010
Abstract We present a new ranking algorithm that combines the strengths of two previous methods: boosted tree classification, and LambdaRank, which has been shown to be empiricall...
ICML
2006
IEEE
16 years 2 months ago
2006
IEEE
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
117
click to vote
SIGIR
2010
ACM
15 years 5 months ago
2010
ACM
Interleaving experiments are an attractive methodology for evaluating retrieval functions through implicit feedback. Designed as a blind and unbiased test for eliciting a preferen...
113
click to vote
SIGIR
2004
ACM
15 years 7 months ago
2004
ACM
This paper proposes a novel, unified, and systematic approach to combine collaborative and content-based filtering for ranking and user preference prediction. The framework inco...
MM
2003
ACM
15 years 7 months ago
2003
ACM
Combining search results from multimedia sources is crucial for dealing with heterogeneous multimedia data, particularly in multimedia retrieval where a final ranked list of item...