Sciweavers

2100 search results - page 55 / 420
» Learning to rank on graphs
Sort
View
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
15 years 10 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...
LREC
2010
216views Education» more  LREC 2010»
14 years 11 months ago
Automatic Grammar Rule Extraction and Ranking for Definitions
Learning texts contain much implicit knowledge which is ideally presented to the learner in a structured manner - a typical example being definitions of terms in the text, which w...
Claudia Borg, Mike Rosner, Gordon J. Pace
SIGIR
2008
ACM
14 years 9 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
CIKM
2010
Springer
14 years 8 months ago
Online learning for recency search ranking using real-time user feedback
Traditional machine-learned ranking algorithms for web search are trained in batch mode, which assume static relevance of documents for a given query. Although such a batch-learni...
Taesup Moon, Lihong Li, Wei Chu, Ciya Liao, Zhaohu...
ICML
2005
IEEE
15 years 10 months ago
Online learning over graphs
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simp...
Mark Herbster, Massimiliano Pontil, Lisa Wainer