Sciweavers

39 search results - page 7 / 8
» Label ranking by learning pairwise preferences
Sort
View
CIKM
2008
Springer
13 years 6 months ago
Are click-through data adequate for learning web search rankings?
Learning-to-rank algorithms, which can automatically adapt ranking functions in web search, require a large volume of training data. A traditional way of generating training examp...
Zhicheng Dou, Ruihua Song, Xiaojie Yuan, Ji-Rong W...
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 5 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...
NIPS
2007
13 years 6 months ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...
SEKE
2004
Springer
13 years 10 months ago
Supporting the Requirements Prioritization Process. A Machine Learning approach
Requirements prioritization plays a key role in the requirements engineering process, in particular with respect to critical tasks such as requirements negotiation and software re...
Paolo Avesani, Cinzia Bazzanella, Anna Perini, Ang...
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
13 years 6 months ago
Active learning for biomedical citation screening
Active learning (AL) is an increasingly popular strategy for mitigating the amount of labeled data required to train classifiers, thereby reducing annotator effort. We describe ...
Byron C. Wallace, Kevin Small, Carla E. Brodley, T...