Sciweavers

39 search results - page 2 / 8
» Label ranking by learning pairwise preferences
Sort
View
ML
2008
ACM
134views Machine Learning» more  ML 2008»
13 years 7 months ago
Multilabel classification via calibrated label ranking
Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. Hitherto existing approaches to label ranking implicitly operat...
Johannes Fürnkranz, Eyke Hüllermeier, En...
CIKM
2009
Springer
14 years 2 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...
SIGIR
2006
ACM
14 years 1 months ago
Learning a ranking from pairwise preferences
We introduce a novel approach to combining rankings from multiple retrieval systems. We use a logistic regression model or an SVM to learn a ranking from pairwise document prefere...
Ben Carterette, Desislava Petkova
CIKM
2008
Springer
13 years 9 months ago
Suppressing outliers in pairwise preference ranking
Many of the recently proposed algorithms for learning feature-based ranking functions are based on the pairwise preference framework, in which instead of taking documents in isola...
Vitor R. Carvalho, Jonathan L. Elsas, William W. C...
ECAI
2006
Springer
13 years 11 months ago
A Unified Model for Multilabel Classification and Ranking
Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. Hitherto existing approaches to label ranking implicitly operate...
Klaus Brinker, Johannes Fürnkranz, Eyke H&uum...