PPEIM:一种基于偏好路径的局部密集多核网络影响节点识别早期影响积累模型

IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Yaofang Zhang , Zibo Wang , Yang Liu , Ruohan Zhao , Hongri Liu , Bailing Wang
{"title":"PPEIM:一种基于偏好路径的局部密集多核网络影响节点识别早期影响积累模型","authors":"Yaofang Zhang ,&nbsp;Zibo Wang ,&nbsp;Yang Liu ,&nbsp;Ruohan Zhao ,&nbsp;Hongri Liu ,&nbsp;Bailing Wang","doi":"10.1016/j.jocs.2024.102479","DOIUrl":null,"url":null,"abstract":"<div><div>The identification of influential nodes, a critical problem in the field of complex networks, has been extensively studied. However, previous research has primarily focused on maximizing terminal influence across all network structures indiscriminately, making it challenging to accurately identify influential nodes in specific structures. Moreover, overlooking the influence of the temporal dynamics of propagation significantly diminishes the benefits of identifying influential nodes. Therefore, we propose an influential nodes identification model, Preference Path-based Early-stage Influence Accumulation Model (PPEIM), tailored for typical locally dense multi-core networks. The key idea of PPEIM is to identify more influential nodes in early-stage propagation by aggregating dynamic influence propagation volumes superimposed on multiple paths. Specifically, early-stage influence performance is enhanced by sampling paths, mitigating the risk of dense influential nodes resulting from redundant relationships. Moreover, the K-shell, degree, influence distance and link direction are integrated to define connection strength between nodes to guide path selection. And the concept of influence propagation volume is introduced to accurately simulate the influence residuals and losses during the propagation process. To validate the effectiveness and superiority of PPEIM in locally dense multi-core networks, five sets of simulation experiments are conducted on seven real-world datasets. Experimental results demonstrate that PPEIM outperforms six state-of-the-art methods in overall propagation capability, early-stage influence capability, disintegration capability, node dispersion, and discrimination capability.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"85 ","pages":"Article 102479"},"PeriodicalIF":3.1000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PPEIM: A preference path-based early-stage influence accumulation model for influential nodes identification in locally dense multi-core networks\",\"authors\":\"Yaofang Zhang ,&nbsp;Zibo Wang ,&nbsp;Yang Liu ,&nbsp;Ruohan Zhao ,&nbsp;Hongri Liu ,&nbsp;Bailing Wang\",\"doi\":\"10.1016/j.jocs.2024.102479\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The identification of influential nodes, a critical problem in the field of complex networks, has been extensively studied. However, previous research has primarily focused on maximizing terminal influence across all network structures indiscriminately, making it challenging to accurately identify influential nodes in specific structures. Moreover, overlooking the influence of the temporal dynamics of propagation significantly diminishes the benefits of identifying influential nodes. Therefore, we propose an influential nodes identification model, Preference Path-based Early-stage Influence Accumulation Model (PPEIM), tailored for typical locally dense multi-core networks. The key idea of PPEIM is to identify more influential nodes in early-stage propagation by aggregating dynamic influence propagation volumes superimposed on multiple paths. Specifically, early-stage influence performance is enhanced by sampling paths, mitigating the risk of dense influential nodes resulting from redundant relationships. Moreover, the K-shell, degree, influence distance and link direction are integrated to define connection strength between nodes to guide path selection. And the concept of influence propagation volume is introduced to accurately simulate the influence residuals and losses during the propagation process. To validate the effectiveness and superiority of PPEIM in locally dense multi-core networks, five sets of simulation experiments are conducted on seven real-world datasets. Experimental results demonstrate that PPEIM outperforms six state-of-the-art methods in overall propagation capability, early-stage influence capability, disintegration capability, node dispersion, and discrimination capability.</div></div>\",\"PeriodicalId\":48907,\"journal\":{\"name\":\"Journal of Computational Science\",\"volume\":\"85 \",\"pages\":\"Article 102479\"},\"PeriodicalIF\":3.1000,\"publicationDate\":\"2025-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1877750324002722\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1877750324002722","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

影响节点的识别是复杂网络领域的一个关键问题,已经得到了广泛的研究。然而,以往的研究主要集中在不分青红皂白地最大化所有网络结构的终端影响,这使得准确识别特定结构中的影响节点具有挑战性。此外,忽略传播时间动态的影响会大大降低识别有影响节点的好处。因此,针对典型的局部密集多核网络,我们提出了一种基于偏好路径的早期影响积累模型(PPEIM)。PPEIM的核心思想是通过聚合叠加在多个路径上的动态影响传播体,识别早期传播中影响较大的节点。具体而言,通过采样路径增强了早期影响性能,降低了冗余关系导致的密集影响节点的风险。并综合k壳、度、影响距离、链路方向来定义节点间的连接强度,指导路径选择。并引入影响传播体积的概念,准确模拟了影响传播过程中的影响残差和损失。为了验证PPEIM在局部密集多核网络中的有效性和优越性,在7个真实数据集上进行了5组仿真实验。实验结果表明,PPEIM在整体传播能力、早期影响能力、解体能力、节点分散能力和识别能力等方面都优于6种最先进的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
PPEIM: A preference path-based early-stage influence accumulation model for influential nodes identification in locally dense multi-core networks
The identification of influential nodes, a critical problem in the field of complex networks, has been extensively studied. However, previous research has primarily focused on maximizing terminal influence across all network structures indiscriminately, making it challenging to accurately identify influential nodes in specific structures. Moreover, overlooking the influence of the temporal dynamics of propagation significantly diminishes the benefits of identifying influential nodes. Therefore, we propose an influential nodes identification model, Preference Path-based Early-stage Influence Accumulation Model (PPEIM), tailored for typical locally dense multi-core networks. The key idea of PPEIM is to identify more influential nodes in early-stage propagation by aggregating dynamic influence propagation volumes superimposed on multiple paths. Specifically, early-stage influence performance is enhanced by sampling paths, mitigating the risk of dense influential nodes resulting from redundant relationships. Moreover, the K-shell, degree, influence distance and link direction are integrated to define connection strength between nodes to guide path selection. And the concept of influence propagation volume is introduced to accurately simulate the influence residuals and losses during the propagation process. To validate the effectiveness and superiority of PPEIM in locally dense multi-core networks, five sets of simulation experiments are conducted on seven real-world datasets. Experimental results demonstrate that PPEIM outperforms six state-of-the-art methods in overall propagation capability, early-stage influence capability, disintegration capability, node dispersion, and discrimination capability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Computational Science
Journal of Computational Science COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
5.50
自引率
3.00%
发文量
227
审稿时长
41 days
期刊介绍: Computational Science is a rapidly growing multi- and interdisciplinary field that uses advanced computing and data analysis to understand and solve complex problems. It has reached a level of predictive capability that now firmly complements the traditional pillars of experimentation and theory. The recent advances in experimental techniques such as detectors, on-line sensor networks and high-resolution imaging techniques, have opened up new windows into physical and biological processes at many levels of detail. The resulting data explosion allows for detailed data driven modeling and simulation. This new discipline in science combines computational thinking, modern computational methods, devices and collateral technologies to address problems far beyond the scope of traditional numerical methods. Computational science typically unifies three distinct elements: • Modeling, Algorithms and Simulations (e.g. numerical and non-numerical, discrete and continuous); • Software developed to solve science (e.g., biological, physical, and social), engineering, medicine, and humanities problems; • Computer and information science that develops and optimizes the advanced system hardware, software, networking, and data management components (e.g. problem solving environments).
×
引用
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学术官方微信