Ramon Lopes
Skip Abstract Section
Abstract
Graph-based approaches provide an effective memory-based alternative to latent factor models for collaborative recommendation. Modern approaches rely on either sampling short walks or enumerating short paths starting from the target user in a user-item bipartite graph. While the effectiveness of random walk sampling heavily depends on the underlying path sampling strategy, path enumeration is sensitive to the strategy adopted for scoring each individual path. In this article, we demonstrate how both strategies can be improved through Bayesian reasoning. In particular, we propose to improve random walk sampling by exploiting distributional aspects of items’ ratings on the sampled paths. Likewise, we extend existing path enumeration approaches to leverage categorical ratings and to scale the score of each path proportionally to the affinity of pairs of users and pairs of items on the path. Experiments on several publicly available datasets demonstrate the effectiveness of our proposed approaches compared to state-of-the-art graph-based recommenders.
- Charu C. Aggarwal. 2016. Recommender Systems: The Textbook. Springer International Publishing, Switzerland.Google Scholar
Digital Library
- Shumeet Baluja, Rohan Seth, D. Sivakumar, Yushi Jing, Jay Yagnik, Shankar Kumar, Deepak Ravichandran, and Mohamed Aly. 2008. Video suggestion and discovery for YouTube: Taking random walks through the view graph. In Proceedings of the 17th International Conference on World Wide Web. ACM, New York, NY, 895--904.Google ScholarDigital Library
- Fabian Christoffel, Bibek Paudel, Chris Newell, and Abraham Bernstein. 2015. Blockbusters and wallflowers: Accurate, diverse, and scalable recommendations with random walks. In Proceedings of the 9th ACM Conference on Recommender Systems. ACM, New York, NY, 163--170.Google ScholarDigital Library
- John Cook. 2005. Exact Calculation of Beta Inequalities. Technical Report. Department of Biostatistics. University of Texas, M. D. Anderson Cancer Center.Google Scholar
- Colin Cooper, Sang Hyuk Lee, Tomasz Radzik, and Yiannis Siantos. 2014. Random walks in recommender systems: Exact computation and simulations. In Proceedings of the 23rd International Conference on World Wide Web. ACM, New York, NY, 811--816.Google ScholarDigital Library
- Paolo Cremonesi, Yehuda Koren, and Roberto Turrin. 2010. Performance of recommender algorithms on top-N recommendation tasks. In Proceedings of the 4th ACM Conference on Recommender Systems. ACM, New York, NY, 39--46.Google ScholarDigital Library
- Easley David and Kleinberg Jon. 2010. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, New York, NY.Google ScholarDigital Library
- Francois Fouss, Alain Pirotte, Jean-michel Renders, and Marco Saerens. 2007. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng. 19, 3 (2007), 355--369.Google ScholarDigital Library
- Francois Fouss, Alain Pirotte, and Marco Saerens. 2005. A novel way of computing similarities between nodes of a graph, with application to collaborative recommendation. In Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence. IEEE Computer Society, Washington, DC, 550--556.Google ScholarDigital Library
- Mark Galassi et al. 2009. GNU Scientific Library Reference Manual (3rd ed.). Network Theory Ltd.Google Scholar
- Zeno Gantner, Steffen Rendle, Christoph Freudenthaler, and Lars Schmidt-Thieme. 2011. MyMediaLite: A free recommender system library. In Proceedings of the 5th ACM Conference on Recommender Systems. ACM, New York, NY, 305--308.Google ScholarDigital Library
- Andrew Gelman, John B. Carlin, Hal S. Stern, and Donald B. Rubin. 2004. Bayesian Data Analysis (2nd ed.). Chapman and Hall/CRC.Google Scholar
- Marco Gori and Augusto Pucci. 2007. ItemRank: A random-walk based scoring algorithm for recommender engines. In Proceedings of the 20th International Joint Conference on Artificial Intelligence. Morgan Kaufmann Publishers Inc., San Francisco, CA, 2766--2771.Google Scholar
- F. Maxwell Harper and Joseph A. Konstan. 2015. The MovieLens datasets: History and context. ACM Trans. Interact. Intell. Syst. 5, 4 (2015), 1--19.Google ScholarDigital Library
- Xiangnan He, Lizi Liao, Hanwang Zhang, Liqiang Nie, Xia Hu, and Tat-Seng Chua. 2017. Neural collaborative filtering. In Proceedings of the 26th International Conference on World Wide Web. International World Wide Web Conferences Steering Committee, 173--182.Google ScholarDigital Library
- Peter D. Hoff. 2009. A First Course in Bayesian Statistical Methods (1st ed.). Springer Publishing Company, Incorporated.Google Scholar
- Yifan Hu, Yehuda Koren, and Chris Volinsky. 2008. Collaborative filtering for implicit feedback datasets. In Proceedings of the 8th IEEE International Conference on Data Mining. IEEE Computer Society, Washington, DC, 263--272.Google ScholarDigital Library
- Mohsen Jamali and Martin Ester. 2009. TrustWalker: A random walk model for combining trust-based and item-based recommendation. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York, NY, 397--406.Google ScholarDigital Library
- Dietmar Jannach, Markus Zanker, Alexander Felfernig, and Gerhard Friedrich. 2010. Recommender Systems: An Introduction. Cambridge University Press, New York, NY.Google ScholarCross Ref
- Kalervo Järvelin and Jaana Kekäläinen. 2002. Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst. 20, 4 (2002), 422--446.Google ScholarDigital Library
- Yehuda Koren, Robert Bell, and Chris Volinsky. 2009. Matrix factorization techniques for recommender systems. Computer 42, 8 (2009), 30--37.Google ScholarDigital Library
- Sangkeun Lee, Sungchan Park, Minsuk Kahng, and Sang-goo Lee. 2012. PathRank: A novel node ranking measure on a heterogeneous graph for recommender systems. In Proceedings of the 21st ACM International Conference on Information and Knowledge Management. ACM, New York, NY, 1637--1641.Google ScholarDigital Library
- Dawen Liang, Jaan Altosaar, Laurent Charlin, and David M. Blei. 2016. Factorization meets the item embedding: Regularizing matrix factorization with item co-occurrence. In Proceedings of the 10th ACM Conference on Recommender Systems. ACM, New York, NY, 59--66.Google Scholar
- Ramon Lopes, Renato Assunção, and Rodrygo L. T. Santos. 2016. Efficient Bayesian methods for graph-based recommendation. In Proceedings of the 10th ACM Conference on Recommender Systems. ACM, New York, NY, 333--340.Google Scholar
- Paolo Massa and Paolo Avesani. 2007. Trust-aware recommender systems. In Proceedings of the 1st ACM Conference on Recommender Systems. ACM, New York, NY, 17--24.Google ScholarDigital Library
- Julian McAuley, Rahul Pandey, and Jure Leskovec. 2015. Inferring networks of substitutable and complementary products. In Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 785--794.Google ScholarDigital Library
- Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1999. The PageRank Citation Ranking: Bringing Order to the Web. Technical Report 1999-66. Stanford InfoLab.Google Scholar
- Yoon-Joo Park and Alexander Tuzhilin. 2008. The long tail of recommender systems and how to leverage it. In Proceedings of the 2nd ACM Conference on Recommender Systems. ACM, New York, NY, 11--18.Google ScholarDigital Library
- Bibek Paudel, Fabian Christoffel, Chris Newell, and Abraham Bernstein. 2016. Updatable, accurate, diverse, and scalable recommendations for interactive applications. ACM Trans. Interact. Intell. Syst. 7, 1, Article 1 (2016), 34 pages.Google ScholarDigital Library
- Anand Rajaraman and Jeffrey David Ullman. 2011. Mining of Massive Datasets. Cambridge University Press, New York, NY. 161--198 pages.Google Scholar
- Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2009. BPR: Bayesian personalized ranking from implicit feedback. In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence. AUAI Press, 452--461.Google ScholarDigital Library
- Sheldon M. Ross. 2006. Simulation, Fourth Edition. Academic Press, Inc.Google Scholar
- Guy Shani and Asela Gunawardana. 2011. Recommender Systems Handbook. Springer US, Boston, MA, Chapter Evaluating Recommendation Systems, 257--297.Google Scholar
- Ajit P. Singh, Asela Gunawardana, Chris Meek, and Arun C. Sudendran. 2007. Recommendations using absorbing random walks. In Proceedings of the North East Student Colloquium on Artificial Intelligence.Google Scholar
- David H. Wolpert. 1996. The lack of a priori distinctions between learning algorithms. Neural Comput. 8, 7 (Oct. 1996), 1341--1390.Google Scholar
- Liang Xiang, Quan Yuan, Shiwan Zhao, Li Chen, Xiatian Zhang, Qing Yang, and Jimeng Sun. 2010. Temporal recommendation on graphs via long- and short-term preference fusion. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York, NY, 723--732.Google ScholarDigital Library
- Hilmi Yildirim and Mukkai S. Krishnamoorthy. 2008. A random walk method for alleviating the sparsity problem in collaborative filtering. In Proceedings of the 2nd ACM Conference on Recommender Systems. ACM, New York, NY, 131--138.Google Scholar
- Cai-Nicolas Ziegler, Sean M. McNee, Joseph A. Konstan, and Georg Lausen. 2005. Improving recommendation lists through topic diversification. In Proceedings of the 14th International Conference on World Wide Web. ACM, New York, NY, 22--32.Google ScholarDigital Library
Index Terms
- Graph-based Recommendation Meets Bayes and Similarity Measures
Recommendations
Efficient Bayesian Methods for Graph-based Recommendation
RecSys '16: Proceedings of the 10th ACM Conference on Recommender SystemsShort-length random walks on the bipartite user-item graph have recently been shown to provide accurate and diverse recommendations. Nonetheless, these approaches suffer from severe time and space requirements, which can be alleviated via random walk ...
Frequency-based similarity measure for multimedia recommender systems
Personalized recommendation has become a pivotal aspect of online marketing and e-commerce as a means of overcoming the information overload problem. There are several recommendation techniques but collaborative recommendation is the most effective and ...
A Particle Swarm Optimization Approach to Multi Criteria Recommender System Utilizing Effective Similarity Measures
ICMLC '17: Proceedings of the 9th International Conference on Machine Learning and ComputingRecommender system (RS), a web personalization tool, attempts to generate suitable recommendations to users based on their preferences. Generally, recommender system works on overall ratings but these ratings do not reflect the actual user preferences. ...
Comments