基于数据场的复杂网络节点影响力建模与仿真

doi:10.16182/j.issn1004731x.joss.18-0837

系统仿真学报 ›› 2020, Vol. 32 ›› Issue (7): 1257-1266.doi: 10.16182/j.issn1004731x.joss.18-0837

基于数据场的复杂网络节点影响力建模与仿真

邵晨曦, 陈小齐, 王行甫, 苗付友

中国科学技术大学计算机科学与技术学院,安徽合肥 230022

收稿日期:2018-12-17 修回日期:2019-04-30 出版日期:2020-07-25 发布日期:2020-07-15
作者简介:邵晨曦(1954-),男,浙江杭州,硕士,副教授,研究方向为系统仿真;陈小齐(1994-),男,安徽滁州,硕士生,研究方向为复杂网络。

Modeling and Simulation On Influence of Complex Network Nodes Based on Data Field in

Shao Chenxi, Chen Xiaoqi, Wang Xingfu, Miao Fuyou

School of Computer Science and Technology of University of Science and Technology of China, Hefei 230022, China

Received:2018-12-17 Revised:2019-04-30 Online:2020-07-25 Published:2020-07-15

摘要/Abstract

摘要： 复杂网络节点影响力的研究是数据挖掘的重要组成部分。挖掘出复杂网络中有影响力的节点不仅具有重要的学术意义,且有助于抑制流行病的爆发、控制谣言的传播和推广电子商务产品等。通过选取每个节点的混合度分解值(Mixed Degree Decomposition,MDD)作为质量,将复杂网络抽象为数据场,结合数据场模型来识别有影响力的节点,并与一些著名的节点中心性方法进行对比。使用经典的传染病模型(Susceptible-Infected-Recovered,SIR)通过对比感染节点的数量来评估仿真性能。对实际网络的仿真实验结果表明,数据场模型能够有效的识别网络中有影响力的节点。

关键词: 复杂网络, 节点影响力, 混合度分解, 数据场, 仿真

Abstract: Research on the influence of complex network nodes is an important part of data mining. Mining the influential nodes in complex networks not only has important academic significance, but also helps to suppress the outbreak of epidemics, control the spread of rumors, and promote e-commercial products and so on. By selecting the Mixed Degree Decomposition (MDD) value of each node as its mass, the complex network is abstracted into a data field, the influential nodes are identified by combining the data field model, and some well-known centralities are compares with. The classical Susceptible-Infected-Recovered (SIR) epidemic model is used to evaluate the simulation performance by comparing the number of infected nodes. Simulations on real networks show that the data field can effectively identify the influential nodes.

Key words: complex networks, influential nodes, mixed degree decomposition, data field, simulation

中图分类号:

TP391.9

邵晨曦, 陈小齐, 王行甫, 苗付友. 基于数据场的复杂网络节点影响力建模与仿真[J]. 系统仿真学报, 2020, 32(7): 1257-1266.

Shao Chenxi, Chen Xiaoqi, Wang Xingfu, Miao Fuyou. Modeling and Simulation On Influence of Complex Network Nodes Based on Data Field in[J]. Journal of System Simulation, 2020, 32(7): 1257-1266.

参考文献 24

[1]	Wang S, Li Y, Wang D.Data field for mining big data[J]. Geo-spatial Information Science (S1009-5020), 2016, 19(2): 106-118.
[2]	Ma L L, Ma C, Zhang H F, et al.Identifying influential spreaders in complex networks based on gravity formula[J]. Physica A Statistical Mechanics & Its Applications (S0378-4371), 2015, 451: 205-212.
[3]	Tang Y, Li M, Wang J, et al.CytoNCA: a cytoscape plugin for centrality analysis and evaluation of protein interaction networks[J]. Biosystems (S0303-2647), 2015, 127: 67-72.
[4]	Riondato M, Kornaropoulos E M.Fast approximation of betweenness centrality through sampling[J]. Data Mining and Knowledge Discovery (S1384-5810), 2016, 30(2): 438-475.
[5]	Solé-Ribalta A, De Domenico M, Gómez S, et al.Random walk centrality in interconnected multilayer networks[J]. Physica D: Nonlinear Phenomena (S0167-2789), 2016, 323: 73-79.
[6]	Kitsak M, Gallos L K, Havlin S, et al.Identification of influential spreaders in complex networks[J]. Nature Physics (S1745-2473), 2010, 6(11): 888-893.
[7]	Zeng A, Zhang C J.Ranking spreaders by decomposing complex networks[J]. Physics Letters A (S0375-9601), 2013, 377(14): 1031-1035.
[8]	Chen D, Lü L, Shang M S, et al.Identifying influential nodes in complex networks[J]. Physica a: Statistical mechanics and its applications (S0378-4371), 2012, 391(4): 1777-1787.
[9]	Lin J H, Guo Q, Dong W Z, et al.Identifying the node spreading influence with largest k-core values[J]. Physics Letters A (S0375-9601), 2014, 378(45): 3279-3284.
[10]	Zhuo Z, Zhang X, Niu W, et al.Improving data field hierarchical clustering using Barnes-Hut algorithm[J]. Pattern Recognition Letters (S0167-8655), 2016, 80(sep.1): 113-120.
[11]	Li T, Wang Y, Guan Z H.Spreading dynamics of a SIQRS epidemic model on scale-free networks[J]. Communications in Nonlinear Science and Numerical Simulation (S1007-5704), 2014, 19(3): 686-692.
[12]	Sun Z, Miao F, Xu Y, et al.Community detection in complex networks using flow simulation[C]// Proceedings of the 2017 VI International Conference on Network, Communication and Computing. Kunming, PEOPLES R CHINA: ACM, 2017: 150-155.
[13]	Bae J, Kim S.Identifying and ranking influential spreaders in complex networks by neighborhood coreness[J]. Physica A Statistical Mechanics & Its Applications (S0378-4371), 2014, 395(4): 549-559.
[14]	Barany I, Vu V.Central limit theorems for Gaussian polytopes[J]. The Annals of Probability (S0091-1798), 2007, 35(4): 1593-1621.
[15]	Wang S, Chen Y.HASTA: A Hierarchical-Grid Clustering Algorithm with Data Field[J]. International Journal of Data Warehousing & Mining (S1548-3924), 2014, 10(2): 39-54.
[16]	Liu Y, Jin J, Zhang Y, et al.A new clustering algorithm based on data field in complex networks[J]. The Journal of Supercomputing (S1573-0484), 2014, 67(3): 723-737.
[17]	Wang S, Wang S, Yuan H, et al.Clustering by differencing potential of data field[J]. Computing (S1436-5057), 2018, 100(4): 403-419.
[18]	Zachary W W.An information flow model for conflict and fission in small groups[J]. Journal of Anthropological Research (S0091-7710), 1977, 33(4): 452-473.
[19]	Lusseau D, Schneider K, Boisseau O J, et al.The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations[J]. Behavioral Ecology and Sociobiology (S0340-5443), 2003, 54(4): 396-405.
[20]	Huang Z, Wang Z, Zhang Z.Detecting Overlapping and Hierarchical Communities in Complex Network Based on Maximal Cliques[C]// Chinese National Conference on Social Media Processing. Guangzhou, PEOPLES R CHINA: Springer Singapore, 2015.
[21]	Karimi-Majd A M, Fathian M, Amiri B. A hybrid artificial immune network for detecting communities in complex networks[J]. Computing (S1436-5057), 2015, 97(5): 483-507.
[22]	Lancichinetti A, Fortunato S, Radicchi F.Benchmark graphs for testing community detection algorithms[J]. Physical review E (S2470-0053), 2008, 78(4): 046110.
[23]	Li C, Wang L, Sun S, et al.Identification of influential spreaders based on classified neighbors in real-world complex networks[J]. Applied Mathematics and Computation (S0096-3003), 2018, 320: 512-523.
[24]	Fu Y H, Huang C Y, Sun C T.Using global diversity and local features to identify influential social network spreaders[C]// IEEE/ACM International Conference on Advances in Social Networks Analysis & Mining. Beijing, PEOPLES R CHINA: IEEE, 2014.

基于数据场的复杂网络节点影响力建模与仿真

Modeling and Simulation On Influence of Complex Network Nodes Based on Data Field in

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献 24

相关文章 15

编辑推荐

Metrics

本文评价

[1]	陆淼嘉, 黄承媛, 滕靖. 基于多智能体的网购生鲜无人车配送调度仿真[J]. 系统仿真学报, 2022, 34(6): 1185-1195.
[2]	陆承, 靳学胜. 基于Steam VR的交互仿真水枪灭火训练系统设计[J]. 系统仿真学报, 2022, 34(6): 1312-1319.
[3]	倪凌佳, 黄晓霞, 李红旮, 张子博. 基于协作式深度强化学习的火灾应急疏散仿真研究[J]. 系统仿真学报, 2022, 34(6): 1353-1366.
[4]	胡冰山, 程科, 陆盛, 喻洪流. 变刚度储能助力髋外骨骼设计及助力效果仿真[J]. 系统仿真学报, 2022, 34(5): 1090-1100.
[5]	古鹏飞, 张霖, 陈真, 叶俊杰. 基于X语言的起飞场景民机协同设计与仿真一体化方法[J]. 系统仿真学报, 2022, 34(5): 929-943.
[6]	刘文正, 张和明. 面向复杂系统运动仿真的信息物理融合建模[J]. 系统仿真学报, 2022, 34(5): 954-963.
[7]	于帆, 罗东琦, 司宾强, 朱纪洪. 可交互式相控阵雷达DOA估计仿真系统设计[J]. 系统仿真学报, 2022, 34(5): 964-977.
[8]	付建林, 丁国富, 张剑, 江海凡, 郭沛佩. 基于响应面和NSGA-II的AGV系统多目标优化配置[J]. 系统仿真学报, 2022, 34(5): 994-1002.
[9]	李伟, 张欢, 马萍, 杨明. 云仿真系统可信度评估问题探讨[J]. 系统仿真学报, 2022, 34(4): 679-687.
[10]	刘永奎, 曾鸣, 张霖, 郭金维, 原思阳, 平垚垚. 基于微服务架构的云制造调度仿真系统设计与开发[J]. 系统仿真学报, 2022, 34(4): 700-711.
[11]	张立峰, 王会忍. 基于卷积神经网络及有限元仿真的电容层析成像图像重建[J]. 系统仿真学报, 2022, 34(4): 712-718.
[12]	马庆禄, 张琳, 袁新新, 刘丰杰. 城市道路交通多状态演化下的连续仿真技术研究[J]. 系统仿真学报, 2022, 34(4): 847-855.
[13]	吴枫, 刘秀罗, 王佳, 刘阳, 李苏疆, 仲妍. 航天发射可视化仿真分析技术与应用研究[J]. 系统仿真学报, 2022, 34(4): 856-869.
[14]	姚红光, 肖恢翚, 张航. 无标度物流网络中延误扩散临界条件的仿真研究[J]. 系统仿真学报, 2022, 34(4): 901-909.
[15]	叶飞, 李梓晴, 赖李媛君. 分布式车间生产维修联合调度仿真优化方法[J]. 系统仿真学报, 2022, 34(4): 688-699.