Identifying Influential Nodes Based on Evidence Theory in Complex Network.

IF 2.1 3区 物理与天体物理 Q2 PHYSICS, MULTIDISCIPLINARY
Entropy Pub Date : 2025-04-10 DOI:10.3390/e27040406
Fu Tan, Xiaolong Chen, Rui Chen, Ruijie Wang, Chi Huang, Shimin Cai
{"title":"Identifying Influential Nodes Based on Evidence Theory in Complex Network.","authors":"Fu Tan, Xiaolong Chen, Rui Chen, Ruijie Wang, Chi Huang, Shimin Cai","doi":"10.3390/e27040406","DOIUrl":null,"url":null,"abstract":"<p><p>Influential node identification is an important and hot topic in the field of complex network science. Classical algorithms for identifying influential nodes are typically based on a single attribute of nodes or the simple fusion of a few attributes. However, these methods perform poorly in real networks with high complexity and diversity. To address this issue, a new method based on the Dempster-Shafer (DS) evidence theory is proposed in this paper, which improves the efficiency of identifying influential nodes through the following three aspects. Firstly, Dempster-Shafer evidence theory quantifies uncertainty through its basic belief assignment function and combines evidence from different information sources, enabling it to effectively handle uncertainty. Secondly, Dempster-Shafer evidence theory processes conflicting evidence using Dempster's rule of combination, enhancing the reliability of decision-making. Lastly, in complex networks, information may come from multiple dimensions, and the Dempster-Shafer theory can effectively integrate this multidimensional information. To verify the effectiveness of the proposed method, extensive experiments are conducted on real-world complex networks. The results show that, compared to the other algorithms, attacking the influential nodes identified by the DS method is more likely to lead to the disintegration of the network, which indicates that the DS method is more effective for identifying the key nodes in the network. To further validate the reliability of the proposed algorithm, we use the visibility graph algorithm to convert the GBP futures time series into a complex network and then rank the nodes in the network using the DS method. The results show that the top-ranked nodes correspond to the peaks and troughs of the time series, which represents the key turning points in price changes. By conducting an in-depth analysis, investors can uncover major events that influence price trends, once again confirming the effectiveness of the algorithm.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 4","pages":""},"PeriodicalIF":2.1000,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12025453/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Entropy","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.3390/e27040406","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Influential node identification is an important and hot topic in the field of complex network science. Classical algorithms for identifying influential nodes are typically based on a single attribute of nodes or the simple fusion of a few attributes. However, these methods perform poorly in real networks with high complexity and diversity. To address this issue, a new method based on the Dempster-Shafer (DS) evidence theory is proposed in this paper, which improves the efficiency of identifying influential nodes through the following three aspects. Firstly, Dempster-Shafer evidence theory quantifies uncertainty through its basic belief assignment function and combines evidence from different information sources, enabling it to effectively handle uncertainty. Secondly, Dempster-Shafer evidence theory processes conflicting evidence using Dempster's rule of combination, enhancing the reliability of decision-making. Lastly, in complex networks, information may come from multiple dimensions, and the Dempster-Shafer theory can effectively integrate this multidimensional information. To verify the effectiveness of the proposed method, extensive experiments are conducted on real-world complex networks. The results show that, compared to the other algorithms, attacking the influential nodes identified by the DS method is more likely to lead to the disintegration of the network, which indicates that the DS method is more effective for identifying the key nodes in the network. To further validate the reliability of the proposed algorithm, we use the visibility graph algorithm to convert the GBP futures time series into a complex network and then rank the nodes in the network using the DS method. The results show that the top-ranked nodes correspond to the peaks and troughs of the time series, which represents the key turning points in price changes. By conducting an in-depth analysis, investors can uncover major events that influence price trends, once again confirming the effectiveness of the algorithm.

基于证据理论的复杂网络影响节点识别。
影响节点识别是复杂网络科学领域的一个重要热点问题。识别影响节点的经典算法通常基于节点的单个属性或几个属性的简单融合。然而,这些方法在复杂和多样化的实际网络中表现不佳。针对这一问题,本文提出了一种基于Dempster-Shafer (DS)证据理论的新方法,该方法通过以下三个方面提高了识别影响节点的效率。首先,Dempster-Shafer证据理论通过其基本信念赋值函数对不确定性进行量化,并结合不同信息源的证据,使其能够有效处理不确定性。其次,Dempster- shafer证据理论利用Dempster的组合规则对冲突证据进行处理,提高了决策的可靠性。最后,在复杂网络中,信息可能来自多个维度,Dempster-Shafer理论可以有效地整合这些多维信息。为了验证所提方法的有效性,在真实的复杂网络上进行了大量的实验。结果表明,与其他算法相比,攻击由DS方法识别的有影响的节点更容易导致网络的解体,这表明DS方法对于识别网络中的关键节点更为有效。为了进一步验证所提算法的可靠性,我们使用可见性图算法将GBP期货时间序列转换成一个复杂网络,然后使用DS方法对网络中的节点进行排序。结果表明,排名靠前的节点对应于时间序列的波峰和波谷,代表了价格变化的关键转折点。通过深入分析,投资者可以发现影响价格趋势的重大事件,再次确认算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Entropy
Entropy PHYSICS, MULTIDISCIPLINARY-
CiteScore
4.90
自引率
11.10%
发文量
1580
审稿时长
21.05 days
期刊介绍: Entropy (ISSN 1099-4300), an international and interdisciplinary journal of entropy and information studies, publishes reviews, regular research papers and short notes. Our aim is to encourage scientists to publish as much as possible their theoretical and experimental details. There is no restriction on the length of the papers. If there are computation and the experiment, the details must be provided so that the results can be reproduced.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信