Fabian Christoffel
Abraham Bernstein
ABSTRACT
User satisfaction is often dependent on providing accurate and diverse recommendations. In this paper, we explore scalable algorithms that exploit random walks as a sampling technique to obtain diverse recommendations without compromising on accuracy. Specifically, we present a novel graph vertex ranking recommendation algorithm called RP^3_beta that re-ranks items based on 3-hop random walk transition probabilities. We show empirically, that RP^3_beta provides accurate recommendations with high long-tail item frequency at the top of the recommendation list. We also present scalable approximate versions of RP^3_beta and the two most accurate previously published vertex ranking algorithms based on random walk transition probabilities and show that these approximations converge with increasing number of samples.
Supplemental Material
- G. Adomavicius and Y. Kwon. Maximizing Aggregate Recommendation Diversity: A Graph-Theoretic Approach. In Workshop on Novelty and Diversity in Recommender Systems, ACM RecSys, 2011.Google Scholar
- G. Adomavicius and Y. Kwon. Improving Aggregate Recommendation Diversity Using Ranking-Based Techniques. IEEE Transactions on Knowledge and Data Engineering, 2012. Google ScholarDigital Library
- C. C. Aggarwal, J. L. Wolf, K.-L. Wu, and P. S. Yu. Horting Hatches an Egg: A New Graph-Theoretich Approach to Collaborative Filtering. In ACM SIGKDD, 1999. Google ScholarDigital Library
- S. Baluja, R. Seth, D. Sivakumar, Y. Jing, J. Yagnik, S. Kumar, D. Ravichandran, and M. Aly. Video Suggestion and Discovery for YouTube: Taking Random Walks Through the View Graph. In WWW Conference, 2008. Google ScholarDigital Library
- T. Bogers. Movie Recommendation using Random Walks over the Contextual Graph. In Workshop on Context-Aware Recommender Systems, ACM RecSys, 2010.Google Scholar
- C. Cooper, S. H. Lee, T. Radzik, and Y. Siantos. Random Walks in Recommender Systems: Exact Computation and Simulations. In WWW Conference, 2014. Google ScholarDigital Library
- P. Cremonesi, F. Garzotto, S. Negro, A. V. Papadopoulos, and R. Turrin. Looking for "Good" Recommendations: A Comparative Evaluation of Recommender Systems. In INTERACT 2011. Springer, 2011. Google ScholarDigital Library
- D. M. Fleder and K. Hosanagar. Blockbuster Culture's Next Rise or Fall: The Impact of Recommender Systems on Sales Diversity. Management science, 2009. Google ScholarDigital Library
- F. Fouss, A. Pirotte, and M. Saerens. A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation. In IEEE/WIC/ACM International Conference on Web Intelligence, 2005. Google ScholarDigital Library
- Z. Gantner, S. Rendle, C. Freudenthaler, and L. Schmidt-Thieme. MyMediaLite: A Free Recommender System Library. In ACM RecSys, 2011. Google ScholarDigital Library
- D. G. Goldstein and D. C. Goldstein. Profiting from the long tail. Harvard Business Review, 2006.Google Scholar
- M. Gori and A. Pucci. ItemRank: A Random-Walk Based Scoring Algorithm for Recommender Engines. In IJCAI, 2007. Google ScholarDigital Library
- J. L. Herlocker, J. A. Konstan, L. G. Terveen, and J. T. Riedl. Evaluating Collaborative Filtering Recommender Systems. ACM Transactions on Information Systems, 2004. Google ScholarDigital Library
- Z. Huang, H. Chen, and D. Zeng. Applying Associative Retrieval Techniques to Alleviate the Sparsity Problem in Collaborative Filtering. ACM Transactions on Information Systems, 2004. Google ScholarDigital Library
- M. Jamali and M. Ester. TrustWalker: A RandomWalk Model for Combining Trust-based and Item-based Recommendation. In ACM SIGKDD, 2009. Google ScholarDigital Library
- S. Lee, S. Park, M. Kahng, and S.-g. Lee. PathRank: A Novel Node Ranking Measure on a Heterogeneous Graph for Recommender Systems. In CIKM, 2012. 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'06 extended abstracts. ACM, 2006. Google ScholarDigital Library
- E. Pariser. The Filter Bubble: What the Internet is Hiding from You. Penguin UK, 2011. Google ScholarDigital Library
- S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme. BPR: Bayesian Personalized Ranking from Implicit Feedback. In UAI, 2009. Google ScholarDigital Library
- P. Sarkar, A. W. Moore, and A. Prakash. Fast Incremental Proximity Search in Large Graphs. In ACM ICML, 2008. Google ScholarDigital Library
- S. Vargas and P. Castells. Rank and Relevance in Novelty and Diversity Metrics for Recommender Systems. In ACM RecSys, 2011. Google ScholarDigital Library
- L. Xiang, Q. Yuan, S. Zhao, L. Chen, X. Zhang, Q. Yang, and J. Sun. Temporal Recommendation on Graphs via Long- and Short-term Preference Fusion. In ACM SIGKDD, 2010. Google ScholarDigital Library
- T. Zhou, Z. Kuscsik, J.-G. Liu, M. Medo, J. R. Wakeling, and Y.-C. Zhang. Solving the apparent diversity-accuracy dilemma of recommender systems. PNAS, 2010.Google ScholarCross Ref
- C.-N. Ziegler, S. M. McNee, J. A. Konstan, and G. Lausen. Improving Recommendation Lists Through Topic Diversification. In WWW Conference, 2005. Google ScholarDigital Library
Index Terms
- Blockbusters and Wallflowers: Accurate, Diverse, and Scalable Recommendations with Random Walks
Recommendations
RecWalk: Nearly Uncoupled Random Walks for Top-N Recommendation
WSDM '19: Proceedings of the Twelfth ACM International Conference on Web Search and Data MiningRandom walks can provide a powerful tool for harvesting the rich network of interactions captured within item-based models for top-n recommendation. They can exploit indirect relations between the items, mitigate the effects of sparsity, ensure wider ...
Updatable, Accurate, Diverse, and Scalable Recommendations for Interactive Applications
Recommender systems form the backbone of many interactive systems. They incorporate user feedback to personalize the user experience typically via personalized recommendation lists. As users interact with a system, an increasing amount of data about a ...
A Double-Ranking Strategy for Long-Tail Product Recommendation
WI-IAT '12: Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01In this paper we attempt to retrieve the items in the long-tail for top-N recommendation. That is, to recommend products that the end-user likes, but that are not generally popular, which has been getting more and more notice lately. By analysing the ...
Comments