Sciweavers

440 search results - page 13 / 88
» A Fast Algorithm for Learning a Ranking Function from Large-...
Sort
View
KDD
2010
ACM
257views Data Mining» more  KDD 2010»
13 years 11 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...
WWW
2009
ACM
14 years 8 months ago
An axiomatic approach for result diversification
Understanding user intent is key to designing an effective ranking system in a search engine. In the absence of any explicit knowledge of user intent, search engines want to diver...
Sreenivas Gollapudi, Aneesh Sharma
PKDD
2004
Springer
155views Data Mining» more  PKDD 2004»
14 years 1 months ago
Ensemble Feature Ranking
A crucial issue for Machine Learning and Data Mining is Feature Selection, selecting the relevant features in order to focus the learning search. A relaxed setting for Feature Sele...
Kees Jong, Jérémie Mary, Antoine Cor...
WWW
2009
ACM
14 years 8 months ago
Learning consensus opinion: mining data from a labeling game
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus ranki...
Paul N. Bennett, David Maxwell Chickering, Anton M...
CIKM
2008
Springer
13 years 10 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...