Skip to main content

Advertisement

Springer Nature Link
Log in

A review on matrix completion for recommender systems

  • Survey Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

Recommender systems that predict the preference of users have attracted more and more attention in decades. One of the most popular methods in this field is collaborative filtering, which employs explicit or implicit feedback to model the user–item connections. Most methods of collaborative filtering are based on matrix completion techniques which recover the missing values of user–item interaction matrices. The low-rank assumption is a critical premise for matrix completion in recommender systems, which speculates that most information in interaction matrices is redundant. Based on this assumption, a large number of methods have been developed, including matrix factorization models, rank optimization models, and frameworks based on neural networks. In this paper, we first provide a brief description of recommender systems based on matrix completion. Next, several classical and state-of-the-art algorithms related to matrix completion for collaborative filtering are introduced, most of which are based on the assumption of low-rank property. Moreover, the performance of these algorithms is evaluated and discussed by conducting substantial experiments on different real-world datasets. Finally, we provide open research issues for future exploration of matrix completion on recommender systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. https://www.librec.net/datasets.html.

  2. https://grouplens.org/datasets/movielens/.

  3. https://www.kaggle.com/netflix-inc/netflix-prize-data.

  4. http://www.trustlet.org/wiki/Epinions_dataset.

  5. https://goldberg.berkeley.edu/jester-data/.

References

  1. Batmaz Z, Yurekli A, Bilge A, Kaleli C (2019) A review on deep learning for recommender systems: challenges and remedies. Artif Intell Rev 52(1):1–37

    Article  Google Scholar 

  2. Sun Y, Guo G, Chen X, Zhang P, Wang X (2020) Exploiting review embedding and user attention for item recommendation. Knowl Inform Syst 1–24

  3. Hashemi SM, Rahmati M (2020) Cross-domain recommender system using generalized canonical correlation analysis. Knowl Inf Syst 62(12):4625–4651

    Article  Google Scholar 

  4. Papagelis M, Plexousakis D, Kutsuras T (2005) Alleviating the sparsity problem of collaborative filtering using trust inferences. Trust Manag 224–239

  5. Martinez L, Rodriguez RM, Espinilla M, Reja (2009) A georeferenced hybrid recommender system for restaurants, in: Proceedings of the 2009 IEEE/WIC/ACM international joint conference on web intelligence and intelligent agent technology, pp 187–190

  6. Singh M (2020) Scalability and sparsity issues in recommender datasets: a survey. Knowl Inf Syst 62(1):1–43

    Article  Google Scholar 

  7. Huang Z, Chen H, Zeng D (2004) Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering. ACM Trans Inf Syst 22(1):116–142

    Article  Google Scholar 

  8. Moshfeghi Y, Piwowarski B, Jose JM (2011) Handling data sparsity in collaborative filtering using emotion and semantic based features. In: Proceedings of the 34th international ACM SIGIR conference on research and development in information retrieval, pp 625–634

  9. Li B, Yang Q, Xue X (2009) Can movies and books collaborate? Cross-domain collaborative filtering for sparsity reduction. In: Proceedings of the 21th international joint conference on artificial intelligence, vol 9, pp 2052–2057

  10. Raza S, Ding C (2019) Progress in context-aware recommender systems–an overview. Comput Sci Rev 31:84–97

    Article  MathSciNet  Google Scholar 

  11. Palomares I, Browne F, Davis P (2018) Multi-view fuzzy information fusion in collaborative filtering recommender systems: application to the urban resilience domain. Data Knowl Eng 113:64–80

    Article  Google Scholar 

  12. Koren Y, Bell R, Volinsky C (2009) Matrix factorization techniques for recommender systems. Computer 42(8):30–37

    Article  Google Scholar 

  13. Miller BN, Konstan JA, Riedl J (2004) Pocketlens: toward a personal recommender system. ACM Trans Inf Syst 22(3):437–476

    Article  Google Scholar 

  14. Champiri ZD, Asemi A, Binti SSS (2019) Meta-analysis of evaluation methods and metrics used in context-aware scholarly recommender systems. Knowl Inf Syst 61(2):1147–1178

    Article  Google Scholar 

  15. Kulkarni S, Rodd SF (2020) Context aware recommendation systems: a review of the state of the art techniques. Comput Sci Rev 37:100255

    Article  MathSciNet  Google Scholar 

  16. Shokeen J, Rana C (2020) A study on features of social recommender systems. Artif Intell Rev 53(2):965–988

    Article  Google Scholar 

  17. Khan ZY, Niu Z, Sandiwarno S, Prince R (2020) Deep learning techniques for rating prediction: a survey of the state-of-the-art. Artif Intell Rev 1–41

  18. Elahi M, Ricci F, Rubens N (2016) A survey of active learning in collaborative filtering recommender systems. Comput Sci Rev 20:29–50

    Article  MathSciNet  MATH  Google Scholar 

  19. Coba L, Symeonidis P, Zanker M (2019) Personalised novel and explainable matrix factorisation. Data Knowl Eng 122:142–158

    Article  Google Scholar 

  20. Si M, Li Q (2020) Shilling attacks against collaborative recommender systems: a review. Artif Intell Rev 53(1):291–319

    Article  MathSciNet  Google Scholar 

  21. Ali Z, Qi G, Kefalas P, Abro WA, Ali B (2020) A graph-based taxonomy of citation recommendation models. Artif Intell Rev 1–44

  22. Dax A (2014) Imputing missing entries of a data matrix: a review. J Adv Comput 3(3):98–222

    Google Scholar 

  23. Gurini DF, Gasparetti F, Micarelli A, Sansonetti G (2018) Temporal people-to-people recommendation on social networks with sentiment-based matrix factorization. Futur Gener Comput Syst 78:430–439

    Article  Google Scholar 

  24. Nguyen LT, Kim J, Shim B (2019) Low-rank matrix completion: a contemporary survey. IEEE Access 7:94215–94237

    Article  Google Scholar 

  25. Chen Z, Zhao W, Wang S (2021) Kernel meets recommender systems: a multi-kernel interpolation for matrix completion. Expert Syst Appl 168:114436

    Article  Google Scholar 

  26. Wang Y, Zhang Y (2013) Nonnegative matrix factorization: a comprehensive review. IEEE Trans Knowl Data Eng 25(6):1336–1353

    Article  MathSciNet  Google Scholar 

  27. Da’u A, Salim N (2019) Recommendation system based on deep learning methods: a systematic review and new directions. Artif Intell Rev 1–40

  28. Cheng H-T, Koc L, Harmsen J, Shaked T, Chandra T, Aradhye H, Anderson G, Corrado G, Chai W, Ispir M, et al. (2016) Wide & deep learning for recommender systems. In: Proceedings of the 1st workshop on deep learning for recommender systems, pp 7–10

  29. Covington P, Adams J, Sargin E (2016) Deep neural networks for youtube recommendations. In: Proceedings of the 10th ACM conference on recommender systems, pp 191–198

  30. He X, Liao L, Zhang H, Nie L, Hu X, Chua T-S (2017) Neural collaborative filtering. In: Proceedings of the 26th international conference on World Wide Web, pp 173–182

  31. Gu Q, Trzasko JD, Banerjee A (2019) Scalable algorithms for locally low-rank matrix modeling. Knowl Inf Syst 61(3):1457–1484

    Article  Google Scholar 

  32. Nie F, Huang H, Ding CHQ (2012) Low-rank matrix recovery via efficient schatten p-norm minimization. In: Proceedings of the 26th AAAI conference on artificial intelligence

  33. Shijila B, Tom AJ, George SN (2019) Simultaneous denoising and moving object detection using low rank approximation. Futur Gener Comput Syst 90:198–210

    Article  Google Scholar 

  34. Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788

    Article  MATH  Google Scholar 

  35. Lee DD, Seung HS (1997) Unsupervised learning by convex and conic coding. In: Advances in neural information processing systems, pp 515–521

  36. Fu L, Chen Z, Huang S, Huang S, Wang S (2021) Multi-view learning via low-rank tensor optimization. In: Proceedings of the 2021 IEEE international conference on multimedia and expo, pp 1–6

  37. Chen J, Fang J, Liu W, Tang T, Yang C (2020) clmf: A fine-grained and portable alternating least squares algorithm for parallel matrix factorization. Futur Gener Comput Syst 108:1192–1205

    Article  Google Scholar 

  38. Cai J-F, Candès EJ, Shen Z (2010) A singular value thresholding algorithm for matrix completion. SIAM J Optim 20(4):1956–1982

    Article  MathSciNet  MATH  Google Scholar 

  39. Wright J, Ganesh A, Rao SR, Peng Y, Ma Y (2009) Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization. In: Proceedings of the 23rd annual conference on neural information processing systems 2009, pp 2080–2088

  40. Shang F, Cheng J, Liu Y, Luo Z, Lin Z (2018) Bilinear factor matrix norm minimization for robust PCA: algorithms and applications. IEEE Trans Pattern Anal Mach Intell 40(9):2066–2080

    Article  Google Scholar 

  41. Paatero P (1997) Least squares formulation of robust non-negative factor analysis. Chemom Intell Lab Syst 37(1):23–35

    Article  Google Scholar 

  42. Kivinen J, Warmuth MK (1995) Additive versus exponentiated gradient updates for linear prediction. In: ACM Press the 27th annual ACM symposium, pp 209–218

  43. Benesty J, Chen J, Huang Y, Cohen I (2009) Pearson correlation coefficient. In: Noise reduction in speech processing, pp 1–4

  44. Koren Y (2008) Factorization meets the neighborhood: A multifaceted collaborative filtering model. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 426–434

  45. Mnih A, Salakhutdinov RR (2008) Probabilistic matrix factorization. In: Advances in neural information processing systems, pp 1257–1264

  46. Bell RM, Koren Y (2007) Lessons from the netflix prize challenge. ACM SIGKDD Explorations Newsl 9(2):75–79

    Article  Google Scholar 

  47. Ning X, Karypis G (2011) Slim: Sparse linear methods for top-n recommender systems. In: 2011 11th IEEE international conference on data mining, pp 497–506

  48. Kabbur S, Ning X, Karypis G (2013) Fism: Factored item similarity models for top-n recommender systems. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining, pp 659–667

  49. Saad D (1998) Online algorithms and stochastic approximations, Online. Learning 5:3–6

    Google Scholar 

  50. Lee J, Kim S, Lebanon G, Singer Y (2013) Local low-rank matrix approximation. In: Proceedings of the 30th international conference on machine learning, vol 28, pp 82–90

  51. Wand MP, Jones MC (1995) Kernel smoothing

  52. Bian J, Gao B, Liu T-Y (2014) Knowledge-powered deep learning for word embedding. In: Proceedings of the joint European conference on machine learning and knowledge discovery in databases, pp 132–148

  53. Shin B, Yang H, Choi JD (2019) The pupil has become the master: Teacher-student model-based word embedding distillation with ensemble learning. In: Proceedings of the 28th international joint conference on artificial intelligence, pp 3439–3445

  54. Zhou T, Sedoc J, Rodu J (2019) Getting in shape: Word embedding subspaces. In: Proceedings of the 28th international joint conference on artificial intelligence, pp 5478–5484

  55. Mikolov T, Sutskever I, Chen K, Corrado GS, Dean J (2013) Distributed representations of words and phrases and their compositionality. In: Advances in neural information processing systems, pp 3111–3119

  56. Liang D, Altosaar J, Charlin L, Blei DM (2016) Factorization meets the item embedding: Regularizing matrix factorization with item co-occurrence. In: Proceedings of the 10th ACM conference on recommender systems, pp 59–66

  57. Church KW, Hanks P (1990) Word association norms, mutual information, and lexicography. Comput Linguist 16(1):22–29

    Google Scholar 

  58. Levy O, Goldberg Y (2014) Neural word embedding as implicit matrix factorization. In: Advances in neural information processing systems, pp 2177–2185

  59. Liou C, Cheng W, Liou J, Liou D (2014) Autoencoder for words. Neurocomputing 139:84–96

    Article  MATH  Google Scholar 

  60. Ap SC, Lauly S, Larochelle H, Khapra M, Ravindran B, Raykar VC, Saha A (2014) An autoencoder approach to learning bilingual word representations. In: Advances in neural information processing systems, pp 1853–1861

  61. Socher R, Huang EH, Pennin J, Manning CD, Ng AY (2011) Dynamic pooling and unfolding recursive autoencoders for paraphrase detection. In: Advances in neural information processing systems, pp 801–809

  62. Zhang J, Shan S, Kan M, Chen X (2014) Coarse-to-fine auto-encoder networks (cfan) for real-time face alignment, in. Eur Conf Comput Vis 8690:1–16

    Google Scholar 

  63. Walker J, Doersch C, Gupta A, Hebert M (2016) An uncertain future: forecasting from static images using variational autoencoders, in. Eur Conf Comput Vis 9911:835–851

    Google Scholar 

  64. Tewari A, Zollhofer M, Kim H, Garrido P, Bernard F, Perez P, Theobalt C (2017) Mofa: Model-based deep convolutional face autoencoder for unsupervised monocular reconstruction. In: Proceedings of the IEEE international conference on computer vision, pp 3715–3724

  65. Sedhain S, Menon AK, Sanner S, Xie L (2015) Autorec: autoencoders meet collaborative filtering. In: Proceedings of the 24th international conference on World Wide Web, pp 111–112

  66. Wu Y, DuBois C, Zheng AX, Ester M (2016) Collaborative denoising auto-encoders for top-n recommender systems, in: Proceedings of the 9th ACM international conference on Web Search and Data Mining, pp 153–162

  67. Pan Y, He F, Yu H (2020) A correlative denoising autoencoder to model social influence for top-n recommender system. Front Comp Sci 14(3):143301

    Article  Google Scholar 

  68. Wang H, Shi X, Yeung D-Y (2015) Relational stacked denoising autoencoder for tag recommendation. In: Proceedings of the 29th AAAI conference on artificial intelligence, pp 3052–3058

  69. Ishii T, Komiyama H, Shinozaki T, Horiuchi Y, Kuroiwa S (2013) Reverberant speech recognition based on denoising autoencoder. In: Interspeech, pp 3512–3516

  70. Vincent P, Larochelle H, Bengio Y, Manzagol P-A (2008) Extracting and composing robust features with denoising autoencoders. In: Proceedings of the 25th international conference on machine learning, pp 1096–1103

  71. Duchi J, Hazan E, Singer Y (2011) Adaptive subgradient methods for online learning and stochastic optimization. J Mach Learn Res 12(Jul):2121–2159

    MathSciNet  MATH  Google Scholar 

  72. Xue H, Dai X, Zhang J, Huang S, Chen J (2017) Deep matrix factorization models for recommender systems. In: Proceedings of the 26th international joint conference on artificial intelligence, pp 3203–3209

  73. Zheng L, Lu C-T, Jiang F, Zhang J, Yu PS (2018) Spectral collaborative filtering. In: Proceedings of the 12th ACM conference on recommender systems, pp 311–319

  74. Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: Proceedings of the 5th international conference on learning representations

  75. Berg Rvd, Kipf TN, Welling M (2017) Graph convolutional matrix completion, arXiv preprint arXiv:1706.02263

  76. Monti F, Bronstein MM, Bresson X (2017) Geometric matrix completion with recurrent multi-graph neural networks. In: Advances in neural information processing systems, pp 3697–3707

  77. Wang X, He X, Wang M, Feng F, Chua T-S (2019) Neural graph collaborative filtering. In: Proceedings of the 42nd international ACM SIGIR conference on research and development in information retrieval, pp 165–174

  78. Frank LE, Friedman JH (1993) A statistical view of some chemometrics regression tools. Technometrics 35(2):109–135

    Article  MATH  Google Scholar 

  79. Friedman JH (2012) Fast sparse regression and classification. Int J Forecast 28(3):722–738

    Article  Google Scholar 

  80. Geman D, Yang C (1995) Nonlinear image recovery with half-quadratic regularization. IEEE Trans Image Process 4(7):932–946

    Article  Google Scholar 

  81. Trzasko JD, Manduca A (2009) Highly undersampled magnetic resonance image reconstruction via homotopic \(\ell _{0}\) -minimization. IEEE Trans Med Imaging 28(1):106–121

    Article  Google Scholar 

  82. Gao C, Wang N, Yu QR, Zhang Z (2011) A feasible nonconvex relaxation approach to feature selection. In: Proceedings of the 25th AAAI conference on artificial intelligence, pp 356–361

  83. Border K (2001) The supergradient of a concave function, http://www.hss.caltech.edu/-kcb/Notes/Supergrad.pdf

  84. Lu C, Tang J, Yan S, Lin Z (2014) Generalized nonconvex nonsmooth low-rank minimization. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 4130–4137

  85. Zhang H, Gong C, Qian J, Zhang B, Xu C, Yang J (2019) Efficient recovery of low-rank matrix via double nonconvex nonsmooth rank minimization. IEEE Trans Neural Netw Learn Syst 30(10):2916–2925

    Article  MathSciNet  Google Scholar 

  86. Zhang H, Yang J, Shang F, Gong C, Zhang Z (2018) Lrr for subspace segmentation via tractable schatten-\( p \) norm minimization and factorization. IEEE Trans Cybern 49(5):1722–1734

    Article  Google Scholar 

  87. Cao W, Sun J, Xu Z (2013) Fast image deconvolution using closed-form thresholding formulas of lq (q = 1/2, 2/3) regularization. J Vis Commun Image Represent 24(1):31–41

    Article  Google Scholar 

  88. Luo L, Yang J, Qian J, Tai Y, Lu G-F (2016) Robust image regression based on the extended matrix variate power exponential distribution of dependent noise. IEEE Trans Neural Netw Learn Syst 28(9):2168–2182

    Article  MathSciNet  Google Scholar 

  89. Xu C, Lin Z, Zha H (2017) A unified convex surrogate for the schatten-p norm. In: Proceedings of the thirty-First AAAI conference on artificial intelligence, pp 926–932

  90. Srebro N, Rennie JDM, Jaakkola TS (2004) Maximum-margin matrix factorization. Adv Neural Inf Process Syst 17:1329–1336

    Google Scholar 

  91. Shang F, Liu Y, Cheng J (2016) Scalable algorithms for tractable schatten quasi-norm minimization. In: Proceedings of the 30th AAAI conference on artificial intelligence, pp 2016–2022

  92. Shang F, Liu Y, Cheng J (2016) Tractable and scalable schatten quasi-norm approximations for rank minimization. In: Proceedings of the 19th international conference on artificial intelligence and statistics, vol 51, pp 620–629

  93. Bolte J, Sabach S, Teboulle M (2014) Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math Program 146(1–2):459–494

    Article  MathSciNet  MATH  Google Scholar 

  94. Xu Y, Yin W (2013) A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J Imag Sci 6(3):1758–1789

    Article  MathSciNet  MATH  Google Scholar 

  95. Zhang H, Qian J, Zhang B, Yang J, Gong C, Wei Y (2020) Low-rank matrix recovery via modified schatten-\(p\) norm minimization with convergence guarantees. IEEE Trans Image Process 29:3132–3142

    Article  MathSciNet  Google Scholar 

  96. Willmott CJ, Matsuura K (2005) Advantages of the mean absolute error (mae) over the root mean square error (rmse) in assessing average model performance. Climate Res 30(1):79–82

    Article  Google Scholar 

  97. Järvelin K, Kekäläinen J (2002) Cumulated gain-based evaluation of ir techniques. ACM Trans Inf Syst 20(4):422–446

    Article  Google Scholar 

  98. Powers DM (2011) Evaluation: from precision, recall and f-measure to roc, informedness, markedness and correlation. J Mach Learn Technol 2(1):37–63

    MathSciNet  Google Scholar 

  99. Baltrunas L, Ludwig B, Ricci F (2011) Matrix factorization techniques for context aware recommendation. In: Proceedings of the ACM conference on recommender systems, pp 301–304

  100. Hidasi B, Tikk D (2016) General factorization framework for context-aware recommendations. Data Min Knowl Disc 30(2):342–371

    Article  MathSciNet  Google Scholar 

  101. Unger M, Bar A, Shapira B, Rokach L (2016) Towards latent context-aware recommendation systems. Knowl Based Syst 104:165–178

    Article  Google Scholar 

  102. Rendle S, Freudenthaler C, Schmidt-Thieme L (2010) Factorizing personalized Markov chains for next-basket recommendation. In: Proceedings of the 19th international conference on World Wide Web, pp 811–820

  103. Yu H, Hsieh C, Si S, Dhillon IS (2014) Parallel matrix factorization for recommender systems. Knowl Inf Syst 41(3):793–819

    Article  Google Scholar 

  104. Wu H, Zhang Z, Yue K, Zhang B, He J, Sun L (2018) Dual-regularized matrix factorization with deep neural networks for recommender systems. Knowl Based Syst 145:46–58

    Article  Google Scholar 

  105. Zhang S, Yao L, Sun A, Tay Y (2019) Deep learning based recommender system: a survey and new perspectives. ACM Comput Surv 52(1):5:1–5:38

  106. Dacrema MF, Cremonesi P, Jannach D (2019) Are we really making much progress? A worrying analysis of recent neural recommendation approaches. In: Proceedings of the 13th ACM conference on recommender systems, pp 101–109

  107. Wang S, Chen Z, Du S, Lin Z (2021) Learning deep sparse regularizers with applications to multi-view clustering and semi-supervised classification. IEEE Trans Pattern Anal Mach Intell. https://doi.org/10.1109/TPAMI.2021.3082632

  108. Xie X, Wu J, Liu G, Zhong Z, Lin Z (2019) Differentiable linearized ADMM. In: Proceedings of the 26th international conference on machine learning, pp 6902–6911

  109. Yang Y, Sun J, Li H, Z. (2016) Xu, Deep admm-net for compressive sensing MRI. In: Advances in neural information processing systems, pp 10–18

  110. Gregor K, LeCun Y (2010) Learning fast approximations of sparse coding. In: Proceedings of the twenty-seventh international conference on machine learning, pp. 399–406

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Grant no. U1705262) and Natural Science Foundation of Fujian Province (Grant nos. 2020J01130193 and 2018J07005).

Author information

Authors and Affiliations

  1. College of Computer and Data Science, Fuzhou University, Fuzhou, 350116, China

    Zhaoliang Chen & Shiping Wang

  2. Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing, Fuzhou University, Fuzhou, 350116, China

    Zhaoliang Chen & Shiping Wang

Authors
  1. Zhaoliang Chen
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Shiping Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Shiping Wang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, Z., Wang, S. A review on matrix completion for recommender systems. Knowl Inf Syst 64, 1–34 (2022). https://doi.org/10.1007/s10115-021-01629-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-021-01629-6

Keywords