Improving local clustering based top-L link prediction methods via asymmetric link clustering information

被引:19
作者
Wu, Zhihao [1 ]
Lin, Youfang [1 ]
Zhao, Yiji [1 ]
Yan, Hongyan [2 ]
机构
[1] Beijing Jiaotong Univ, Sch Comp & Informat Technol, Beijing Key Lab Traff Data Anal & Min, Beijing 100044, Peoples R China
[2] China Mobile Res Inst, User & Market Res Dept, Beijing 100032, Peoples R China
基金
中国国家自然科学基金;
关键词
Link prediction; Complex networks; Asymmetrical link clustering; COMPLEX NETWORKS; MISSING LINKS; FEATURES;
D O I
10.1016/j.physa.2017.11.103
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Networks can represent a wide range of complex systems, such as social, biological and technological systems. Link prediction is one of the most important problems in network analysis, and has attracted much research interest recently. Many link prediction methods have been proposed to solve this problem with various techniques. We can note that clustering information plays an important role in solving the link prediction problem. In previous literatures, we find node clustering coefficient appears frequently in many link prediction methods. However, node clustering coefficient is limited to describe the role of a common-neighbor in different local networks, because it cannot distinguish different clustering abilities of a node to different node pairs. In this paper, we shift our focus from nodes to links, and propose the concept of asymmetric link clustering (ALC) coefficient. Further, we improve three node clustering based link prediction methods via the concept of ALC. The experimental results demonstrate that ALC-based methods outperform node clustering based methods, especially achieving remarkable improvements on food web, hamster friendship and Internet networks. Besides, comparing with other methods, the performance of ALC-based methods are very stable in both globalized and personalized top-L link prediction tasks. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:1859 / 1874
页数:16
相关论文
共 50 条
[1]  
Adamic L. A., 2005, P 3 INT WORKSH LINK, P36
[2]   Friends and neighbors on the Web [J].
Adamic, LA ;
Adar, E .
SOCIAL NETWORKS, 2003, 25 (03) :211-230
[3]   An efficient algorithm for link prediction in temporal uncertain social networks [J].
Ahmed, Nahla Mohamed ;
Chen, Ling .
INFORMATION SCIENCES, 2016, 331 :120-136
[4]   Link communities reveal multiscale complexity in networks [J].
Ahn, Yong-Yeol ;
Bagrow, James P. ;
Lehmann, Sune .
NATURE, 2010, 466 (7307) :761-U11
[5]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[6]  
[Anonymous], STOCH P APPL
[7]  
[Anonymous], HAMST FRIENDSH UN NE
[8]  
[Anonymous], 1971, Journal of Mathematical Sociology, DOI 10.1080/0022250X.1971.9989788
[9]  
[Anonymous], 2006, SDM
[10]  
[Anonymous], Pajek datasets