Maximizing influence via link prediction in evolving networks

IF 2.3 Q2 COMPUTER SCIENCE, THEORY & METHODS Array Pub Date : 2024-09-28 DOI:10.1016/j.array.2024.100366
{"title":"Maximizing influence via link prediction in evolving networks","authors":"","doi":"10.1016/j.array.2024.100366","DOIUrl":null,"url":null,"abstract":"<div><div><em>Influence Maximization</em> (IM), targeting the optimal selection of <span><math><mi>k</mi></math></span> seed nodes to maximize potential information dissemination in prospectively social networks, garners pivotal interest in diverse realms like viral marketing and political discourse dissemination. Despite receiving substantial scholarly attention, prevailing research predominantly addresses the IM problem within the confines of existing networks, thereby neglecting the dynamic evolutionary character of social networks. An inevitable requisite arises to explore the IM problem in social networks of future contexts, which is imperative for certain application scenarios. In this light, we introduce a novel problem, Influence Maximization in Future Networks (IMFN), aimed at resolving the IM problem within an anticipated future network framework. We establish that the IMFN problem is NP-hard and advocate a prospective solution framework, employing judiciously selected link prediction methods to forecast the future network, and subsequently applying a greedy algorithm to select the <span><math><mi>k</mi></math></span> most influential nodes. Moreover, we present SCOL (Sketch-based Cost-effective lazy forward selection algorithm Optimized with Labeling technique), a well-designed algorithm to accelerate the query of our IMFN problem. Extensive experimental results, rooted in five real-world datasets, are provided, affirming the efficacy and efficiency of the proffered solution and algorithms.</div></div>","PeriodicalId":8417,"journal":{"name":"Array","volume":null,"pages":null},"PeriodicalIF":2.3000,"publicationDate":"2024-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Array","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2590005624000328","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Influence Maximization (IM), targeting the optimal selection of k seed nodes to maximize potential information dissemination in prospectively social networks, garners pivotal interest in diverse realms like viral marketing and political discourse dissemination. Despite receiving substantial scholarly attention, prevailing research predominantly addresses the IM problem within the confines of existing networks, thereby neglecting the dynamic evolutionary character of social networks. An inevitable requisite arises to explore the IM problem in social networks of future contexts, which is imperative for certain application scenarios. In this light, we introduce a novel problem, Influence Maximization in Future Networks (IMFN), aimed at resolving the IM problem within an anticipated future network framework. We establish that the IMFN problem is NP-hard and advocate a prospective solution framework, employing judiciously selected link prediction methods to forecast the future network, and subsequently applying a greedy algorithm to select the k most influential nodes. Moreover, we present SCOL (Sketch-based Cost-effective lazy forward selection algorithm Optimized with Labeling technique), a well-designed algorithm to accelerate the query of our IMFN problem. Extensive experimental results, rooted in five real-world datasets, are provided, affirming the efficacy and efficiency of the proffered solution and algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过演化网络中的链接预测实现影响力最大化
影响最大化(Influence Maximization,IM)的目标是优化 k 个种子节点的选择,以最大限度地提高潜在信息在前瞻性社交网络中的传播,它在病毒式营销和政治言论传播等不同领域引起了举足轻重的关注。尽管受到大量学者的关注,但目前的研究主要是在现有网络的范围内解决 IM 问题,从而忽视了社交网络的动态演化特性。探索未来社会网络中的即时通讯问题是一个必然的要求,这在某些应用场景中势在必行。有鉴于此,我们引入了一个新问题--未来网络中的影响力最大化(IMFN),旨在解决预期未来网络框架中的 IM 问题。我们发现 IMFN 问题具有 NP 难度,并提出了一种前瞻性的解决框架,即采用明智选择的链接预测方法来预测未来网络,然后应用贪婪算法来选择 k 个最具影响力的节点。此外,我们还提出了 SCOL(基于草图的高成本效益懒惰前向选择算法(Scetch-based Cost-effective lazy forward selection algorithm Optimized with Labeling technique),这是一种精心设计的算法,可加速对 IMFN 问题的查询。我们提供了基于五个真实数据集的大量实验结果,肯定了所提出的解决方案和算法的功效和效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Array
Array Computer Science-General Computer Science
CiteScore
4.40
自引率
0.00%
发文量
93
审稿时长
45 days
期刊最新文献
Combining computational linguistics with sentence embedding to create a zero-shot NLIDB Development of automatic CNC machine with versatile applications in art, design, and engineering Dual-model approach for one-shot lithium-ion battery state of health sequence prediction Maximizing influence via link prediction in evolving networks Assessing generalizability of Deep Reinforcement Learning algorithms for Automated Vulnerability Assessment and Penetration Testing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1