Social network regularized Sparse Linear Model for Top-N recommendation

被引:15
|
作者
Feng, Xiaodong [1 ]
Sharma, Ankit [3 ]
Srivastava, Jaideep [3 ]
Wu, Sen [2 ]
Tang, Zhiwei [1 ]
机构
[1] Univ Elect Sci & Technol China, Sch Polit Sci & Publ Adm, Chengdu 611731, Sichuan, Peoples R China
[2] Univ Sci & Technol Beijing, Donlinks Sch Econ & Management, Beijing 100083, Peoples R China
[3] Univ Minnesota Twin Cities, Dept Comp Sci & Engn, Minneapolis, MN 55455 USA
基金
中国国家自然科学基金;
关键词
Top-N recommendation; Social network; User modeling; Sparse Linear Model; Local learning;
D O I
10.1016/j.engappai.2016.01.019
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Social recommendation techniques have been developed to employ user's social connections for both rating prediction and Top-N recommendation. However, they are mostly using social network enhanced matrix factorization (MF) where the objective is to minimize the prediction error of rating scores, which makes it impractical and unsuccessful for Top-N recommendation. This paper thus focuses on developing more effective methods to utilize social network information for Top-N recommendation. Social network regularized Sparse Linear Model (SocSLIM) with its extensions incorporating local learning (LocSocSLIM) to improve efficiency are proposed. SocSLIM learns sparse coefficient matrix for users by solving a sparse representation problem over user-item rating/purchase matrix and user-user social network's adjacency matrix at the same time by sharing coefficient matrix. The coefficient matrix is used to predict the recommendation scores, which are then combined with a proposed item based Distance regularized Sparse Linear Model (DSLIM) to generate recommendations for the users. The experimental results demonstrate that SocSLIM effectively uses the social information to outperform the state-of-the-art methods by at least 12%. Moreover, the local weight learning extension LocSocSLIM significantly improves the efficiency up to 10 times as compared to SocSLIM as the original SLIM while achieving the close performance guarantees. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:5 / 15
页数:11
相关论文
共 50 条
  • [1] Recurrent Translation-Based Network for Top-N Sparse Sequential Recommendation
    Chairatanakul, Nuttapong
    Murata, Tsuyoshi
    Liu, Xin
    [J]. IEEE ACCESS, 2019, 7 : 131567 - 131576
  • [2] SoGeM: Social Based Generative Model for Top-N Recommendation
    Yin, Litian
    Wang, Dong
    Xin, Xin
    Ding, Yue
    [J]. 2017 IEEE 29TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2017), 2017, : 802 - 806
  • [3] A Factored Similarity Model with Trust and Social Influence for Top-N Recommendation
    Zhang, X. F.
    Chen, X. L.
    Seng, D. W.
    Fang, X. J.
    [J]. INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2019, 14 (04) : 590 - 607
  • [4] Top-N Recommendation Model Based on SDAE
    Bao, Rui
    Sun, Yipin
    [J]. 2018 INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SCIENCE AND APPLICATION TECHNOLOGY, 2019, 1168
  • [5] Top-N recommendation algorithm integrated neural network
    Zhang, Liang
    [J]. NEURAL COMPUTING & APPLICATIONS, 2021, 33 (09): : 3881 - 3889
  • [6] Top-N recommendation algorithm integrated neural network
    Liang Zhang
    Liang Zhang
    [J]. Neural Computing and Applications, 2021, 33 : 3881 - 3889
  • [7] Top-N Recommendation on Graphs
    Kang, Zhao
    Peng, Chong
    Yang, Ming
    Cheng, Qiang
    [J]. CIKM'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2016, : 2101 - 2106
  • [8] GTRM: A Top-N Recommendation Model for Smartphone Applications
    Zhu, Nengjun
    Cao, Jian
    [J]. 2017 IEEE 24TH INTERNATIONAL CONFERENCE ON WEB SERVICES (ICWS 2017), 2017, : 309 - 316
  • [9] A Semi-Supervised Model for Top-N Recommendation
    Chen, Shulong
    Peng, Yuxing
    [J]. SYMMETRY-BASEL, 2018, 10 (10):
  • [10] Joint Collaborative Ranking with Social Relationships in Top-N Recommendation
    Rafailidis, Dimitrios
    Crestani, Fabio
    [J]. CIKM'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2016, : 1393 - 1402