Sciweavers

15 search results - page 1 / 3
» Top-k aggregation using intersections of ranked inputs
Sort
View
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
13 years 11 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...
VLDB
2001
ACM
82views Database» more  VLDB 2001»
13 years 9 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
SIGMOD
2008
ACM
206views Database» more  SIGMOD 2008»
14 years 5 months ago
Ad-hoc aggregations of ranked lists in the presence of hierarchies
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...
Nilesh Bansal, Sudipto Guha, Nick Koudas
SIGIR
2006
ACM
13 years 10 months ago
Using historical data to enhance rank aggregation
Rank aggregation is a pervading operation in IR technology. We hypothesize that the performance of score-based aggregation may be affected by artificial, usually meaningless devia...
Miriam Fernández, David Vallet, Pablo Caste...
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 2 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen