首页> 外文期刊>Informatica: An International Journal of Computing and Informatics >Research on Recognition Algorithm of important Nodes in Complex Network
【24h】

Research on Recognition Algorithm of important Nodes in Complex Network

机译:复杂网络中重要节点识别算法研究

获取原文
           

摘要

It is very important to identify the important nodes in the network. On the basis of K-shell algorithm, this study studied the recognition of important nodes in complex networks. Firstly, this study introduced concepts of edge weight and influence coefficient, designed an IKS algorithm, and analyzed its recognition effect in Zachary network and real micro blog network. It was found from the experimental results that the partition results of the K-shell algorithm were coarse, while the partition results of the IKS algorithm were refined; the IKS algorithm could sort the important nodes accurately on the basis of the K-shell algorithm, and its rationality was higher than that of closeness centralization and PaperRank algorithm. The partition results in microblog network also verified the effectiveness of the improved method. The experimental results show that the IKS algorithm is reliable in the important node identification, which makes some contributions to the recognition of important nodes in complex network. It is very important to identify the important nodes in the network. On the basis of K-shell algorithm, this study studied the recognition of important nodes in complex networks. Firstly, this study introduced concepts of edge weight and influence coefficient, designed an IKS algorithm, and analyzed its recognition effect in Zachary network and real micro blog network. It was found from the experimental results that the partition results of the K-shell algorithm were coarse, while the partition results of the IKS algorithm were refined; the IKS algorithm could sort the important nodes accurately on the basis of the K-shell algorithm, and its rationality was higher than that of closeness centralization and PaperRank algorithm. The partition results in microblog network also verified the effectiveness of the improved method. The experimental results show that the IKS algorithm is reliable in the important node identification, which makes some contributions to the recognition of important nodes in complex network.
机译:确定网络中的重要节点非常重要。在K-Shell算法的基础上,本研究研究了复杂网络中的重要节点的认识。首先,本研究引入了边缘权重和影响系数的概念,设计了IKS算法,并分析了其在Zachary网络和真博网络中的识别效果。从实验结果中发现了k-shell算法的分区结果粗糙,而IK算法的分区结果被精制; IKS算法可以基于K-Shell算法准确地对重要节点进行分类,其合理性高于亲密集中和梳地演奏算法。分区导致微博网络还验证了改进方法的有效性。实验结果表明,IKS算法在重要的节点识别中是可靠的,这对复杂网络中的重要节点进行了一些贡献。确定网络中的重要节点非常重要。在K-Shell算法的基础上,本研究研究了复杂网络中的重要节点的认识。首先,本研究引入了边缘权重和影响系数的概念,设计了IKS算法,并分析了其在Zachary网络和真博网络中的识别效果。从实验结果中发现了k-shell算法的分区结果粗糙,而IK算法的分区结果被精制; IKS算法可以基于K-Shell算法准确地对重要节点进行分类,其合理性高于亲密集中和梳地演奏算法。分区导致微博网络还验证了改进方法的有效性。实验结果表明,IKS算法在重要的节点识别中是可靠的,这对复杂网络中的重要节点进行了一些贡献。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号