140
click to vote
SIGIR
2011
ACM
14 years 7 months ago
2011
ACM
In this paper, we propose a joint probabilistic topic model for simultaneously modeling the contents of multi-typed objects of a heterogeneous information network. The intuition b...
134
click to vote
SIGIR
2011
ACM
14 years 7 months ago
2011
ACM
Learning to rank represents a category of effective ranking methods for information retrieval. While the primary concern of existing research has been accuracy, learning efficien...
150
click to vote
SIGIR
2011
ACM
14 years 7 months ago
2011
ACM
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...
164
click to vote
SIGIR
2011
ACM
14 years 7 months ago
2011
ACM
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...
155
click to vote
SIGIR
2011
ACM
14 years 7 months ago
2011
ACM
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...
147
Voted
SIGIR
2011
ACM
14 years 7 months ago
2011
ACM
Many network-based ranking approaches have been proposed to rank objects according to different criteria, including relevance, prestige and diversity. However, existing approache...
158
click to vote
SIGIR
2011
ACM
14 years 7 months ago
2011
ACM
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...
154
click to vote
SIGIR
2011
ACM
14 years 7 months ago
2011
ACM
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...
SIGIR
2011
ACM
14 years 7 months ago
2011
ACM
143
click to vote
SIGIR
2011
ACM
14 years 7 months ago
2011
ACM
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...