Sciweavers

SIGIR
2011
ACM
13 years 1 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
SIGIR
2011
ACM
13 years 1 months ago
Functional matrix factorizations for cold-start recommendation
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
Ke Zhou, Shuang-Hong Yang, Hongyuan Zha
SIGIR
2011
ACM
13 years 1 months ago
No free lunch: brute force vs. locality-sensitive hashing for cross-lingual pairwise similarity
This work explores the problem of cross-lingual pairwise similarity, where the task is to extract similar pairs of documents across two different languages. Solutions to this pro...
Ferhan Ture, Tamer Elsayed, Jimmy J. Lin
SIGIR
2011
ACM
13 years 1 months ago
Decayed DivRank: capturing relevance, diversity and prestige in information networks
Many network-based ranking approaches have been proposed to rank objects according to different criteria, including relevance, prestige and diversity. However, existing approache...
Pan Du, Jiafeng Guo, Xueqi Cheng
SIGIR
2011
ACM
13 years 1 months ago
Inverted indexes for phrases and strings
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
Manish Patil, Sharma V. Thankachan, Rahul Shah, Wi...
SIGIR
2011
ACM
13 years 1 months ago
Why searchers switch: understanding and predicting engine switching rationales
Search engine switching is the voluntary transition between Web search engines. Engine switching can occur for a number of reasons, including user dissatisfaction with search resu...
Qi Guo, Ryen W. White, Yunqiao Zhang, Blake Anders...
SIGIR
2011
ACM
13 years 1 months ago
Predicting web searcher satisfaction with existing community-based answers
Qiaoling Liu, Eugene Agichtein, Gideon Dror, Evgen...
SIGIR
2011
ACM
13 years 1 months ago
When documents are very long, BM25 fails!
We reveal that the Okapi BM25 retrieval function tends to overly penalize very long documents. To address this problem, we present a simple yet effective extension of BM25, namel...
Yuanhua Lv, ChengXiang Zhai
SIGIR
2011
ACM
13 years 1 months ago
Cluster-based fusion of retrieved lists
Methods for fusing document lists that were retrieved in response to a query often use retrieval scores (or ranks) of documents in the lists. We present a novel probabilistic fusi...
Anna Khudyak Kozorovitzky, Oren Kurland