Sciweavers

118 search results - page 4 / 24
» Adapting boosting for information retrieval measures
Sort
View
SIGIR
2008
ACM
13 years 8 months ago
Learning to rank with partially-labeled data
Ranking algorithms, whose goal is to appropriately order a set of objects/documents, are an important component of information retrieval systems. Previous work on ranking algorith...
Kevin Duh, Katrin Kirchhoff
CIKM
2009
Springer
14 years 3 months ago
Learning to rank from Bayesian decision inference
Ranking is a key problem in many information retrieval (IR) applications, such as document retrieval and collaborative filtering. In this paper, we address the issue of learning ...
Jen-Wei Kuo, Pu-Jen Cheng, Hsin-Min Wang
CVPR
2008
IEEE
14 years 10 months ago
Discriminative modeling by Boosting on Multilevel Aggregates
This paper presents a new approach to discriminative modeling for classi cation and labeling. Our method, called Boosting on Multilevel Aggregates (BMA), adds a new class of hiera...
Jason J. Corso
DEXAW
2010
IEEE
196views Database» more  DEXAW 2010»
13 years 8 months ago
Direct Optimization of Evaluation Measures in Learning to Rank Using Particle Swarm
— One of the central issues in Learning to Rank (L2R) for Information Retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures ...
Ósscar Alejo, Juan M. Fernández-Luna...
PR
2006
164views more  PR 2006»
13 years 8 months ago
Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
Hong Chang, Dit-Yan Yeung