Merging user social network into the random walk model for better group recommendation

被引:22
|
作者
Feng, Shanshan [1 ]
Zhang, Huaxiang [1 ]
Cao, Jian [2 ]
Yao, Yan [2 ]
机构
[1] Shandong Normal Univ, Sch Informat Sci & Engn, Jinan Shi, Peoples R China
[2] Shanghai Jiao Tong Univ, Sch Elect Informat & Elect Engn, Xuhui Qu, Peoples R China
基金
中国国家自然科学基金;
关键词
Recommendation; User social network; Partitioned matrix computation;
D O I
10.1007/s10489-018-1375-z
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
At present, most recommendation approaches used to suggest appreciate items for individual users. However, due to the social nature of human beings, group activities have become an integral part of our daily life, thus the popularity of group recommender systems has increased in the last years. Unfortunately, most existing approaches used in group recommender systems make recommendations through aggregating individual preferences or individual predictive results rather than comprehensively investigating users social features that govern their choices made within a group. Therefore, we propose a new group recommendation approach, it incorporates user social network into the random walk with restart model and variously detects the inherent associations among group members, which can help us to better describe groups preference and improve the performance of group recommender systems. Besides, on the basis of multifaceted associations incorporation, we apply a partitioned matrix computation method in the recommendation process to save computational and storage costs. The final experiment results on the real-world CAMRa2011 dataset demonstrates that the proposed approach can not only effectively predict groups' preference, but also have faster performance and more stable than other baseline methods.
引用
收藏
页码:2046 / 2058
页数:13
相关论文
共 50 条
  • [1] Merging user social network into the random walk model for better group recommendation
    Shanshan Feng
    Huaxiang Zhang
    Jian Cao
    Yan Yao
    [J]. Applied Intelligence, 2019, 49 : 2046 - 2058
  • [2] Social Network Event Recommendation Algorithms Based on User Similarity Random Walk
    Ma, Tie-Min
    Zhou, Fu-Cai
    Wang, Shuang
    [J]. Dongbei Daxue Xuebao/Journal of Northeastern University, 2019, 40 (11): : 1533 - 1538
  • [3] A Random Walk Model for Item Recommendation in Social Tagging Systems
    Zhang, Zhu
    Zeng, Daniel D.
    Abbasi, Ahmed
    Peng, Jing
    Zheng, Xiaolong
    [J]. ACM TRANSACTIONS ON MANAGEMENT INFORMATION SYSTEMS, 2013, 4 (02)
  • [4] Leveraging Hypergraph Random Walk Tag Expansion and User Social Relation for Microblog Recommendation
    Ma, Huifang
    Zhang, Di
    Zhao, Weizhong
    Wang, Yanru
    Shi, Zhongzhi
    [J]. 2018 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2018, : 1158 - 1163
  • [5] SPDNA: A User Recommendation Model for Academic Social Network
    Fu, Chengzhou
    Tang, Yong
    Zeng, Weiquan
    Li, Jianguo
    [J]. 12TH CHINESE CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK AND SOCIAL COMPUTING (CHINESECSCW 2017), 2017, : 56 - 63
  • [6] Recommendation of Item Category Based on Random Walk Model
    Shi, Yilong
    Jin, Li
    Chen, Jianfeng
    Zeng, Ke
    [J]. 2019 4TH IEEE INTERNATIONAL CONFERENCE ON BIG DATA ANALYTICS (ICBDA 2019), 2019, : 226 - 230
  • [7] FBM: A flexible random walk based generative model for social network
    Xia, Hongke
    Hu, Xiang
    [J]. Open Cybernetics and Systemics Journal, 2015, 9 (01): : 280 - 287
  • [8] A Novel Travel Group Recommendation Model Based on User Trust and Social Influence
    Xu, Zhiyun
    Zheng, Xiaoyao
    Zhang, Haiyan
    Luo, Yonglong
    [J]. MOBILE INFORMATION SYSTEMS, 2021, 2021
  • [9] A novel trust recommendation model for mobile social network based on user motivation
    Yang, Gelan
    Yang, Qin
    Jin, Huixia
    [J]. ELECTRONIC COMMERCE RESEARCH, 2021, 21 (03) : 809 - 830
  • [10] A novel trust recommendation model for mobile social network based on user motivation
    Gelan Yang
    Qin Yang
    Huixia Jin
    [J]. Electronic Commerce Research, 2021, 21 : 809 - 830