An Algorithm for Critical Nodes Problem in Social Networks Based on Owen Value

被引:2
|
作者
Wang, Xue-Guang [1 ,2 ]
机构
[1] East China Univ Polit Sci & Law, Dept Comp Sci, Shanghai 201620, Peoples R China
[2] UCL, Dept Comp Sci, London WC1E 6BT, England
来源
关键词
D O I
10.1155/2014/414717
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Discovering critical nodes in social networks has many important applications. For finding out the critical nodes and considering the widespread community structure in social networks, we obtain each node's marginal contribution by Owen value. And then we can give a method for the solution of the critical node problem. We validate the feasibility and effectiveness of our method on two synthetic datasets and six real datasets. At the same time, the result obtained by using our method to analyze the terrorist network is in line with the actual situation.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] Research on Critical Nodes Algorithm in Social Complex Networks
    Wang, Xue-Guang
    [J]. OPEN PHYSICS, 2017, 15 (01): : 68 - 73
  • [2] Study on Critical Nodes in Social Networks
    Wang, Xue-Guang
    [J]. 2015 INTERNATIONAL CONFERENCE ON MECHANICAL ENGINEERING AND AUTOMATION (ICMEA 2015), 2015, : 25 - 29
  • [3] Identifying Critical Nodes of Social Networks
    Liu, Xue-hong
    Liang, Gang
    Xu, Chun
    Yang, Jin
    Gong, Xun
    [J]. BASIC & CLINICAL PHARMACOLOGY & TOXICOLOGY, 2020, 126 : 256 - 257
  • [4] A Novel Algorithm for Identifying Critical Nodes in Networks Based on Local Centrality
    Zheng, Wenping
    Wu, Zhikang
    Yang, Gui
    [J]. Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2019, 56 (09): : 1872 - 1880
  • [5] A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks
    Narayanam, Ramasuri
    Narahari, Yadati
    [J]. IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2011, 8 (01) : 130 - 147
  • [6] Efficient Star Nodes Discovery Algorithm in Social Networks Based on Acquaintance Immunization
    Li, Hongbo
    Bai, Jinbo
    Zhang, Jianpei
    Yang, Jing
    Zhao, Yuming
    [J]. 2017 2ND INTERNATIONAL CONFERENCE ON IMAGE, VISION AND COMPUTING (ICIVC 2017), 2017, : 937 - 940
  • [7] DTN Routing Algorithm for Networks with Nodes Social Behavior
    Dziekonski, A. M.
    Schoeneich, R. O.
    [J]. INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2016, 11 (04) : 457 - 471
  • [8] Efficient heuristic algorithm for identifying critical nodes in planar networks
    Purevsuren, Dalaijargal
    Cui, Gang
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2019, 106 : 143 - 153
  • [9] CFIN: A community-based algorithm for finding influential nodes in complex social networks
    Khomami, Mohammad Mehdi Daliri
    Rezvanian, Alireza
    Meybodi, Mohammad Reza
    Bagheri, Alireza
    [J]. JOURNAL OF SUPERCOMPUTING, 2021, 77 (03): : 2207 - 2236
  • [10] CFIN: A community-based algorithm for finding influential nodes in complex social networks
    Mohammad Mehdi Daliri Khomami
    Alireza Rezvanian
    Mohammad Reza Meybodi
    Alireza Bagheri
    [J]. The Journal of Supercomputing, 2021, 77 : 2207 - 2236