• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

基于投票能力自适应调整的影响力节点识别方法

Influential nodes identification method based on adaptive adjustment of voting ability.

作者信息

Wang Guan, Alias Syazwina Binti, Sun Zejun, Wang Feifei, Fan Aiwan, Hu Haifeng

机构信息

School of Information Engineering, Pingdingshan University, Pingdingshan, Henan, China.

Faculty of Engineering, Built Environment & Information Technology, SEGI University, Malaysia.

出版信息

Heliyon. 2023 May 10;9(5):e16112. doi: 10.1016/j.heliyon.2023.e16112. eCollection 2023 May.

DOI:10.1016/j.heliyon.2023.e16112
PMID:37215850
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC10196995/
Abstract

Influential nodes identification technology is one of the important topics which has been widely applied to logistics node location, social information dissemination, transportation network carrying, biological virus dissemination, power network anti-destruction, etc. At present, a large number of influential nodes identification methods have been studied, but the algorithms that are simple to execute, have high accuracy and can be better applied to real networks are still the focus of research. Therefore, due to the advantages of simple to execute in voting mechanism, a novel algorithm based on adaptive adjustment of voting ability (AAVA) to identify the influential nodes is presented by considering the local attributes of node and the voting contribution of its neighbor nodes, to solve the problem of low accuracy and discrimination of the existing algorithms. This proposed algorithm uses the similarity between the voting node and the voted node to dynamically adjust its voting ability without setting any parameters, so that a node can contribute different voting abilities to different neighbor nodes. To verify the performance of AAVA algorithm, the running results of 13 algorithms are analyzed and compared on 10 different networks with the SIR model as a reference. The experimental results show that the influential nodes identified by AAVA have high consistency with SIR model in Top-10 nodes and Kendall correlation, and have better infection effect of the network. Therefore, it is proved that AAV algorithm has high accuracy and effectiveness, and can be applied to real complex networks of different types and sizes.

摘要

影响力节点识别技术是重要研究课题之一,已广泛应用于物流节点选址、社会信息传播、交通网络承载、生物病毒传播、电网抗破坏等领域。目前,已有大量影响力节点识别方法被研究,但执行简单、精度高且能更好应用于实际网络的算法仍是研究重点。因此,鉴于投票机制执行简单的优点,通过考虑节点局部属性及其邻居节点的投票贡献,提出一种基于投票能力自适应调整(AAVA)的新型影响力节点识别算法,以解决现有算法精度低和区分度差的问题。该算法利用投票节点与被投票节点之间的相似度动态调整投票能力,无需设置任何参数,使得一个节点能对不同邻居节点贡献不同的投票能力。为验证AAVA算法性能,以SIR模型为参照,在10个不同网络上分析比较了13种算法的运行结果。实验结果表明,AAVA识别出的影响力节点在Top-10节点和肯德尔相关性方面与SIR模型具有高度一致性,且对网络具有更好的感染效果。因此,证明AAV算法具有高精度和有效性,可应用于不同类型和规模的实际复杂网络。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d28c/10196995/afca74be7e9b/gr5a.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d28c/10196995/5c13d0b6848d/gr1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d28c/10196995/0decb00f4093/gr2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d28c/10196995/823bca8e2463/gr3a.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d28c/10196995/f65cba1f3063/gr4a.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d28c/10196995/afca74be7e9b/gr5a.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d28c/10196995/5c13d0b6848d/gr1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d28c/10196995/0decb00f4093/gr2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d28c/10196995/823bca8e2463/gr3a.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d28c/10196995/f65cba1f3063/gr4a.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d28c/10196995/afca74be7e9b/gr5a.jpg

相似文献

1
Influential nodes identification method based on adaptive adjustment of voting ability.基于投票能力自适应调整的影响力节点识别方法
Heliyon. 2023 May 10;9(5):e16112. doi: 10.1016/j.heliyon.2023.e16112. eCollection 2023 May.
2
Identifying Influential Nodes in Social Networks: Exploiting Self-Voting Mechanism.识别社交网络中的影响力节点:利用自我投票机制。
Big Data. 2023 Aug;11(4):296-306. doi: 10.1089/big.2022.0165. Epub 2023 Apr 19.
3
Influential nodes identification using network local structural properties.基于网络局部结构属性的影响节点识别。
Sci Rep. 2022 Feb 3;12(1):1833. doi: 10.1038/s41598-022-05564-6.
4
Exploring influential nodes using global and local information.利用全局和局部信息探索影响节点。
Sci Rep. 2022 Dec 29;12(1):22506. doi: 10.1038/s41598-022-26984-4.
5
Finding influential nodes in complex networks based on Kullback-Leibler model within the neighborhood.基于邻域内库尔贝克-莱布勒模型在复杂网络中寻找有影响力的节点。
Sci Rep. 2024 Jun 10;14(1):13269. doi: 10.1038/s41598-024-64122-4.
6
Prediction of influential nodes in social networks based on local communities and users' reaction information.基于局部社区和用户反应信息的社交网络中有影响力节点的预测。
Sci Rep. 2024 Jul 9;14(1):15815. doi: 10.1038/s41598-024-66277-6.
7
Identifying Influential Nodes in Complex Networks Based on Information Entropy and Relationship Strength.基于信息熵和关系强度识别复杂网络中的有影响力节点
Entropy (Basel). 2023 May 5;25(5):754. doi: 10.3390/e25050754.
8
Influential Nodes Identification in Complex Networks via Information Entropy.基于信息熵的复杂网络中有影响力节点识别
Entropy (Basel). 2020 Feb 21;22(2):242. doi: 10.3390/e22020242.
9
Comprehensive influence of topological location and neighbor information on identifying influential nodes in complex networks.拓扑位置和邻居信息对识别复杂网络中影响节点的综合影响。
PLoS One. 2021 May 21;16(5):e0251208. doi: 10.1371/journal.pone.0251208. eCollection 2021.
10
Controlling COVID-19 transmission with isolation of influential nodes.通过隔离有影响力的节点来控制新冠病毒传播。
Chaos Solitons Fractals. 2022 Jun;159:112035. doi: 10.1016/j.chaos.2022.112035. Epub 2022 Apr 5.

引用本文的文献

1
Identifying influential spreaders based on improving communication transmission model and network structure.基于改进的通信传输模型和网络结构识别有影响力的传播者。
Sci Rep. 2025 Mar 18;15(1):9380. doi: 10.1038/s41598-025-93387-6.
2
A novel voting measure for identifying influential nodes in complex networks based on local structure.一种基于局部结构识别复杂网络中影响力节点的新型投票方法。
Sci Rep. 2025 Jan 11;15(1):1693. doi: 10.1038/s41598-025-85332-4.
3
Finding influential nodes in complex networks based on Kullback-Leibler model within the neighborhood.

本文引用的文献

1
Exploring influential nodes using global and local information.利用全局和局部信息探索影响节点。
Sci Rep. 2022 Dec 29;12(1):22506. doi: 10.1038/s41598-022-26984-4.
2
Identification of nodes influence based on global structure model in complex networks.基于复杂网络全局结构模型的节点影响识别。
Sci Rep. 2021 Mar 17;11(1):6173. doi: 10.1038/s41598-021-84684-x.
3
Spectral Learning Algorithm Reveals Propagation Capability of Complex Networks.谱学习算法揭示复杂网络的传播能力。
基于邻域内库尔贝克-莱布勒模型在复杂网络中寻找有影响力的节点。
Sci Rep. 2024 Jun 10;14(1):13269. doi: 10.1038/s41598-024-64122-4.
4
Excavating important nodes in complex networks based on the heat conduction model.基于热传导模型挖掘复杂网络中的重要节点。
Sci Rep. 2024 Apr 2;14(1):7740. doi: 10.1038/s41598-024-58320-3.
IEEE Trans Cybern. 2019 Dec;49(12):4253-4261. doi: 10.1109/TCYB.2018.2861568. Epub 2018 Aug 21.
4
Identifying a set of influential spreaders in complex networks.识别复杂网络中的一组有影响力的传播者。
Sci Rep. 2016 Jun 14;6:27823. doi: 10.1038/srep27823.
5
The H-index of a network node and its relation to degree and coreness.网络节点的H指数及其与度和核数的关系。
Nat Commun. 2016 Jan 12;7:10168. doi: 10.1038/ncomms10168.
6
Epidemic dynamics and endemic states in complex networks.复杂网络中的流行病动力学和地方病状态
Phys Rev E Stat Nonlin Soft Matter Phys. 2001 Jun;63(6 Pt 2):066117. doi: 10.1103/PhysRevE.63.066117. Epub 2001 May 22.
7
Epidemic spreading in scale-free networks.无标度网络中的流行病传播。
Phys Rev Lett. 2001 Apr 2;86(14):3200-3. doi: 10.1103/PhysRevLett.86.3200.
8
The centrality of a graph.图的中心性
Psychometrika. 1966 Dec;31(4):581-603. doi: 10.1007/BF02289527.