Sciweavers

448 search results - page 31 / 90
» Directly optimizing evaluation measures in learning to rank
Sort
View
KDD
2007
ACM
154views Data Mining» more  KDD 2007»
16 years 6 days ago
Canonicalization of database records using adaptive similarity measures
It is becoming increasingly common to construct databases from information automatically culled from many heterogeneous sources. For example, a research publication database can b...
Aron Culotta, Michael L. Wick, Robert Hall, Matthe...
UAI
2008
15 years 1 months ago
Learning Inclusion-Optimal Chordal Graphs
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
Vincent Auvray, Louis Wehenkel
ACL
2008
15 years 1 months ago
Learning Effective Multimodal Dialogue Strategies from Wizard-of-Oz Data: Bootstrapping and Evaluation
We address two problems in the field of automatic optimization of dialogue strategies: learning effective dialogue strategies when no initial data or system exists, and evaluating...
Verena Rieser, Oliver Lemon
SIGIR
2011
ACM
14 years 2 months ago
A boosting approach to improving pseudo-relevance feedback
Pseudo-relevance feedback has proven effective for improving the average retrieval performance. Unfortunately, many experiments have shown that although pseudo-relevance feedback...
Yuanhua Lv, ChengXiang Zhai, Wan Chen
105
Voted
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 3 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