155 search results - page 20 / 31 » On learning linear ranking functions for beam search |
IR
2010
13 years 6 months 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
14 years 8 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...
SIGIR
2010
ACM
13 years 11 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...
SIGIR
2004
ACM
14 years 1 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
14 years 24 days 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...