Sciweavers

266 search results - page 18 / 54
» Parallel learning to rank for information retrieval
Sort
View
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 8 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
SIGIR
2009
ACM
14 years 2 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
SIGIR
2009
ACM
14 years 2 months ago
Incorporating prior knowledge into a transductive ranking algorithm for multi-document summarization
This paper presents a transductive approach to learn ranking functions for extractive multi-document summarization. At the first stage, the proposed approach identifies topic th...
Massih-Reza Amini, Nicolas Usunier
CIKM
2011
Springer
12 years 7 months ago
Improved answer ranking in social question-answering portals
Community QA portals provide an important resource for non-factoid question-answering. The inherent noisiness of user-generated data makes the identification of high-quality cont...
Felix Hieber, Stefan Riezler
18
Voted
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 8 months ago
Structured learning for non-smooth ranking losses
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
Soumen Chakrabarti, Rajiv Khanna, Uma Sawant, Chir...