Sciweavers

696 search results - page 2 / 140
» Maximum Margin Ranking Algorithms for Information Retrieval
Sort
View
ALT
2008
Springer
14 years 4 months ago
Smooth Boosting for Margin-Based Ranking
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
Jun-ichi Moribe, Kohei Hatano, Eiji Takimoto, Masa...
COLT
2005
Springer
14 years 1 months ago
Margin-Based Ranking Meets Boosting in the Middle
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
Cynthia Rudin, Corinna Cortes, Mehryar Mohri, Robe...
SIGIR
2009
ACM
14 years 2 months ago
A bayesian learning approach to promoting diversity in ranking for biomedical information retrieval
In this paper, we propose a Bayesian learning approach to promoting diversity for information retrieval in biomedicine and a re-ranking model to improve retrieval performance in t...
Xiangji Huang, Qinmin Hu
ICDM
2009
IEEE
175views Data Mining» more  ICDM 2009»
13 years 5 months ago
Maximum Margin Clustering with Multivariate Loss Function
This paper presents a simple but powerful extension of the maximum margin clustering (MMC) algorithm that optimizes multivariate performance measure specifically defined for clust...
Bin Zhao, James Tin-Yau Kwok, Changshui Zhang
CIKM
2005
Springer
14 years 1 months ago
Minimal document set retrieval
This paper presents a novel formulation and approach to the minimal document set retrieval problem. Minimal Document Set Retrieval (MDSR) is a promising information retrieval task...
Wei Dai, Rohini K. Srihari