Attention-based Regularized Matrix Factorization for Recommendation
Author:
Affiliation:

Clc Number:

Fund Project:

National Key Research and Development Program of China (2018YFB1700404); National Natural Science Foundation of China (U1736104, 61572122, 61532021); Fundamental Research Funds for the Central Universities (N171602003)

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In recent years, matrix factorization (MF) has been exploited commonly in recommender system because of its capability and simplification. However, data sparsity and cold-start problems make the latent feature of users learned by MF cannot represent the users' preferences and the similarity relation among users exactly, which limits the performance of MF. To remedy it, the regularized matrix factorization (RMF) draws researchers' attention. And the problem demanding prompt solution in RMF is capturing the reliable similarity relation among users. Besides, MF simply regards the inner product between the latent features of both target user and target item as the score that target user may rate the target item, ignoring the user's different attentions on various features of the item. How to analyze the user's attention on item's features and capture more accurate preference of the user is still a challenge. To address these issues, a model is put forward named attention-based regularized matrix factorization, abbreviated as ARMF. Specifically, to settle the problems of data sparsity and cold-start and obtain reliable similar relationships among users, the model builds a user-item heterogeneous network according to the social network and the rating record, and the similarities among users can be obtained based on it. Incorporating attention mechanism into MF allows us to analyze the attention of users on different item's features and capture moreaccurate preferences of users, which improves the precision of MF further. At last, the proposed model is compared with the state-of-the-art models on two real-world datasets and the result demonstrates the better precision and robustness of ARMF.

    Reference
    Related
    Cited by
Get Citation

张青博,王斌,崔宁宁,宋晓旭,秦婧.基于注意力机制的规范化矩阵分解推荐算法.软件学报,2020,31(3):778-793

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:August 13,2019
  • Revised:September 10,2019
  • Adopted:
  • Online: January 10,2020
  • Published: March 06,2020
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063