摘要
现有的大部分基于非负矩阵分解的链路预测方法仅考虑网络拓扑结构信息而忽略节点与链接聚类信息。针对此问题,提出一个融合聚类信息的对称非负矩阵分解的链路预测模型。首先,该模型利用对称非负矩阵分解去捕获网络节点相似度信息;其次,使用基于Jaccard的节点和链接聚类系数去保持网络局部结构信息;最后,启用拉格朗日乘法规则去学习模型参数。在六个真实无向无权和四个加权网络上的实验结果表明,该方法在两种不同类型网络预测精确度分别提升了1.6%和8.9%。
Most existing link prediction methods based on non-negative matrix factorization only consider network topology information and ignore node and link clustering information.To solve this problem,this paper proposed a link prediction model based on symmetric non-negative matrix factorization with clustering information.Firstly,the model used symmetric non-negative matrix factorization to capture the similarity information of network nodes.Secondly,it used the node and link clustering coefficients based on Jaccard to keep the local structure information of the network.Finally,it enabled the Lagrange multiplication rule to learn the model parameters.Experimental results on six real undirected unweighted networks and four weighted networks show that the prediction accuracy of this method on two different types of networks is improved by 1.6%and 8.9%,respectively.
作者
陈广福
王海波
Chen Guangfu;Wang Haibo(College of Mathematics&Computer Science,Wuyi University,Wuyishan Fujian 354300,China;College of Electronic&Information Engineering,Hunan University of Science&Engineering,Yongzhou Hunan 425199,China)
出处
《计算机应用研究》
CSCD
北大核心
2021年第12期3733-3738,共6页
Application Research of Computers
基金
武夷学院引进人才科研启动基金资助项目(YJ202017)。
关键词
复杂网络
链路预测
对称非负矩阵分解
节点和链接聚类信息
complex network
link prediction
symmetric non-negative matrix factorization
node and link clustering information
