• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

可以通过组合经典中心度来普遍识别顶级影响者。

Top influencers can be identified universally by combining classical centralities.

机构信息

Department of Computer Science, University of Twente, Drienerlolaan 5, 7522 NB, Enschede, The Netherlands.

出版信息

Sci Rep. 2020 Nov 25;10(1):20550. doi: 10.1038/s41598-020-77536-7.

DOI:10.1038/s41598-020-77536-7
PMID:33239723
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC7688979/
Abstract

Information flow, opinion, and epidemics spread over structured networks. When using node centrality indicators to predict which nodes will be among the top influencers or superspreaders, no single centrality is a consistently good ranker across networks. We show that statistical classifiers using two or more centralities are instead consistently predictive over many diverse, static real-world topologies. Certain pairs of centralities cooperate particularly well in drawing the statistical boundary between the superspreaders and the rest: a local centrality measuring the size of a node's neighbourhood gains from the addition of a global centrality such as the eigenvector centrality, closeness, or the core number. Intuitively, this is because a local centrality may rank highly nodes which are located in locally dense, but globally peripheral regions of the network. The additional global centrality indicator guides the prediction towards more central regions. The superspreaders usually jointly maximise the values of both centralities. As a result of the interplay between centrality indicators, training classifiers with seven classical indicators leads to a nearly maximum average precision function (0.995) across the networks in this study.

摘要

信息流动、观点和传染病在结构网络上传播。当使用节点中心性指标来预测哪些节点将成为顶级影响者或超级传播者时,没有一个单一的中心性指标在所有网络中都是一致的优秀排名指标。我们表明,使用两个或更多中心性指标的统计分类器在许多不同的静态现实拓扑中具有一致的预测能力。某些中心性对指标对的组合在绘制超级传播者和其他节点之间的统计边界方面特别有效:衡量节点邻居大小的局部中心性指标从附加全局中心性指标(如特征向量中心性、接近度或核心数)中获益。直观地说,这是因为局部中心性可能会对位于网络局部密集但全局外围区域的节点进行高度排名。附加的全局中心性指标指标将预测引导到更中心的区域。超级传播者通常会共同最大化这两个中心性的数值。由于中心性指标之间的相互作用,使用七个经典指标对分类器进行训练,导致在本研究中的网络中,平均精度函数(0.995)接近最大值。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/6508858a20fe/41598_2020_77536_Fig10_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/5bc0dd2d18bf/41598_2020_77536_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/664413df19e0/41598_2020_77536_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/75b4f2d796ec/41598_2020_77536_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/1e8168453e4e/41598_2020_77536_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/71dd4eb72f39/41598_2020_77536_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/a43f5c149f37/41598_2020_77536_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/b1a69504a7ac/41598_2020_77536_Fig7_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/ad2a8b4d962a/41598_2020_77536_Fig8_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/19e1b3b357d1/41598_2020_77536_Fig9_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/6508858a20fe/41598_2020_77536_Fig10_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/5bc0dd2d18bf/41598_2020_77536_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/664413df19e0/41598_2020_77536_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/75b4f2d796ec/41598_2020_77536_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/1e8168453e4e/41598_2020_77536_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/71dd4eb72f39/41598_2020_77536_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/a43f5c149f37/41598_2020_77536_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/b1a69504a7ac/41598_2020_77536_Fig7_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/ad2a8b4d962a/41598_2020_77536_Fig8_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/19e1b3b357d1/41598_2020_77536_Fig9_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2dd8/7688979/6508858a20fe/41598_2020_77536_Fig10_HTML.jpg

相似文献

1
Top influencers can be identified universally by combining classical centralities.可以通过组合经典中心度来普遍识别顶级影响者。
Sci Rep. 2020 Nov 25;10(1):20550. doi: 10.1038/s41598-020-77536-7.
2
Adjustable reach in a network centrality based on current flows.基于电流的网络中心性中的可调可达性。
Phys Rev E. 2021 May;103(5-1):052308. doi: 10.1103/PhysRevE.103.052308.
3
Link Prediction in Complex Networks Using Average Centrality-Based Similarity Score.基于平均中心性相似度得分的复杂网络链路预测
Entropy (Basel). 2024 May 21;26(6):433. doi: 10.3390/e26060433.
4
Fractional centralities on networks: Consolidating the local and the global.网络上的分数中心性:整合局部与全局。
Phys Rev E. 2022 Sep;106(3-1):034310. doi: 10.1103/PhysRevE.106.034310.
5
Unveiling Influence in Networks: A Novel Centrality Metric and Comparative Analysis through Graph-Based Models.揭示网络中的影响力:一种基于图模型的新型中心性度量及比较分析
Entropy (Basel). 2024 May 31;26(6):486. doi: 10.3390/e26060486.
6
Absorbing random walks interpolating between centrality measures on complex networks.在复杂网络上介于中心性度量之间进行插值的吸收随机游走。
Phys Rev E. 2020 Jan;101(1-1):012302. doi: 10.1103/PhysRevE.101.012302.
7
The parallel computing of node centrality based on GPU.基于图形处理器(GPU)的节点中心性并行计算
Math Biosci Eng. 2022 Jan 10;19(3):2700-2719. doi: 10.3934/mbe.2022123.
8
Towards a methodology for validation of centrality measures in complex networks.迈向复杂网络中心性度量验证方法学。
PLoS One. 2014 Apr 7;9(4):e90283. doi: 10.1371/journal.pone.0090283. eCollection 2014.
9
EIGENVECTOR-BASED CENTRALITY MEASURES FOR TEMPORAL NETWORKS.基于特征向量的时间网络中心性度量
Multiscale Model Simul. 2017;15(1):537-574. doi: 10.1137/16M1066142. Epub 2017 Mar 28.
10
Molecular Network Analysis in Rabies Pathogenesis Using Cooperative Game Theory.运用合作博弈理论进行狂犬病发病机制的分子网络分析。
Iran J Biotechnol. 2020 Jul 1;18(3):e2551. doi: 10.30498/IJB.2020.2551. eCollection 2020 Jul.

引用本文的文献

1
A Two-Phase Feature Selection Method for Identifying Influential Spreaders of Disease Epidemics in Complex Networks.一种用于识别复杂网络中疾病流行有影响力传播者的两阶段特征选择方法。
Entropy (Basel). 2023 Jul 15;25(7):1068. doi: 10.3390/e25071068.
2
Ranking influential nodes in complex networks with community structure.基于社区结构的复杂网络中影响力节点的排序。
PLoS One. 2022 Aug 29;17(8):e0273610. doi: 10.1371/journal.pone.0273610. eCollection 2022.

本文引用的文献

1
Finding key players in complex networks through deep reinforcement learning.通过深度强化学习在复杂网络中寻找关键参与者。
Nat Mach Intell. 2020 Jun;2(6):317-324. doi: 10.1038/s42256-020-0177-2. Epub 2020 May 25.
2
Beyond ranking nodes: Predicting epidemic outbreak sizes by network centralities.超越节点排序:通过网络中心度预测疫情爆发规模。
PLoS Comput Biol. 2020 Jul 22;16(7):e1008052. doi: 10.1371/journal.pcbi.1008052. eCollection 2020 Jul.
3
Systematic comparison between methods for the detection of influential spreaders in complex networks.
系统比较复杂网络中影响传播者检测方法。
Sci Rep. 2019 Oct 22;9(1):15095. doi: 10.1038/s41598-019-51209-6.
4
Super-Spreader Identification Using Meta-Centrality.使用介中心度识别超级传播者。
Sci Rep. 2016 Dec 23;6:38994. doi: 10.1038/srep38994.
5
Leveraging percolation theory to single out influential spreaders in networks.利用渗流理论在网络中找出有影响力的传播者。
Phys Rev E. 2016 Jun;93(6):062314. doi: 10.1103/PhysRevE.93.062314. Epub 2016 Jun 22.
6
Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics.从传播动力学角度通过去除冗余链接提高K壳层方法的准确性
Sci Rep. 2015 Aug 17;5:13172. doi: 10.1038/srep13172.
7
Numerical identification of epidemic thresholds for susceptible-infected-recovered model on finite-size networks.有限规模网络上易感-感染-恢复模型流行阈值的数值识别
Chaos. 2015 Jun;25(6):063104. doi: 10.1063/1.4922153.
8
Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition.类核状群组导致通过k-壳层分解识别超级传播者的方法失效。
Sci Rep. 2015 May 6;5:9602. doi: 10.1038/srep09602.
9
Role of centrality for the identification of influential spreaders in complex networks.中心性在复杂网络中识别有影响力的传播者方面的作用。
Phys Rev E Stat Nonlin Soft Matter Phys. 2014 Sep;90(3):032812. doi: 10.1103/PhysRevE.90.032812. Epub 2014 Sep 22.
10
Searching for superspreaders of information in real-world social media.在现实世界的社交媒体中寻找信息的超级传播者。
Sci Rep. 2014 Jul 3;4:5547. doi: 10.1038/srep05547.