Sciweavers

492 search results - page 22 / 99
» Querying with Intrinsic Preferences
Sort
View
WWW
2009
ACM
14 years 10 months ago
Learning consensus opinion: mining data from a labeling game
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus ranki...
Paul N. Bennett, David Maxwell Chickering, Anton M...
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
14 years 10 months ago
Query chains: learning to rank from implicit feedback
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
Filip Radlinski, Thorsten Joachims
LOGCOM
2007
97views more  LOGCOM 2007»
13 years 9 months ago
A General Framework for Expressing Preferences in Causal Reasoning and Planning
We consider the problem of incorporating arbitrary preferences in planning systems. A preference may be seen as a goal or constraint that is desirable, but not necessary, to satis...
James P. Delgrande, Torsten Schaub, Hans Tompits
COLING
2010
13 years 4 months ago
Utilizing User-input Contextual Terms for Query Disambiguation
Precision-oriented search results such as those typically returned by the major search engines are vulnerable to issues of polysemy. When the same term refers to different things,...
Byron J. Gao, David C. Anastasiu, Xing Jiang
ICML
1998
IEEE
14 years 10 months ago
An Efficient Boosting Algorithm for Combining Preferences
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
Yoav Freund, Raj D. Iyer, Robert E. Schapire, Yora...