194 search results - page 17 / 39 » Learning to rank query reformulations |
112
Voted
ICML
1998
IEEE
16 years 2 months ago
1998
IEEE
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
135
click to vote
SIGIR
2012
ACM
13 years 4 months ago
2012
ACM
Many techniques for improving search result quality have been proposed. Typically, these techniques increase average effectiveness by devising advanced ranking features and/or by...
114
click to vote
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
118
Voted
SIGIR
2009
ACM
15 years 8 months ago
2009
ACM
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
179
click to vote
AAAI
2011
14 years 1 months ago
2011
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...