图书情报工作 ›› 2021, Vol. 65 ›› Issue (20): 92-100.DOI: 10.13266/j.issn.0252-3116.2021.20.010

• 情报研究 • 上一篇    下一篇

HHa中心性算法:一种基于h指数和Ha指数的复杂网络节点排序算法

刘佳程1,2, 马廷灿1,2,3, 岳名亮1,2,3   

  1. 1. 中国科学院大学图书情报与档案管理系, 北京 100190;
    2. 中国科学院武汉文献情报中心, 武汉 430071;
    3. 科技大数据湖北省重点实验室, 武汉 430071
  • 收稿日期:2021-04-14 修回日期:2021-06-27 出版日期:2021-10-20 发布日期:2021-10-22
  • 通讯作者: 马廷灿(ORCID:0000-0001-5985-384X),研究馆员,硕士,通讯作者,E-mail:matc@whlib.ac.cn
  • 作者简介:刘佳程(ORCID:0000-0001-5418-7307),硕士研究生;岳名亮(ORCID:0000-0002-1138-6661),副研究员,博士。
  • 基金资助:
    本文系2020年中国科学院文献情报能力建设专项"科技领域战略情报研究咨询体系建设"(项目编号:E0290001)研究成果之一。

HHa Centrality Algorithm: A Node Centrality Algorithm Based on the H-Index and Ha-Index

Liu Jiacheng1,2, Ma Tingcan1,2,3, Yue Mingliang1,2,3   

  1. 1. Department of Library, Information and Archives Management, University of Chinese Academy of Sciences, Beijing 100190;
    2. Wuhan Library of Chinese Academy of Sciences, Wuhan 430071;
    3. Hubei Key Laboratory of Big Data in Science and Technology, Wuhan 430071
  • Received:2021-04-14 Revised:2021-06-27 Online:2021-10-20 Published:2021-10-22

摘要: [目的/意义] 针对复杂网络中的重要节点的识别,设计一种节点中心性算法,在传染病防控、舆情监控、产品营销、人才发现等方面发挥作用。[方法/过程] 同时考虑节点的高影响力邻居的数量及其总体影响,提出HHa节点中心性算法,在真实网络和人工网络上,使用SIR传染病模型模拟信息传播过程,采用单调函数M和肯德尔相关系数作为评价指标验证HHa中心性算法的有效性、准确性以及稳定性。[结果/结论] 实验表明,与7种经典的中心性算法相比,HHa中心性算法得出的排序结果M值为0.999等,排名第2;肯德尔系数为0.845等,高于其他算法0.15左右,排名第1且表现稳定。采用HHa中心性算法识别网络中的重要节点具备可行性。

关键词: 复杂网络, 节点中心性, 节点影响力, h指数, HHa中心性算法

Abstract: [Purpose/significance] For the identification of important nodes in complex networks, the paper designs a node centrality algorithm, which plays an important role in infectious disease prevention and control, public opinion monitoring, product marketing, talent discovery and so on. [Method/process] This paper proposed a new node centrality algorithm, the HHa node centrality algorithm, taking both the number of the node's high influence neighbors and their total influence into consideration. On the real network and artificial network, the Susceptible-Infected-Recovered (SIR) model was used to simulate the information dissemination process, and the monotonic function M and Kendall correlation coefficient were used as evaluation indicators to verify the effectiveness, accuracy and stability of the HHa centrality algorithm. [Result/conclusion] The experimental results show that, compared with the 7 classic centrality algorithms, the HHa centrality algorithm ranks 2nd with a monotonic result of 0.999, and the Kendall coefficient is 0.845, which is higher than other algorithms' accuracy about 0.15, ranking 1st and performing robustly. It is feasible to use HHa centrality algorithm to identify important nodes in the network.

Key words: complex networks, node centrality, node influence, h-index, HHa centrality algorithm

中图分类号: