A dynamic cold-start recommendation method based on incremental graph pattern matching Online publication date: Fri, 14-Dec-2018
by Yanan Zhang; Guisheng Yin; Deyun Chen
International Journal of Computational Science and Engineering (IJCSE), Vol. 18, No. 1, 2019
Abstract: In order to give accurate recommendations for cold-start user who has few records, researchers find similar users for cold-start user according to social network. However these efforts assume that cold-start user's social relationships are static and ignore updating social relationships are time consuming. In social network, cold-start user and other users may change their social relationships as time passes. In order to give accurate and timely recommendations for cold-start user, it is necessary to update similar users for cold-start users according to their latest social relationship continuously. In this paper, an incremental graph pattern matching based dynamic cold-start recommendation method (IGPMDCR) is proposed, which updates similar users for cold-start user based on topology of social network, and gives recommendations according to latest users similar to cold-start user. The experimental results show that IGPMDCR could give accurate and timely recommendations for cold-start user.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook