期刊文献+

基于优化结构洞的无向加权网络关键节点发现方法 被引量:2

Method to identify key nodes in undirected weighted networks on basis of optimized “structural hole”
在线阅读 下载PDF
导出
摘要 针对目前大多数关键节点发现算法没有兼顾桥节点与其他类型关键节点,造成评价结果存在片面性的问题,使用加权网络模型结合结构洞理论,提出一种优化结构洞的无向加权网络关键节点发现方法。综合考虑了节点的邻居数量及其与邻居间的拓扑结构,首先通过定义节点的邻接度和二次邻接度来衡量邻居节点对其的重要程度,在此基础上测量网络中的结构洞约束系数并通过排序发现网络中处于重要位置的关键节点。该方法既反映出节点局部连接的特性,又可在全局拓扑未知的情况下发现其中的关键节点,解决了全局方法计算复杂度高的问题。实验结果表明,该方法比基于介数、节点强度、接近度方法更准确、有效地发现无向加权网络中的关键节点。 In order to solve the problems that most of the exiting algorithms to find key nodes do not take into account the bridge nodes and other key nodes,which may lead to an one?sided evaluation result,an optimized structural holes based method to find the key nodes in the undirected weighted networks is proposed by means of the weighted network model and the structure hole theory.The number of neighbors around the nodes and the topology structure among the nodes and neighbors are considered in this method.The importance of the neighbor nodes to the nodes is measured by defining adjacency degree and secondary adjacency degree of the nodes,and then the constraint coefficient of the structural hole in the network is calculated to findthe important position of the key nodes in the network.The method can reflect the local connection feature of the node find thekey nodes in network in the case that the global topology is unknown.It can solve the problem of high computational complexityof the global methods.The experiment results show that the method is better than the methods based on betweenness,node strength and proximity.
作者 王丽娟 蔡晓东 杨超 甘凯今 李隆泽 WANG Lijuan;CAI Xiaodong;YANG Chao;GAN Kaijin;LI Longze(College of Communication and Information,Guilin University of Electronic Technology,Guilin 541004,China)
出处 《现代电子技术》 北大核心 2017年第6期35-39,共5页 Modern Electronics Technique
基金 国家科技支撑计划课题资助项目(2014BAK11B02) 广西科学研究与技术开发计划资助项目(桂科攻14122007-5) 桂林电子科技大学研究生教育创新计划资助项目(YJCXS201521)
关键词 桥节点 结构洞 约束系数 邻接度 bridge node structure hole constraint coefficient adjacency degree
  • 相关文献

参考文献5

二级参考文献65

  • 1严网,周涛,王杰,傅忠谦,汪秉宏.Epidemic Spread in Weighted Scale-Free Networks[J].Chinese Physics Letters,2005,22(2):510-513. 被引量:19
  • 2王林,张婧婧.复杂网络的中心化[J].复杂系统与复杂性科学,2006,3(1):13-20. 被引量:61
  • 3谭跃进,吴俊,邓宏钟.复杂网络中节点重要度评估的节点收缩方法[J].系统工程理论与实践,2006,26(11):79-83. 被引量:265
  • 4刘宏鲲,周涛.中国城市航空网络的实证研究与分析[J].物理学报,2007,56(1):106-112. 被引量:144
  • 5Albert R, Jeong H, Barabasi. Error and attack tolerance of complex networks[J]. Nature, 2000, 406: 378-382.
  • 6Gallos L K, Cohen R, Argyrakis P. Stability and topology of scale-free networks under attack and defense strategies [J].Phys. Rev. Lett. , 2005, 94:(188701-1)-(188701-4).
  • 7Callaway D S , Newman M E J, Strogatez S H, et al. Network robustness and fragility: percolation on random graphs[J]. Phys. Rev. Lett., 2000, 85(25):5468-5471.
  • 8Barthelemy M. Betweenness centrality in large complex networks[J].Euro. Phys. J. B, 2004, 38 (2):163-168.
  • 9李梦辉,樊瑛,狄增如.复杂网络[M].上海:上海科技教育出版社,2006:27-49.
  • 10NEWMAN M E J. The structure and function of complex networks [J].SIAM Review, 2003, 45(2) : 167-256.

共引文献244

同被引文献19

引证文献2

二级引证文献23

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部