ACM Home Page
Please provide us with feedback. Feedback
On the limitations of browsing top-N recommender systems
Full text PdfPdf (458 KB)
Source
ACM Conference On Recommender Systems archive
Proceedings of the third ACM conference on Recommender systems table of contents
New York, New York, USA
SESSION: Short papers table of contents
Pages 321-324  
Year of Publication: 2009
ISBN:978-1-60558-435-5
Authors
Klaus Seyerlehner  Johannes Kepler University, Linz, Austria
Arthur Flexer  Austrian Research Institute for Artificial Intelligence, Vienna, Austria
Gerhard Widmer  Johannes Kepler University, Linz, Austria
Sponsor
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 12,   Citation Count: 0
Additional Information:

abstract   references   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1639714.1639778
What is a DOI?

ABSTRACT

To exploit the enormous potential of niche products, modern information systems must support users in exploring digital libraries and online catalogs. A straight-forward way of doing so is to support browsing the available items, which is in general realized by presenting a user the top-N recommendations for each item. However, recent research indicates that most of the niche products reside in the so-called Long Tail, and simple collaborative filtering-based recommender systems alone do not allow to explore these niche products. In this paper we show that it is not only a popularity problem related to the collaborative filtering approach that makes a portion of the elements of a digital library inaccessible via browsing, but also a consequence of the top N-recommendation approach itself.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
C. Anderson. The Long Tail: Why the Future of Business Is Selling Less of More. Hyperion, July 2006.
 
2
E. Brynjolfsson, Y. J. Hu, and M. D. Smith. From niches to riches: Anatomy of the long tail. Sloan Management Review, 2006.
 
3
O. Celma and P. Cano. From hits to niches? or how popular artists can bias music recommendation and discovery. In 2nd Workshop on Large-Scale Recommender Systems (ACM KDD), 2008.
 
4
O. Celma and P. Herrera. A new approach to evaluating novel recommendations. In 2008 ACM Conf. on Recommender Systems, 2008.
 
5
P. Erdos and A. Rényi. On random graphs. I. Publ. Math. Debrecen, 1959.
 
6
A. Flexer, D. Schnitzer, M. Gasser, and G. Widmer. Playlist generation using start and end songs. In Proc. Int. Symposium on Music Information Retrieval, 2008.
 
7
J. L. Herlocker, J. A. Konstan, L. G. Terveen, and J. T. Riedl. Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst., 2004.
 
8
G. Karypis. Evaluation of item-based top-n recommendation algorithms. In CIKM '01: Proc. of the 10th Int. Conf. on Information and Knowledge Management, 2001.
 
9
S. K. Lam and J. Riedl. Shilling recommender systems for fun and profit. In WWW '04: Proc. of the 13th Int. Conf. on World Wide Web, 2004.
 
10
M. E. J. Newman. The structure and function of complex networks. SIAM Review, 2003.
 
11
Y.-J. Park and A. Tuzhilin. The long tail of recommender systems and how to leverage it. In RecSys '08: Proc. of the 2008 ACM Conf. on Recommender Systems, 2008.
 
12
M. Radovanovit'c, A. Nanopoulos, and M. Ivanovit'c. Nearest neighbors in high--dimensional data: The emergence and influence of hubs. In Proc. of the 26th Int. Conf. on Machine Learning, 2009.
 
13
B. Sarwar, G. Karypis, J. Konstan, and J. Reidl. Item-based collaborative filtering recommendation algorithms. In WWW '01: Proc. of the 10th Int. Conf. on World Wide Web, 2001.