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
相关论文
共 48 条
[11]  
Crossen A., 2002, IUI 02. 2002 International Conference on Intelligent User Interfaces, P184
[12]   Item-based top-N recommendation algorithms [J].
Deshpande, M ;
Karypis, G .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2004, 22 (01) :143-177
[13]   Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation [J].
Fouss, Francois ;
Pirotte, Alain ;
Renders, Jean-Michel ;
Saerens, Marco .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2007, 19 (03) :355-369
[14]  
Gartrell M., 2010, P 16 ACM INT C SUPP, P97, DOI DOI 10.1145/1880071.1880087
[15]  
Gori M, 2007, 20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2766
[16]  
He J., P 12 ANN ACM INT C M, P9, DOI 10.1145/1027527.1027531
[17]   Social recommendation service for cultural heritage [J].
Hong, Minsung ;
Jung, Jason J. ;
Piccialli, Francesco ;
Chianese, Angelo .
PERSONAL AND UBIQUITOUS COMPUTING, 2017, 21 (02) :191-201
[18]   Recurrent Poisson Factorization for Temporal Recommendation [J].
Hosseini, Seyed Abbas ;
Alizadeh, Keivan ;
Khodadadi, Ali ;
Arabzadeh, Ali ;
Farajtabar, Mehrdad ;
Zha, Hongyuan ;
Rabiee, Hamid R. .
KDD'17: PROCEEDINGS OF THE 23RD ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2017, :847-855
[19]  
Hou S, 2018, MULTIMED TOOLS APPL, V99, P1
[20]   Multi-layer multi-view topic model for classifying advertising video [J].
Hou, Sujuan ;
Chen, Ling ;
Tao, Dacheng ;
Zhou, Shangbo ;
Liu, Wenjie ;
Zheng, Yuanjie .
PATTERN RECOGNITION, 2017, 68 :66-81