Key Nodes Mining Algorithm Based on Complex Network

DOI

10.2991/iccse-16.2016.10How to use a DOI?

Keywords

Key nodes, Mining algorithm, Complex networks, Measure

Abstract

The problem of network disintegration, such as suppressing the epidemic spreading and destabilizing terrorist networks, has broad applications and recently has attracted more attentions. The fundamental purpose of this study is to find the critical nodes whose deficiency could lead to the network collapse. By now, most related works of attack strategy in complex networks use certain properties of the nodes, while little is known about optimal attack strategy for complex networks. In this paper, we presented an optimized attack strategy model for complex networks and introduced the tabu search into the problem. The network performance is quantitatively measured by natural connectivity, which can be used to effectively characterize the robustness of complex networks. Numerical experiments suggest that our solution can identify the 'best' choice for node failure attack.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ye Deng
AU  - Jun Wu
AU  - Yue-Jin Tan
PY  - 2016/10
DA  - 2016/10
TI  - Key Nodes Mining Algorithm Based on Complex Network
BT  - Proceedings of the 2016 International Conference on Computational Science and Engineering (ICCSE 2016)
PB  - Atlantis Press
SP  - 54
EP  - 61
SN  - 2352-538X
UR  - https://doi.org/10.2991/iccse-16.2016.10
DO  - 10.2991/iccse-16.2016.10
ID  - Deng2016/10
ER  -