Klaus Seyerlehner
Gerhard Widmer
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.
- C. Anderson. The Long Tail: Why the Future of Business Is Selling Less of More. Hyperion, July 2006. Google Scholar
Digital Library
- E. Brynjolfsson, Y. J. Hu, and M. D. Smith. From niches to riches: Anatomy of the long tail. Sloan Management Review, 2006.Google Scholar
- 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.Google Scholar
- O. Celma and P. Herrera. A new approach to evaluating novel recommendations. In 2008 ACM Conf. on Recommender Systems, 2008. Google ScholarDigital Library
- P. Erdos and A. Rényi. On random graphs. I. Publ. Math. Debrecen, 1959.Google Scholar
- 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.Google Scholar
- J. L. Herlocker, J. A. Konstan, L. G. Terveen, and J. T. Riedl. Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst., 2004. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- M. E. J. Newman. The structure and function of complex networks. SIAM Review, 2003.Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
Index Terms
- On the limitations of browsing top-N recommender systems
Recommendations
RNR: A Generic Bayesian-based Framework for Enhancing Top-N Recommender Systems
WWW '20: Companion Proceedings of the Web Conference 2020In personalized top-N recommender systems, a core task is to design effective methods to measure user-item preference scores and then to suggest, for each user, a small set of personalized items with high scores. However, little attention was paid to ...
A new collaborative filtering approach for increasing the aggregate diversity of recommender systems
KDD '13: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data miningIn order to satisfy and positively surprise the users, a recommender system needs to recommend items the users will like and most probably would not have found on their own. This requires the recommender system to recommend a broader range of items ...
Differentiating Regularization Weights -- A Simple Mechanism to Alleviate Cold Start in Recommender Systems
Matrix factorization (MF) and its extended methodologies have been studied extensively in the community of recommender systems in the last decade. Essentially, MF attempts to search for low-ranked matrices that can (1) best approximate the known rating ...
Comments