﻿ 基于集聚系数的链路预测算法

# 基于集聚系数的链路预测算法Link Prediction Based on Clustering Coefficient

Abstract: Link prediction in complex network aims at estimating the likelihood of the existence of links be-tween nodes by the known network structure. Currently, most link prediction algorithms are si-milarity algorithms based on local information including the number of common neighbor nodes, degree of common neighbor nodes and the interactions between common neighbor nodes, and thus their applied range is limited. In this paper, we consider the interactions between adjacent nodes of a node and design a new algorithm based on clustering coefficient. We use this new algorithm in the experiments on real networks and simulative networks generated by pajek, and experimental results show that the algorithm is applicable to a wide range of problems and it has the high accuracy of prediction.

[1] 吕琳媛, 陆君安, 张子柯, 闫小勇, 吴晔, 史定华, 周海平, 方锦清, 周涛 (2010) 复杂网络观察. 复杂系统与复杂性科学, 2-3, 173-186.

[2] Liben-Nowell, D. and Kleinberg, J. (2007) The link-prediction problem for social net-works. Journal of the American Society for Information Science and Technology, 58, 1019-1031.

[3] 吕琳媛 (2010) 复杂网络链路预测. 电子科技大学学报, 5, 651-661.

[4] 东昱晓, 柯庆, 吴斌 (2011) 基于节点相似性的链接预测. 计算机科学, 7, 162-164.

[5] 殷涵 (2012) 社会网络的链接预测. 硕士论文, 吉林大学, 吉林.

[6] 李淑玲 (2012) 基于相似性的链接预测方法研究. 硕士论文, 哈尔滨工程大学, 哈尔滨.

[7] Zhou, T., Lü, L. and Zhang Y.-C. (2009) Predicting missing links via local information. European Physical Journal B, 71, 623-630.

[8] Feng, X., J.C. Zhao, J.C. and Xu, K. (2012) Link prediction in complex networks: A clustering perspective. European Physical Journal B, 85, 3.

Top