Sciweavers

91 search results - page 5 / 19
» Conditional Models for Non-smooth Ranking Loss Functions
Sort
View
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
ECML
2006
Springer
13 years 11 months ago
Case-Based Label Ranking
Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. We approach this setting from a case-based perspective and propo...
Klaus Brinker, Eyke Hüllermeier
ICML
2009
IEEE
14 years 8 months ago
BoltzRank: learning to maximize expected ranking gain
Ranking a set of retrieved documents according to their relevance to a query is a popular problem in information retrieval. Methods that learn ranking functions are difficult to o...
Maksims Volkovs, Richard S. Zemel
GLOBECOM
2007
IEEE
14 years 1 months ago
Properties of Greedy Geographical Routing in Spontaneous Wireless Mesh Networks
Abstract—We analyze greedy geographical routing in spontaneous wireless mesh networks to show several interesting properties. First, we can approximate the dependence of packet l...
Eryk Schiller, Paul Starzetz, Fabrice Theoleyre, A...
ECIR
2011
Springer
12 years 11 months ago
Weight-Based Boosting Model for Cross-Domain Relevance Ranking Adaptation
Adaptation techniques based on importance weighting were shown effective for RankSVM and RankNet, viz., each training instance is assigned a target weight denoting its importance ...
Peng Cai, Wei Gao, Kam-Fai Wong, Aoying Zhou