Sciweavers

372 search results - page 20 / 75
» Learning to Rank Using an Ensemble of Lambda-Gradient Models
Sort
View
NLE
2008
140views more  NLE 2008»
13 years 7 months ago
Active learning and logarithmic opinion pools for HPSG parse selection
For complex tasks such as parse selection, the creation of labelled training sets can be extremely costly. Resource-efficient schemes for creating informative labelled material mu...
Jason Baldridge, Miles Osborne
ICML
2007
IEEE
14 years 8 months ago
Learning to rank: from pairwise approach to listwise approach
The paper is concerned with learning to rank, which is to construct a model or a function for ranking objects. Learning to rank is useful for document retrieval, collaborative fil...
Zhe Cao, Tao Qin, Tie-Yan Liu, Ming-Feng Tsai, Han...
CIKM
2005
Springer
13 years 9 months ago
Using RankBoost to compare retrieval systems
This paper presents a new pooling method for constructing the assessment sets used in the evaluation of retrieval systems. Our proposal is based on RankBoost, a machine learning v...
Huyen-Trang Vu, Patrick Gallinari
TNN
2010
127views Management» more  TNN 2010»
13 years 2 months ago
RAMOBoost: ranked minority oversampling in boosting
In recent years, learning from imbalanced data has attracted growing attention from both academia and industry due to the explosive growth of applications that use and produce imba...
Sheng Chen, Haibo He, Edwardo A. Garcia
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