Hongzhi Yin
Bin Cui
Abstract
The success of "infinite-inventory" retailers such as Amazon.com and Netflix has been largely attributed to a "long tail" phenomenon. Although the majority of their inventory is not in high demand, these niche products, unavailable at limited-inventory competitors, generate a significant fraction of total revenue in aggregate. In addition, tail product availability can boost head sales by offering consumers the convenience of "one-stop shopping" for both their mainstream and niche tastes. However, most of existing recommender systems, especially collaborative filter based methods, can not recommend tail products due to the data sparsity issue. It has been widely acknowledged that to recommend popular products is easier yet more trivial while to recommend long tail products adds more novelty yet it is also a more challenging task.
In this paper, we propose a novel suite of graph-based algorithms for the long tail recommendation. We first represent user-item information with undirected edge-weighted graph and investigate the theoretical foundation of applying Hitting Time algorithm for long tail item recommendation. To improve recommendation diversity and accuracy, we extend Hitting Time and propose efficient Absorbing Time algorithm to help users find their favorite long tail items. Finally, we refine the Absorbing Time algorithm and propose two entropy-biased Absorbing Cost algorithms to distinguish the variation on different user-item rating pairs, which further enhances the effectiveness of long tail recommendation. Empirical experiments on two real life datasets show that our proposed algorithms are effective to recommend long tail items and outperform state-of-the-art recommendation techniques.
- D. Agarwal and B.-C. Chen. Regression-based latent factor models. In KDD, pages 19--28, 2009. Google Scholar
Digital Library
- D. Agarwal and B.-C. Chen. flda: matrix factorization through latent dirichlet allocation. In WSDM, pages 91--100, 2010. Google ScholarDigital Library
- C. Anderson. The Long Tail: Why the Futhure of Business is Selling Less of More. Hyperion, 2006. Google ScholarDigital Library
- M. Brand. A random walks perspective on maximizing satisfaction and profit. In SDM, 2005.Google ScholarCross Ref
- W.-Y. Chen, J.-C. Chu, J. Luan, H. Bai, Y. Wang, and E. Y. Chang. Collaborative filtering for orkut communities: discovery of user latent behavior. In WWW, pages 681--690, 2009. Google ScholarDigital Library
- P. Cremonesi, Y. Koren, and R. Turrin. Performance of recommender algorithms on top-n recommendation tasks. In RecSys, pages 39--46, 2010. Google ScholarDigital Library
- D. M. Fleder and K. Hosanagar. Recommender systems and their impact on sales diversity. In EC, pages 192--199, 2007. Google ScholarDigital Library
- F. Fouss, A. Pirotte, J. Renders, and M. Saerens. A novel way of computing dissimilarities between nodes of a graph, with application to collaborative filtering and subspace projection of the graph nodes. In ECML, 2004. Google ScholarDigital Library
- T. L. Griffiths and M. Steyvers. Finding scientific topics. Proc Natl Acad Sci U S A, pages 5228--35, 2004.Google ScholarCross Ref
- Z. Guan, J. Wu, Q. Zhang, A. Singh, and X. Yan. Assessing and ranking structural correlations in graphs. In SIGMOD, pages 937--948, 2011. Google ScholarDigital Library
- T. H. Haveliwala. Topic-sensitive pagerank. In WWW, pages 517--526, 2002. Google ScholarDigital Library
- J. Herlocker, J. A. Konstan, and J. Riedl. An empirical analysis of design choices in neighborhood-based collaborative filtering algorithms. Inf. Retr., 5:287--310, October 2002. Google ScholarDigital Library
- J. G. Kemeny and J. L. Snell. Finite Markov Chains. Springer-Verlag, 1976.Google Scholar
- J. Norris. Markov Chains. Cambridge University Press, 1997.Google Scholar
- Y. Kang and N. Yu. Soft-constraint based online lda for community recommendation. In PCM, pages 494--505, 2010. Google ScholarDigital Library
- Y. Koren. Factorization meets the neighborhood: a multifaceted collaborative filtering model. In KDD, pages 426--434, 2008. Google ScholarDigital Library
- R. Krestel, P. Fankhauser, and W. Nejdl. Latent dirichlet allocation for tag recommendation. In RecSys, pages 61--68, 2009. Google ScholarDigital Library
- L. Lovsz. Random walks on graphs: A survey, 1993.Google Scholar
- H. Ma, M. R. Lyu, and I. King. Diversifying query suggestion results. In AAAI, 2010.Google Scholar
- M. R. McLaughlin and J. L. Herlocker. A collaborative filtering algorithm and evaluation metric that accurately model the user experience. In SIGIR, pages 329--336, 2004. Google ScholarDigital Library
- S. M. McNee, J. Riedl, and J. A. Konstan. Being accurate is not enough: how accuracy metrics have hurt recommender systems. In CHI EA, pages 1097--1101, 2006. Google ScholarDigital Library
- D. Oktar. Recommendation Systems: Increasing Profit by Long Tail. http://en.webrazzi.com/2009/09/18/.Google Scholar
- K. Onuma, H. Tong, and C. Faloutsos. Tangent: a novel, 'surprise me', recommendation algorithm. In KDD, pages 657--666, 2009. Google ScholarDigital Library
- A. G. Parameswaran, G. Koutrika, B. Bercovitz, and H. Garcia-Molina. Recsplorer: recommendation algorithms based on precedence mining. In SIGMOD, pages 87--98, 2010. Google ScholarDigital Library
- F. Ricci, L. Rokach, B. Shapira, and P. B. Kantor. Recommender Systems Handbook. Springer-Verlag New York, Inc., 2010. Google ScholarDigital Library
- C. E. Shannon. Prediction and entropy of printed english. Bell Systems Technical Journal, 30:50--64, 1951.Google ScholarCross Ref
- S. Ross. Stochastic processes, 2nd ed, 1996.Google Scholar
- M. Steyvers and T. Griffiths. Probabilistic Topic Models. Lawrence Erlbaum Associates, 2007.Google Scholar
- F. Wang, S. Ma, L. Yang, and T. Li. Recommendation on item graphs. In ICDM, pages 1119--1123, 2006. Google ScholarDigital Library
Index Terms
- Challenging the long tail recommendation
Recommendations
Long-tail Session-based Recommendation
RecSys '20: Proceedings of the 14th ACM Conference on Recommender SystemsSession-based recommendation focuses on the prediction of user actions based on anonymous sessions and is a necessary method in the lack of user historical data. However, none of the existing session-based recommendation methods explicitly takes the ...
Long-Tail Recommendation Framework Using Frequent Neighbors
ICIT '20: Proceedings of the 2020 8th International Conference on Information Technology: IoT and Smart CityThe neighborhood-based recommendation method is a basic collaborative-filtering method, and one of the methods still used in the industry. The main basis for recommendation is the user's scoring data in the neighborhood-based recommendation method. ...
A Survey of Long-Tail Item Recommendation Methods
Recommender systems represent a critical field of AI technology applications. The core function of a recommender system is to recommend items of interest to users, but if it is only user history-based (purchasing or browsing data), it can only recommend ...
Comments