Sciweavers

812 search results - page 1 / 163
» Preference-based learning to rank
Sort
View
ICML
1998
IEEE
14 years 5 months ago
An Efficient Boosting Algorithm for Combining Preferences
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...
Yoav Freund, Raj D. Iyer, Robert E. Schapire, Yora...
CHI
2006
ACM
14 years 5 months ago
groupTime: preference based group scheduling
As our business, academic, and personal lives continue to move at an ever-faster pace, finding times for busy people to meet has become an art. One of the most perplexing challeng...
Mike Brzozowski, Kendra Carattini, Scott R. Klemme...
NLP
2000
13 years 8 months ago
Enhancing Preference-Based Anaphora Resolution with Genetic Algorithms
Abstract. The paper argues that a promising way to improve the success rate of preference-based anaphora resolution algorithms is the use of machine learning. The paper outlines MA...
Constantin Orasan, Richard Evans, Ruslan Mitkov
SIGIR
2012
ACM
11 years 7 months ago
Top-k learning to rank: labeling, ranking and evaluation
In this paper, we propose a novel top-k learning to rank framework, which involves labeling strategy, ranking model and evaluation measure. The motivation comes from the difficul...
Shuzi Niu, Jiafeng Guo, Yanyan Lan, Xueqi Cheng
SIGIR
2012
ACM
11 years 7 months ago
Learning to suggest: a machine learning framework for ranking query suggestions
We consider the task of suggesting related queries to users after they issue their initial query to a web search engine. We propose a machine learning approach to learn the probab...
Umut Ozertem, Olivier Chapelle, Pinar Donmez, Emre...