Sciweavers

173 search results - page 4 / 35
» Learning to rank networked entities
Sort
View
ML
2010
ACM
141views Machine Learning» more  ML 2010»
13 years 4 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
IIR
2010
13 years 7 months ago
Sentence-Based Active Learning Strategies for Information Extraction
Given a classifier trained on relatively few training examples, active learning (AL) consists in ranking a set of unlabeled examples in terms of how informative they would be, if ...
Andrea Esuli, Diego Marcheggiani, Fabrizio Sebasti...
KDD
2004
ACM
162views Data Mining» more  KDD 2004»
14 years 6 months ago
Discovering Links Between Lexical and Surface Features in Questions and Answers
Information retrieval systems, based on keyword match, are evolving to question answering systems that return short passages or direct answers to questions, rather than URLs point...
Soumen Chakrabarti
CIKM
2010
Springer
13 years 4 months ago
Learning to rank relevant and novel documents through user feedback
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...
Abhimanyu Lad, Yiming Yang
ICML
2005
IEEE
14 years 7 months ago
Learning to rank using gradient descent
We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these...
Christopher J. C. Burges, Tal Shaked, Erin Renshaw...