Sciweavers

395 search results - page 27 / 79
» Learning to rank with partially-labeled data
Sort
View
WWW
2011
ACM
14 years 8 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
CVPR
2008
IEEE
16 years 3 months ago
Face alignment via boosted ranking model
Face alignment seeks to deform a face model to match it with the features of the image of a face by optimizing an appropriate cost function. We propose a new face model that is al...
Gianfranco Doretto, Hao Wu, Xiaoming Liu 0002
CIKM
2008
Springer
15 years 3 months ago
Trada: tree based ranking function adaptation
Machine Learned Ranking approaches have shown successes in web search engines. With the increasing demands on developing effective ranking functions for different search domains, ...
Keke Chen, Rongqing Lu, C. K. Wong, Gordon Sun, La...
ECML
2007
Springer
15 years 8 months ago
A Simple Lexicographic Ranker and Probability Estimator
Given a binary classification task, a ranker sorts a set of instances from highest to lowest expectation that the instance is positive. We propose a lexicographic ranker, LexRank,...
Peter A. Flach, Edson Takashi Matsubara
PKDD
2009
Springer
118views Data Mining» more  PKDD 2009»
15 years 8 months ago
The Feature Importance Ranking Measure
Most accurate predictions are typically obtained by learning machines with complex feature spaces (as e.g. induced by kernels). Unfortunately, such decision rules are hardly access...
Alexander Zien, Nicole Krämer, Sören Son...