Sciweavers

395 search results - page 14 / 79
» Learning to rank with partially-labeled data
Sort
View
IDA
2005
Springer
15 years 5 months ago
Learning Label Preferences: Ranking Error Versus Position Error
We consider the problem of learning a ranking function, that is a mapping from instances to rankings over a finite number of labels. Our learning method, referred to as ranking by...
Eyke Hüllermeier, Johannes Fürnkranz
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
16 years 3 days ago
Active exploration for learning rankings from clickthrough data
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
Filip Radlinski, Thorsten Joachims
CIKM
2008
Springer
15 years 1 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
2010
ACM
257views Data Mining» more  KDD 2010»
15 years 3 months ago
Multi-task learning for boosting with application to web search ranking
In this paper we propose a novel algorithm for multi-task learning with boosted decision trees. We learn several different learning tasks with a joint model, explicitly addressing...
Olivier Chapelle, Pannagadatta K. Shivaswamy, Srin...
BIOINFORMATICS
2005
79views more  BIOINFORMATICS 2005»
14 years 11 months ago
VizRank: finding informative data projections in functional genomics by machine learning
Gregor Leban, Ivan Bratko, Uros Petrovic, Tomaz Cu...