Sciweavers

29 search results - page 5 / 6
» Best Position Algorithms for Top-k Queries
Sort
View
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
14 years 5 months ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch
WWW
2009
ACM
14 years 6 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...
CIKM
2010
Springer
13 years 3 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...
CLEF
2010
Springer
13 years 6 months ago
Experiences at ImageCLEF 2010 using CBIR and TBIR Mixing Information Approaches
The main goal of this paper it is to present our experiments in ImageCLEF 2010 Campaign (Wikipedia retrieval task). This edition we present a different way of using textual and vis...
Joan Benavent, Xaro Benavent, Esther de Ves, Ruben...
WSDM
2010
ACM
160views Data Mining» more  WSDM 2010»
14 years 2 months ago
Learning Concept Importance Using a Weighted Dependence Model
Modeling query concepts through term dependencies has been shown to have a significant positive effect on retrieval performance, especially for tasks such as web search, where rel...
Michael Bendersky, Donald Metzler, W. Bruce Croft