Presenting new collaborative link prediction methods for activity recommendation in Facebook

被引:19
作者
Shahmohammadi, Amin [1 ]
Khadangi, Ehsan [2 ]
Bagheri, Alireza [2 ]
机构
[1] Pooyesh Inst Higher Educ, Dept Comp Engn, Qom, Iran
[2] Amirkabir Univ Technol, Dept Comp Engn & Informat Technol, Tehran, Iran
关键词
Link prediction; Recommender system; Facebook; Collaborative filtering; Online social network; Activity network;
D O I
10.1016/j.neucom.2016.06.024
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
One of the common methods used in recommender systems is collaborative filtering methods. In these methods, same-interest users' preferences are often recommended to each other based on examining their past interests. On the other hand, one of the recommendation methods in social networks is to measure the proximity of the two nodes in the graph. Although many researchers have dealt with friendship link prediction in different online social networks, very little notice has been spent on activity prediction based on different users' interactions. The main objective of this paper is the use of collaborative filtering methods for activity prediction and recommendation both for pairs of users without any interaction background and also for user pairs with the activity background. In this regard, a new concept is initially presented named as "collaborative path". Then based on the collaborative path, four directed proximity measures are proposed. In addition, three new algorithms, including two algorithms based on collaborative random walks, one for mixed network and one for multilayer network and the Collaborative-Association-Rule algorithm are presented. Finally, in order to evaluate our proposed methods, we perform some experiments on the dataset of different Facebook activity networks including like, comment, post, and share networks. The results show that the proposed collaborative methods deal with the activity prediction well without suffering from the cold start problem, and outperform the existing state of the art methods. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:217 / 226
页数:10
相关论文
共 25 条
[1]   Friends and neighbors on the Web [J].
Adamic, LA ;
Adar, E .
SOCIAL NETWORKS, 2003, 25 (03) :211-230
[2]  
Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[3]  
[Anonymous], 2007, TKDD
[4]  
[Anonymous], 2014, INT C ROUGH SETS KNO
[5]  
[Anonymous], ABS14072161 CORR
[6]  
[Anonymous], URBANA
[7]  
[Anonymous], 2003, P 12 ACM INT C INFOR
[8]  
[Anonymous], Proceedings of the 20th international conference on World wide web, DOI DOI 10.1145/1963405.1963504
[9]  
[Anonymous], INT C ADV NEW TECHN
[10]  
[Anonymous], 2010, Identifying key users in online social networks: A pagerank based approach