Matrix factorization for recommendation with explicit and implicit feedback

被引:58
|
作者
Chen, Shulong [1 ]
Peng, Yuxing [1 ]
机构
[1] Natl Univ Def Technol, Sci & Technol Parallel & Distributed Lab, Coll Comp, Changsha 410073, Hunan, Peoples R China
关键词
Collaborative filtering; Probabilistic matrix factorization; Matrix co-factorization; Implicit feedback;
D O I
10.1016/j.knosys.2018.05.040
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Matrix factorization (MF) methods have proven as efficient and scalable approaches for collaborative filtering problems. Numerous existing MF methods rely heavily on explicit feedback. Typically, these data types may be extremely sparse; therefore, these methods can perform poorly. In order to address these challenges, we propose a latent factor model based on probabilistic MF, by incorporating implicit feedback as complementary information. Specifically, the explicit and implicit feedback matrices are decomposed into a shared subspace simultaneously. Then, the latent factor vectors are jointly optimized using a gradient descent algorithm. The experimental results using the MovieLens datasets demonstrate that the proposed algorithm outperforms the baselines.
引用
收藏
页码:109 / 117
页数:9
相关论文
共 50 条
  • [1] Recommendation algorithm based on Explicit and Implicit feedback Matrix factorization
    Xiao Xiaoli
    Yan Rongjun
    Tan Dong
    [J]. 2019 4TH INTERNATIONAL CONFERENCE ON MECHANICAL, CONTROL AND COMPUTER ENGINEERING (ICMCCE 2019), 2019, : 903 - 909
  • [2] Explicit feedback meet with implicit feedback in GPMF: a generalized probabilistic matrix factorization model for recommendation
    Mandal, Supriyo
    Maiti, Abyayananda
    [J]. APPLIED INTELLIGENCE, 2020, 50 (06) : 1955 - 1978
  • [3] Explicit feedback meet with implicit feedback in GPMF: a generalized probabilistic matrix factorization model for recommendation
    Supriyo Mandal
    Abyayananda Maiti
    [J]. Applied Intelligence, 2020, 50 : 1955 - 1978
  • [4] Correlated Matrix Factorization for Recommendation with Implicit Feedback
    He, Yuan
    Wang, Cheng
    Jiang, Changjun
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2019, 31 (03) : 451 - 464
  • [5] Neural Matrix Factorization Recommendation for User Preference Prediction Based on Explicit and Implicit Feedback
    Liu, Huazhen
    Wang, Wei
    Zhang, Yihan
    Gu, Renqian
    Hao, Yaqi
    [J]. Computational Intelligence and Neuroscience, 2022, 2022
  • [6] Neural Matrix Factorization Recommendation for User Preference Prediction Based on Explicit and Implicit Feedback
    Liu, Huazhen
    Wang, Wei
    Zhang, Yihan
    Gu, Renqian
    Hao, Yaqi
    [J]. COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2022, 2022
  • [7] Fast Matrix Factorization for Online Recommendation with Implicit Feedback
    He, Xiangnan
    Zhang, Hanwang
    Kan, Min-Yen
    Chua, Tat-Seng
    [J]. SIGIR'16: PROCEEDINGS OF THE 39TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2016, : 549 - 558
  • [8] Fast Adaptively Weighted Matrix Factorization for Recommendation with Implicit Feedback
    Chen, Jiawei
    Wang, Can
    Zhou, Sheng
    Shi, Qihao
    Chen, Jingbang
    Feng, Yan
    Chen, Chun
    [J]. THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 3470 - 3477
  • [9] Dynamic Bayesian Logistic Matrix Factorization for Recommendation with Implicit Feedback
    Liu, Yong
    Zhao, Lifan
    Liu, Guimei
    Lu, Xinyan
    Gao, Peng
    Li, Xiao-Li
    Jin, Zhihui
    [J]. PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 3463 - 3469
  • [10] Deep Matrix Factorization With Implicit Feedback Embedding for Recommendation System
    Yi, Baolin
    Shen, Xiaoxuan
    Liu, Hai
    Zhang, Zhaoli
    Zhang, Wei
    Liu, Sannyuya
    Xiong, Naixue
    [J]. IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2019, 15 (08) : 4591 - 4601