An Efficient Link Prediction Technique in Social Networks based on Node Neighborhoods

被引:0
作者
Nandi, Gypsy [1 ]
Das, Anjan [2 ]
机构
[1] Assam Don Bosco Univ, Gauhati, Assam, India
[2] St Anthonys Coll, Shillong, Meghalaya, India
关键词
Link prediction; online social networks; common neighbors; Jaccard's coefficient; Adamic/Adar; preferential attachment; FriendLink;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The unparalleled accomplishment of social networking sites, such as Facebook, LinkedIn and Twitter has modernized and transformed the way people communicate to each other. Nowadays, a huge amount of information is being shared by online users through these social networking sites. Various online friendship sites such as Facebook and Orkut, allow online friends to share their thoughts or opinions, comment on others' timeline or photos, and most importantly, meet new online friends who were known to them before. However, the question remains as to how to quickly propagate one's online network by including more and more new friends. For this, one of the easy methods used is list of 'Suggested Friends' provided by these online social networking sites. For suggestion of friends, prediction of links for each online user is needed to be made based on studying the structural properties of the network. Link prediction is one of the key research directions in social network analysis which has attracted much attention in recent years. This paper discusses about a novel efficient link prediction technique LinkGyp and many other commonly used existing prediction techniques for suggestion of friends to online users of a social network and also carries out experimental evaluations to make a comparative analysis among each technique. Our results on three real social network datasets show that the novel LinkGyp link prediction technique yields more accurate results than several existing link prediction techniques.
引用
收藏
页码:257 / 266
页数:10
相关论文
共 22 条
[1]   Friends and neighbors on the Web [J].
Adamic, LA ;
Adar, E .
SOCIAL NETWORKS, 2003, 25 (03) :211-230
[2]  
[Anonymous], 2003, P 12 INT C INFORM KN, DOI DOI 10.1145/956863.956972
[3]   "Make New Friends, but Keep the Old" - Recommending People on Social Networking Sites [J].
Chen, Jilin ;
Geyer, Werner ;
Dugan, Casey ;
Muller, Michael ;
Guy, Ido .
CHI2009: PROCEEDINGS OF THE 27TH ANNUAL CHI CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS, VOLS 1-4, 2009, :201-210
[4]  
Cho E., 2011, ACM SIGKDD INT C KNO
[5]  
Hasan M., 2005, P WORKSH LINK DISC I
[6]  
JEH G, 2002, P ACM SIGKDD INT C K
[7]  
Katz L., 1953, PSYCHOMETRIKA, V18, P39, DOI [DOI 10.1007/BF02289026, 10.1007/BF02289026]
[8]  
KONECT, HAMST FRIENDSH NETW
[9]  
Kunegis Jerome Marcel, 2013, P 5 ANN ACM WEB SCI, P205, DOI [10.1145/ 2464464.2464514, DOI 10.1145/2464464.2464514]
[10]  
Li R., 2011, CIKM