Sciweavers

6095 search results - page 862 / 1219
» Learning in Local Search
Sort
View
187
Voted
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 10 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
ICML
2010
IEEE
15 years 7 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan
ML
2011
ACM
308views Machine Learning» more  ML 2011»
15 years 1 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
16 years 1 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
SIGIR
2005
ACM
16 years 8 days ago
Active feedback in ad hoc information retrieval
Information retrieval is, in general, an iterative search process, in which the user often has several interactions with a retrieval system for an information need. The retrieval ...
Xuehua Shen, ChengXiang Zhai