首页> 外文会议>IEEE/ACIS International Conference on Computer and Information Science >An improved link prediction algorithm based on degrees and similarities of nodes
【24h】

An improved link prediction algorithm based on degrees and similarities of nodes

机译:一种基于节点相似度的改进的链路预测算法

获取原文

摘要

Link prediction is to calculate the probability of a potential link between a pair of unlinked nodes in the future. It has significance value in both theoretical and practical. The similarity of two nodes in the networks is an essential factor to determine the probability of a potential link between them. One of the important methods with the similarity of two nodes is to consider common neighbors of two nodes. However, the number of common neighbors only describes a kind of quantitative relationship without taking into account the topology of given networks and the information of local structure which consist of a pair of nodes and their common neighbors. Therefore, we introduce the concept of the degrees of nodes and the idea of community structure and propose a new similarity index, namely, local affinity structure(LAS). The LAS method describes the closeness of a pair of nodes and their common neighbors. We evaluated LAS on twelve different networks compared with other three similarity based indexes which consider the degree of nodes. From the experimental results, our method shows obvious superiority in improving the accuracy of link prediction.
机译:链接预测是为了计算将来在一对未链接节点之间建立潜在链接的可能性。它具有理论和实践意义。网络中两个节点的相似性是确定它们之间潜在链接的可能性的重要因素。具有两个节点相似性的重要方法之一是考虑两个节点的公共邻居。但是,公共邻居的数量仅描述了一种定量关系,而没有考虑给定网络的拓扑和由一对节点及其公共邻居组成的局部结构信息。因此,我们引入了节点度的概念和社区结构的思想,并提出了一种新的相似性指标,即局部亲和结构(LAS)。 LAS方法描述了一对节点及其公共邻居的紧密度。与考虑节点程度的其他三个基于相似度的指标相比,我们在十二个不同的网络上评估了LAS。从实验结果来看,我们的方法在提高链接预测的准确性方面显示出明显的优势。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号