Sciweavers

342 search results - page 16 / 69
» Branch-and-bound processing of ranked queries
Sort
View
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
14 years 2 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...
CIKM
2008
Springer
13 years 9 months ago
Efficient and effective link analysis with precomputed salsa maps
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
Marc Najork, Nick Craswell
WWW
2007
ACM
14 years 8 months ago
Answering relationship queries on the web
Finding relationships between entities on the Web, e.g., the connections between different places or the commonalities of people, is a novel and challenging problem. Existing Web ...
Gang Luo, Chunqiang Tang, Ying-li Tian
SIGIR
2011
ACM
12 years 10 months ago
Ad hoc IR: not much room for improvement
Ranking function performance reached a plateau in 1994. The reason for this is investigated. First the performance of BM25 is measured as the proportion of queries satisfied on th...
Andrew Trotman, David Keeler
WWW
2007
ACM
14 years 8 months ago
A cautious surfer for PageRank
This work proposes a novel cautious surfer to incorporate trust into the process of calculating authority for web pages. We evaluate a total of sixty queries over two large, real-...
Lan Nie, Baoning Wu, Brian D. Davison