An Incremental Graph Pattern Matching Based Dynamic Cold-Start Recommendation Method  

作　　者：Yanan Zhang Guisheng Yin Qiushi Zhao 

机构地区：[1]Software School,Harbin University of Science and Technology,Harbin150040,China [2]College of Computer Science and Technology,Harbin Engineering University,Harbin150001,China

出　　处：《国际计算机前沿大会会议论文集》2016年第1期48-50,共3页International Conference of Pioneering Computer Scientists, Engineers and Educators（ICPCSEE）

摘　　要：In order to give accurate recommendations for cold-start user, researchers use social network to find similar users. These efforts assume that cold-start user’s social relationships are static. However social relationships of cold-start user may change as time pass by. In order to give accurate and timely in manner recommendations for cold-start user, it is need to update social relationship continuously. In this paper, we proposed an incremental graph pattern matching based dynamic cold-start recommendation method (IGPMDCR), which updates similar users for cold-start user based on topology of social network, and gives recommendations based on the latest similar users’ records. The experimental results show that, IGPMDCR could give accurate and timely in manner recommendations for cold-start user.

关 键 词：Dynamic COLD-START RECOMMENDATION SOCIAL NETWORK INCREMENTAL graph pattern MATCHING Topology of SOCIAL NETWORK 

分 类 号：C5[社会学]