Top-N Recommendation based on Mutual Trust and Influence

被引:2
|
作者
Seng, D. W. [1 ]
Liu, J. X. [1 ]
Zhang, X. F. [1 ]
Chen, J. [1 ]
Fang, X. J. [1 ]
机构
[1] Hangzhou Dianzi Univ, Sch Comp Sci & Technol, Hangzhou 310018, Zhejiang, Peoples R China
基金
美国国家科学基金会;
关键词
mutual trust; mutual influence; social recommendation system; cold start; data sparsity;
D O I
10.15837/ijccc.2019.4.3578
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To improve recommendation quality, the existing trust-based recommendation methods often directly use the binary trust relationship of social networks, and rarely consider the difference and potential influence of trust strength among users. To make up for the gap, this paper puts forward a hybrid top-N recommendation algorithm that combines mutual trust and influence. Firstly, a new trust measurement method was developed based on dynamic weight, considering the difference of trust strength between users. Secondly, a new mutual influence measurement model was designed based on trust relationship, in light of the social network topology. Finally, two hybrid recommendation algorithms, denoted as FSTA(Factored Similarity model with Trust Approach) and FSTI(Factored similarity models with trust and influence), were presented to solve the data sparsity and binarity. The two algorithms integrate user similarity, item similarity, mutual trust and mutual influence. Our approach was compared with several other recommendation algorithms on three standard datasets: FilmTrust, Epinions and Ciao. The experimental results proved the high efficiency of our approach.
引用
收藏
页码:540 / 556
页数:17
相关论文
共 50 条
  • [1] 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
  • [2] Top-N Recommendation Model Based on SDAE
    Bao, Rui
    Sun, Yipin
    [J]. 2018 INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SCIENCE AND APPLICATION TECHNOLOGY, 2019, 1168
  • [3] 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
  • [4] Factored similarity models with social trust for top-N item recommendation
    Guo, Guibing
    Zhang, Jie
    Zhu, Feida
    Wang, Xingwei
    [J]. KNOWLEDGE-BASED SYSTEMS, 2017, 122 : 17 - 25
  • [5] Hybrid Trust-Aware Model for Personalized Top-N Recommendation
    Merchant, Arpit
    Singh, Navjyoti
    [J]. PROCEEDINGS OF THE FOURTH ACM IKDD CONFERENCES ON DATA SCIENCES (CODS '17), 2017,
  • [6] Top-N Recommendation Based on Granular Association Rules
    He, Xu
    Min, Fan
    Zhu, William
    [J]. ROUGH SETS AND KNOWLEDGE TECHNOLOGY, RSKT 2014, 2014, 8818 : 194 - 205
  • [7] Item-based top-N recommendation algorithms
    Deshpande, M
    Karypis, G
    [J]. ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2004, 22 (01) : 143 - 177
  • [8] A polynomial modeling based algorithm in top-N recommendation
    Kasap, Ozge Yucel
    Tunga, M. Alper
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2017, 79 : 313 - 321
  • [9] Collaborative Distillation for Top-N Recommendation
    Lee, Jae-woong
    Choi, Minjin
    Lee, Jongwuk
    Shim, Hyunjung
    [J]. 2019 19TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2019), 2019, : 369 - 378
  • [10] Transfer to Rank for Top-N Recommendation
    Dai, Wei
    Zhang, Qing
    Pan, Weike
    Ming, Zhong
    [J]. IEEE TRANSACTIONS ON BIG DATA, 2020, 6 (04) : 770 - 779