Sciweavers

131 search results - page 2 / 27
» Pairwise Preference Learning and Ranking
Sort
View
COLING
2010
12 years 12 months ago
Cross-Market Model Adaptation with Pairwise Preference Data for Web Search Ranking
Machine-learned ranking techniques automatically learn a complex document ranking function given training data. These techniques have demonstrated the effectiveness and flexibilit...
Jing Bai, Fernando Diaz, Yi Chang, Zhaohui Zheng, ...
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
13 years 2 months ago
Learning Preferences with Millions of Parameters by Enforcing Sparsity
We study the retrieval task that ranks a set of objects for a given query in the pairwise preference learning framework. Recently researchers found out that raw features (e.g. word...
Xi Chen, Bing Bai, Yanjun Qi, Qihang Lin, Jaime G....
ICML
2006
IEEE
14 years 5 months ago
Learning user preferences for sets of objects
Most work on preference learning has focused on pairwise preferences or rankings over individual items. In this paper, we present a method for learning preferences over sets of it...
Marie desJardins, Eric Eaton, Kiri Wagstaff
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
CIKM
2009
Springer
13 years 11 months ago
A general magnitude-preserving boosting algorithm for search ranking
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang...