A New Recommendation Algorithm Based on User’s Dynamic Information in Complex Social Network

The development of recommendation system comes with the research of data sparsity, cold start, scalability, and privacy protection problems. Even though many papers proposed different improved recommendation algorithms to solve those problems, there is still plenty of room for improvement. In the complex social network, we can take full advantage of dynamic information such as user’s hobby, social relationship, and historical log to improve the performance of recommendation system. In this paper, we proposed a new recommendation algorithm which is based on social user’s dynamic information to solve the cold start problem of traditional collaborative filtering algorithm and also considered the dynamic factors. The algorithm takes user’s response information, dynamic interest, and the classic similar measurement of collaborative filtering algorithm into account. Then, we compared the new proposed recommendation algorithm with the traditional user based collaborative filtering algorithm and also presented some of the findings from experiment. The results of experiment demonstrate that the new proposed algorithm has a better recommended performance than the collaborative filtering algorithm in cold start scenario.

[1]  Yi-Cheng Zhang,et al.  Solving the apparent diversity-accuracy dilemma of recommender systems , 2008, Proceedings of the National Academy of Sciences.

[2]  Michael J. Muller,et al.  Make new friends, but keep the old: recommending people on social networking sites , 2009, CHI.

[3]  Yao Zhao,et al.  A Collaborative Filtering Recommendation Algorithm Based on User Interest Change and Trust Evaluation , 2010, J. Digit. Content Technol. its Appl..

[4]  Greg Linden,et al.  Amazon . com Recommendations Item-to-Item Collaborative Filtering , 2001 .

[5]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[6]  Li Shang,et al.  Interest-based real-time content recommendation in online social communities , 2012, Knowl. Based Syst..

[7]  Zhai Zheng-jun,et al.  Collaborative filtering algorithm based on time weight , 2007 .

[8]  Zhi-Min Gu,et al.  Personalized Recommendation Based on Partial Similarity of Interests , 2006, ADMA.

[9]  George Karypis,et al.  Item-based top-N recommendation algorithms , 2004, TOIS.

[10]  Jimeng Sun,et al.  Temporal recommendation on graphs via long- and short-term preference fusion , 2010, KDD.

[11]  John Riedl,et al.  GroupLens: an open architecture for collaborative filtering of netnews , 1994, CSCW '94.

[12]  Bradley N. Miller,et al.  Social Information Filtering : Algorithms for Automating “ Word of Mouth , ” , 2017 .

[13]  Anne Morris,et al.  The problem of information overload in business organisations: a review of the literature , 2000, Int. J. Inf. Manag..

[14]  Mark Rosenstein,et al.  Recommending and evaluating choices in a virtual community of use , 1995, CHI '95.

[15]  Young Park,et al.  A time-based approach to effective recommender systems using implicit feedback , 2008, Expert Syst. Appl..

[16]  John Hannon,et al.  Recommending twitter users to follow using content and collaborative filtering approaches , 2010, RecSys '10.

[17]  David Heckerman,et al.  Empirical Analysis of Predictive Algorithms for Collaborative Filtering , 1998, UAI.