Dynamic evolutionary clustering approach based on time weight and latent attributes for collaborative filtering recommendation

被引:24
作者
Chen, Jianrui [1 ]
Wei, Lidan [2 ]
Uliji [2 ]
Zhang, Li [2 ]
机构
[1] Shaanxi Normal Univ, Sch Comp Sci, Xian 710119, Shaanxi, Peoples R China
[2] Inner Mongolia Univ Technol, Coll Sci, Hohhot 010051, Peoples R China
基金
中国国家自然科学基金;
关键词
Forgetting curve; Network model; Collaborative filtering; Dynamic evolutionary clustering; Latent attributes; SOCIAL NETWORKS; ALGORITHM;
D O I
10.1016/j.chaos.2018.06.011
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Collaborative filtering is one of the most widely used individual recommendation algorithms. The traditional collaborative filtering recommendation algorithm takes less care of time variation, which may be inaccurate in real surroundings. A novel dynamic evolutionary clustering algorithm based on time weight and latent attributes is proposed. According to the time effect of historical information in recommendation system, forgetting curve is introduced to better grasp the recent interest of the users. To gather users with similar interest into the same cluster, item characteristics and user attributes are mined. Therefore, network model is established by introducing the forgetting function to score matrix, utilizing item characteristics and user attributes. Items and users are regarded as heterogenous nodes in network. Furthermore, a novel dynamic evolutionary clustering algorithm is adopted to divide users and items set into K clusters, and individuals with higher similarity are clustered. The preferences of users in the same cluster are similar. Then, collaborative filtering is applied in each cluster to predict the ratings. Finally, the target users are recommended predicted according to prediction ratings. Simulations show that the presented method gains better recommendation accuracy in comparison of existing algorithms through MovieLens 100k, Restaurant & consumer and CiaoDVD data sets. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:8 / 18
页数:11
相关论文
共 37 条
[1]  
Aburumman A, 2015, SEC PRIV COMM NETW 1, P649
[2]  
[Anonymous], 2005, 5 IEEE INT C DAT MIN
[3]  
[Anonymous], 2010, P 4 ACM C REC SYST R, DOI [DOI 10.1145/1864708.1864721, 10.1145/1864708.1864721]
[4]  
[Anonymous], 1999, ACM SIGIR WORKSH REC
[5]  
Breese J. S., 1998, Uncertainty in Artificial Intelligence. Proceedings of the Fourteenth Conference (1998), P43
[6]   Typicality-Based Collaborative Filtering Recommendation [J].
Cai, Yi ;
Leung, Ho-fung ;
Li, Qing ;
Min, Huaqing ;
Tang, Jie ;
Li, Juanzi .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2014, 26 (03) :766-779
[7]  
Chen J., 2017, SWARM EVOLUT COMPUT, V38, P394
[8]  
Chen JR, 2014, CHINESE PHYS B, V23, P686
[9]   Preference-based clustering reviews for augmenting e-commerce recommendation [J].
Chen, Li ;
Wang, Feng .
KNOWLEDGE-BASED SYSTEMS, 2013, 50 :44-59
[10]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38