How to Impute Missing Ratings?: Claims, Solution, and Its Application to Collaborative Filtering

Data sparsity is one of the biggest problems faced by collaborative filtering used in recommender systems. Data imputation alleviates the data sparsity problem by inferring missing ratings and imputing them to the original rating matrix. In this paper, we identify the limitations of existing data imputation approaches and suggest three new claims that all data imputation approaches should follow to achieve high recommendation accuracy. Furthermore, we propose a deep-learning based approach to compute imputed values that satisfies all three claims. Based on our hypothesis that most pre-use preferences (e.g., impressions) on items lead to their post-use preferences (e.g., ratings), our approach tries to understand via deep learning how pre-use preferences lead to post-use preferences differently depending on the characteristics of users and items. Through extensive experiments on real-world datasets, we verify our three claims and hypothesis, and also demonstrate that our approach significantly outperforms existing state-of-the-art approaches.

[1]  Sang-Wook Kim,et al.  Data imputation using a trust network for recommendation , 2014, WWW.

[2]  Jongwuk Lee,et al.  Improving the accuracy of top-N recommendation using a preference model , 2016, Inf. Sci..

[3]  Lars Schmidt-Thieme,et al.  MyMediaLite: a free recommender system library , 2011, RecSys '11.

[4]  Maksims Volkovs,et al.  Effective Latent Models for Binary Feedback in Recommender Systems , 2015, SIGIR.

[5]  Harald Steck,et al.  Training and testing of recommender systems on data missing not at random , 2010, KDD.

[6]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[7]  Yehuda Koren,et al.  Matrix Factorization Techniques for Recommender Systems , 2009, Computer.

[8]  Tat-Seng Chua,et al.  Fast Matrix Factorization for Online Recommendation with Implicit Feedback , 2016, SIGIR.

[9]  Yifan Hu,et al.  Collaborative Filtering for Implicit Feedback Datasets , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[10]  Carl Doersch,et al.  Tutorial on Variational Autoencoders , 2016, ArXiv.

[11]  Roberto Turrin,et al.  Performance of recommender algorithms on top-n recommendation tasks , 2010, RecSys '10.

[12]  Max Welling,et al.  Auto-Encoding Variational Bayes , 2013, ICLR.

[13]  Ho Jin Choi,et al.  On Exploiting Trustors in Trust-Based Recommendation , 2015 .

[14]  Christos Faloutsos,et al.  Top-N recommendation through belief propagation , 2012, CIKM.

[15]  Max Welling,et al.  Semi-supervised Learning with Deep Generative Models , 2014, NIPS.

[16]  Steffen Rendle,et al.  Improving pairwise learning for item recommendation from implicit feedback , 2014, WSDM.

[17]  F. Maxwell Harper,et al.  Crowd-Based Personalized Natural Language Explanations for Recommendations , 2016, RecSys.

[18]  Zhe Gan,et al.  Variational Autoencoder for Deep Learning of Images, Labels and Captions , 2016, NIPS.

[19]  Rong Pan,et al.  Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering , 2009, KDD.

[20]  Julian J. McAuley,et al.  Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filtering , 2016, WWW.

[21]  Gediminas Adomavicius,et al.  Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions , 2005, IEEE Transactions on Knowledge and Data Engineering.

[22]  Ruslan Salakhutdinov,et al.  Probabilistic Matrix Factorization , 2007, NIPS.

[23]  Dongwon Lee,et al.  “Told you i didn't like it”: Exploiting uninteresting items for effective collaborative filtering , 2016, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).

[24]  James She,et al.  Collaborative Variational Autoencoder for Recommender Systems , 2017, KDD.

[25]  Christos Faloutsos,et al.  PIN-TRUST: Fast Trust Propagation Exploiting Positive, Implicit, and Negative Information , 2016, CIKM.

[26]  Li Chen,et al.  Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence GBPR: Group Preference Based Bayesian Personalized Ranking for One-Class Collaborative Filtering , 2022 .

[27]  ChengXiang Zhai,et al.  Improving one-class collaborative filtering by incorporating rich user information , 2010, CIKM.

[28]  Jun Zhang,et al.  The efficient imputation method for neighborhood-based collaborative filtering , 2012, CIKM.

[29]  Tommi S. Jaakkola,et al.  Weighted Low-Rank Approximations , 2003, ICML.

[30]  Dongwon Lee,et al.  gOCCF: Graph-Theoretic One-Class Collaborative Filtering Based on Uninteresting Items , 2018, AAAI.

[31]  Barry Smyth,et al.  Harnessing Crowdsourced Recommendation Preference Data from Casual Gameplay , 2016, UMAP.

[32]  Sunju Park,et al.  A Graph-Based Recommendation Framework for Price-Comparison Services , 2015, WWW.

[33]  Jiwon Hong,et al.  Alleviating the Sparsity in Collaborative Filtering using Crowdsourcing ∗ , 2013 .

[34]  Michael R. Lyu,et al.  Effective missing data prediction for collaborative filtering , 2007, SIGIR.

[35]  Qiang Yang,et al.  One-Class Collaborative Filtering , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[36]  Ho Jin Choi,et al.  Exploiting trustors as well as trustees in trust-based recommendation , 2013, CIKM.

[37]  Sang-Chul Lee,et al.  On identifying k-nearest neighbors in neighborhood models for efficient and effective collaborative filtering , 2018, Neurocomputing.

[38]  Jun Zhang,et al.  AdaM: Adaptive-Maximum imputation for neighborhood-based collaborative filtering , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[39]  Sunju Park,et al.  A Single-Step Approach to Recommendation Diversification , 2017, WWW.

[40]  Sang-Wook Kim,et al.  Efficient recommendation methods using category experts for a large dataset , 2016, Inf. Fusion.

[41]  Feng Xu,et al.  Dual-Regularized One-Class Collaborative Filtering , 2014, CIKM.

[42]  Jianying Hu,et al.  One-Class Matrix Completion with Low-Density Factorizations , 2010, 2010 IEEE International Conference on Data Mining.

[43]  Lars Schmidt-Thieme,et al.  BPR: Bayesian Personalized Ranking from Implicit Feedback , 2009, UAI.

[44]  Yehuda Koren,et al.  Factorization meets the neighborhood: a multifaceted collaborative filtering model , 2008, KDD.