Sparse latent model with dual graph regularization for collaborative filtering

被引:5
作者
Feng, Xiaodong [1 ]
Wu, Sen [2 ]
Tang, Zhiwei [1 ]
Li, Zhichao [1 ]
机构
[1] Univ Elect Sci & Technol China, Sch Publ Adm, Chengdu 611731, Sichuan, Peoples R China
[2] Univ Sci & Technol Beijing, Donlinks Sch Econ & Management, Beijing 100083, Peoples R China
基金
中国国家自然科学基金;
关键词
Collaborative flittering; Matrix factorization; Sparse representation; Graph Laplacian; Iterative optimization; ALGORITHMS; RECOMMENDATION;
D O I
10.1016/j.neucom.2018.01.011
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Matrix factorization (MF) has been one of the powerful machine learning techniques for collaborative flittering, and it is also widely extended to improve the quality for various tasks. For recommendation tasks, it is noting that a single user or item is actually shown to be sparsely correlated with latent factors extracted by MF, which has not been developed in existing works. Thus, we are focusing on levering sparse representation, as a successful feature learning schema for high dimensional data, into latent factor model. We propose a Sparse LAtent Model (SLAM) based on the ideas of sparse representation and matrix factorization. In SLAM, the item and user representation vectors in the latent space are expected to be sparse, induced by the l(1)-regularization on those vectors. Besides, we extend a dual graph Lapalacian regularization term to simultaneously integrate both user network and item network knowledge. Also, an iterative optimization method is presented to solve the new learning problem. The experiments on real datasets show that SLAM can predict the user-item ratings better than the state-of-the-art matrix factorization based methods. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:128 / 137
页数:10
相关论文
共 37 条
  • [1] Agarwal D, 2009, KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P19
  • [2] [Anonymous], 2011, P WSDM 11 P 4 ACM IN
  • [3] [Anonymous], 2008, P 17 ACM C INF KNOWL
  • [4] [Anonymous], 2013, P INT JOINT C ART IN
  • [5] [Anonymous], 2017, IEEE T POWER SYST
  • [6] Breese J. S., 1998, Uncertainty in Artificial Intelligence. Proceedings of the Fourteenth Conference (1998), P43
  • [7] Item-based top-N recommendation algorithms
    Deshpande, M
    Karypis, G
    [J]. ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2004, 22 (01) : 143 - 177
  • [8] Multi-Hypergraph Consistent Sparse Coding
    Feng, Xiaodong
    Wu, Sen
    Zhou, Wenjun
    [J]. ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2017, 8 (06)
  • [9] Social network regularized Sparse Linear Model for Top-N recommendation
    Feng, Xiaodong
    Sharma, Ankit
    Srivastava, Jaideep
    Wu, Sen
    Tang, Zhiwei
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2016, 51 : 5 - 15
  • [10] Laplacian Sparse Coding, Hypergraph Laplacian Sparse Coding, and Applications
    Gao, Shenghua
    Tsang, Ivor Wai-Hung
    Chia, Liang-Tien
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (01) : 92 - 104