面向结构洞的指挥控制网络关键节点识别方法
|
摘要
针对目前指挥控制网络关键节点识别方法利用局部信息识别精度低、利用全局信息识别复杂度高的问题,提出了一种面向结构洞的指挥控制网络关键节点识别方法,该方法综合考虑了指挥控制网络结构特征和全局拓扑信息,引入了层级流介数的概念用以计算网络的约束系数。实验分析表明,该方法提高了关键节点识别精度,降低了算法复杂度,更加适用于指挥控制网络关键节点识别的需要。
For the problem of low identification accuracy caused by using local information and high complexity caused by using global information of key nodes identification in current military Command and Control(C2) networks,this paper has proposed a method based on structural hole,which considered the structure features of C2 network and global topology information,and introduced the concept of Level Flow Betweenness for the calculation of network Constraint Index. Experiments and analytical results shows that this method improves the identification accuracy,reduces the complexity of the algorithm,and enhances serviceability.
For the problem of low identification accuracy caused by using local information and high complexity caused by using global information of key nodes identification in current military Command and Control(C2) networks,this paper has proposed a method based on structural hole,which considered the structure features of C2 network and global topology information,and introduced the concept of Level Flow Betweenness for the calculation of network Constraint Index. Experiments and analytical results shows that this method improves the identification accuracy,reduces the complexity of the algorithm,and enhances serviceability.
引文
[1]BUDAK C,AGRAWAL D.EI Abbadi a 2011 proceedings of the 20th international conference ore world wide web hyderabad[C]//India,2011:665-667.
[2]荣鑫,王琦.通用防空指挥系统战术互联网的设计与实现[J].火力与指挥控制,2014,39(S1):146-148.
[3]于会,刘尊.基于多属性决策的复杂网络节点重要性综合评价方法[J].物理学报,2013,62(2):46-54.
[4]ZHANG X H,ZHU J,WANG Q,et al.Identifying influential nodes in complex networks with community structure[J].Knowledge-Based Systems,2013(42):74-84.
[5]韩忠明,吴杨.面向结构洞的复杂网络关键节点排序[J].物理学报,2015,64(5):421-429.
[6]苏晓萍,宋玉蓉.利用邻域“结构洞”寻找社会网络中最具影响力节点[J].物理学报,2015,64(2):1-11.
[7]OPSAHL T,AGNEESSENS F,SKVORETZ J.Node centrality in weighted networks:Generalizing degree and shortest paths[J].Soc Netw,2010,32:245-251.
[8]MARTIN T,ZHANG X,NEWMAN M E J.Localization and centrality in networks[Z].2014,ar Xiv:14015093.
[9]YAN G,ZHOU T.Efficient routing on complex networks[J].Phys Rev E,2006,73:46-50.
[10]GREEN O,MCCOLL R,BADER D A.A Fast Algorithm for Streaming Betweenness Centrality[C]//2012 International Conference on and 2012 International Conference on Social Computing(Social Com),2012:11-20.
[11]LI C,GUO S Z.An approximate flow betweenness based centrality measure for complex network[C]//Proceedings of2nd International Conference on Pervasive Computing,Signal Processing and Applications,2011:59-62.
[12]蓝羽石,易侃.网络化C4ISR系统结构时效性分析方法[J].系统工程与电子技术,2013(9):1908-1914.
[13]BURT R S,KILDUFF M,Tasselli S 2013 Ann[C]//Rev.Psychol,2013.
[14]周漩,张凤鸣.利用节点效率评估复杂网络功能鲁棒性[J].物理学报,2012,58(19):1-7.
[15]段杰明,尚明生.基于自规避随机游走的节点排序算法[J].物理学报,2015,58(20):61-68.
[2]荣鑫,王琦.通用防空指挥系统战术互联网的设计与实现[J].火力与指挥控制,2014,39(S1):146-148.
[3]于会,刘尊.基于多属性决策的复杂网络节点重要性综合评价方法[J].物理学报,2013,62(2):46-54.
[4]ZHANG X H,ZHU J,WANG Q,et al.Identifying influential nodes in complex networks with community structure[J].Knowledge-Based Systems,2013(42):74-84.
[5]韩忠明,吴杨.面向结构洞的复杂网络关键节点排序[J].物理学报,2015,64(5):421-429.
[6]苏晓萍,宋玉蓉.利用邻域“结构洞”寻找社会网络中最具影响力节点[J].物理学报,2015,64(2):1-11.
[7]OPSAHL T,AGNEESSENS F,SKVORETZ J.Node centrality in weighted networks:Generalizing degree and shortest paths[J].Soc Netw,2010,32:245-251.
[8]MARTIN T,ZHANG X,NEWMAN M E J.Localization and centrality in networks[Z].2014,ar Xiv:14015093.
[9]YAN G,ZHOU T.Efficient routing on complex networks[J].Phys Rev E,2006,73:46-50.
[10]GREEN O,MCCOLL R,BADER D A.A Fast Algorithm for Streaming Betweenness Centrality[C]//2012 International Conference on and 2012 International Conference on Social Computing(Social Com),2012:11-20.
[11]LI C,GUO S Z.An approximate flow betweenness based centrality measure for complex network[C]//Proceedings of2nd International Conference on Pervasive Computing,Signal Processing and Applications,2011:59-62.
[12]蓝羽石,易侃.网络化C4ISR系统结构时效性分析方法[J].系统工程与电子技术,2013(9):1908-1914.
[13]BURT R S,KILDUFF M,Tasselli S 2013 Ann[C]//Rev.Psychol,2013.
[14]周漩,张凤鸣.利用节点效率评估复杂网络功能鲁棒性[J].物理学报,2012,58(19):1-7.
[15]段杰明,尚明生.基于自规避随机游走的节点排序算法[J].物理学报,2015,58(20):61-68.