Many Hands Make Light Work: Group Influence Maximization in Evolving Social Networks

IF 5.7 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Yuliang Ma;Yu Chen;Peng Wei;Ye Yuan;Guoren Wang;Zhong-Zhong Jiang
{"title":"Many Hands Make Light Work: Group Influence Maximization in Evolving Social Networks","authors":"Yuliang Ma;Yu Chen;Peng Wei;Ye Yuan;Guoren Wang;Zhong-Zhong Jiang","doi":"10.1109/TBDATA.2024.3499345","DOIUrl":null,"url":null,"abstract":"As the adage “many hands make light work” suggests, collaborative influence often surpasses individual influence. Inspired by this insight, we undertook a study on group influence maximization in evolving social networks, which is applicable to domains such as social media marketing and financial risk management. Our goal is to reveal how collaborative influence propagates in dynamic settings. Existing research concentrates predominantly on static networks and overlooks the dynamics of evolving social structures. Recognizing the limitations of current influence propagation models for our specific issue, we introduce an innovative model rooted in user behaviors. It considers temporal aspects, and we also suggest a methodology for assessing influence propagation probabilities based on both user behaviors and duration. We introduce an algorithm for extracting user groups using community search, improving efficiency through supergraph construction. Additionally, we present an influence maximization algorithm based on group dynamics with a 3-degree propagation framework. Recognizing diminishing influence, a 3-degree truncation strategy effectively enhances the group influence propagation efficiency. This approach efficiently captures the influence spread and accelerates convergence, boosting the search efficiency. Finally, we conducted comprehensive experiments on real-world and synthetic datasets. The results distinctly highlight the superiority of the proposed algorithms.","PeriodicalId":13106,"journal":{"name":"IEEE Transactions on Big Data","volume":"11 4","pages":"1600-1613"},"PeriodicalIF":5.7000,"publicationDate":"2024-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Big Data","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10753648/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

As the adage “many hands make light work” suggests, collaborative influence often surpasses individual influence. Inspired by this insight, we undertook a study on group influence maximization in evolving social networks, which is applicable to domains such as social media marketing and financial risk management. Our goal is to reveal how collaborative influence propagates in dynamic settings. Existing research concentrates predominantly on static networks and overlooks the dynamics of evolving social structures. Recognizing the limitations of current influence propagation models for our specific issue, we introduce an innovative model rooted in user behaviors. It considers temporal aspects, and we also suggest a methodology for assessing influence propagation probabilities based on both user behaviors and duration. We introduce an algorithm for extracting user groups using community search, improving efficiency through supergraph construction. Additionally, we present an influence maximization algorithm based on group dynamics with a 3-degree propagation framework. Recognizing diminishing influence, a 3-degree truncation strategy effectively enhances the group influence propagation efficiency. This approach efficiently captures the influence spread and accelerates convergence, boosting the search efficiency. Finally, we conducted comprehensive experiments on real-world and synthetic datasets. The results distinctly highlight the superiority of the proposed algorithms.
人多力量大:不断发展的社会网络中的群体影响力最大化
正如“人多办事容易”这句谚语所言,集体的影响力往往超过个人的影响力。受此启发,我们对不断发展的社交网络中的群体影响力最大化进行了研究,该研究适用于社交媒体营销和金融风险管理等领域。我们的目标是揭示协作影响是如何在动态环境中传播的。现有的研究主要集中在静态网络上,而忽视了不断发展的社会结构的动态。认识到当前影响传播模型对我们具体问题的局限性,我们引入了一个基于用户行为的创新模型。它考虑了时间方面,我们还提出了一种基于用户行为和持续时间评估影响传播概率的方法。提出了一种基于社区搜索的用户群提取算法,通过构造超图来提高算法的效率。此外,我们提出了一种基于群体动力学的3度传播框架的影响力最大化算法。3度截断策略能够识别影响力的递减,有效地提高了群体影响力的传播效率。该方法有效地捕捉了影响传播,加快了收敛速度,提高了搜索效率。最后,我们在真实世界和合成数据集上进行了综合实验。结果明显表明了所提算法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
11.80
自引率
2.80%
发文量
114
期刊介绍: The IEEE Transactions on Big Data publishes peer-reviewed articles focusing on big data. These articles present innovative research ideas and application results across disciplines, including novel theories, algorithms, and applications. Research areas cover a wide range, such as big data analytics, visualization, curation, management, semantics, infrastructure, standards, performance analysis, intelligence extraction, scientific discovery, security, privacy, and legal issues specific to big data. The journal also prioritizes applications of big data in fields generating massive datasets.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信