GCNT: Identify influential seed set effectively in social networks by integrating graph convolutional networks with graph transformers

IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Jianxin Tang , Jitao Qu , Shihui Song , Zhili Zhao , Qian Du
{"title":"GCNT: Identify influential seed set effectively in social networks by integrating graph convolutional networks with graph transformers","authors":"Jianxin Tang ,&nbsp;Jitao Qu ,&nbsp;Shihui Song ,&nbsp;Zhili Zhao ,&nbsp;Qian Du","doi":"10.1016/j.jksuci.2024.102183","DOIUrl":null,"url":null,"abstract":"<div><p>Exploring effective and efficient strategies for identifying influential nodes from social networks as seeds to promote the propagation of influence remains a crucial challenge in the field of influence maximization (IM), which has attracted significant research efforts. Deep learning-based approaches have been adopted as an alternative promising solution to the IM problem. However, a robust model that captures the associations between network information and node influence needs to be investigated, while concurrently considering the effects of the overlapped influence on training labels. To address these challenges, a GCNT model, which integrates Graph Convolutional Networks with Graph Transformers, is introduced in this paper to capture the intricate relationships among the topology of the network, node attributes, and node influence effectively. Furthermore, an innovative method called <span><math><mrow><mi>G</mi><mi>r</mi><mi>e</mi><mi>e</mi><mi>d</mi><mi>y</mi></mrow></math></span>-<span><math><mrow><mi>L</mi><mi>I</mi><mi>E</mi></mrow></math></span> is proposed to generate labels to alleviate the issue of overlapped influence spread. Moreover, a Mask mechanism specially tailored for the IM problem is presented along with an input embedding balancing strategy. The effectiveness of the GCNT model is demonstrated through comprehensive experiments conducted on six real-world networks, and the model shows its competitive performance in terms of both influence maximization and computational efficiency over state-of-the-art methods.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":null,"pages":null},"PeriodicalIF":5.2000,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002726/pdfft?md5=fb687d0a26ab54db6f7c889e608384a1&pid=1-s2.0-S1319157824002726-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of King Saud University-Computer and Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1319157824002726","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Exploring effective and efficient strategies for identifying influential nodes from social networks as seeds to promote the propagation of influence remains a crucial challenge in the field of influence maximization (IM), which has attracted significant research efforts. Deep learning-based approaches have been adopted as an alternative promising solution to the IM problem. However, a robust model that captures the associations between network information and node influence needs to be investigated, while concurrently considering the effects of the overlapped influence on training labels. To address these challenges, a GCNT model, which integrates Graph Convolutional Networks with Graph Transformers, is introduced in this paper to capture the intricate relationships among the topology of the network, node attributes, and node influence effectively. Furthermore, an innovative method called Greedy-LIE is proposed to generate labels to alleviate the issue of overlapped influence spread. Moreover, a Mask mechanism specially tailored for the IM problem is presented along with an input embedding balancing strategy. The effectiveness of the GCNT model is demonstrated through comprehensive experiments conducted on six real-world networks, and the model shows its competitive performance in terms of both influence maximization and computational efficiency over state-of-the-art methods.

GCNT:通过将图卷积网络与图转换器整合,有效识别社交网络中具有影响力的种子集
在影响力最大化(IM)领域,探索从社交网络中识别有影响力的节点作为种子以促进影响力传播的切实有效的策略仍然是一个重要挑战,吸引了大量研究人员的努力。基于深度学习的方法已被采用,作为解决 IM 问题的另一种有前途的方案。然而,需要研究一种能捕捉网络信息与节点影响力之间关联的稳健模型,同时考虑重叠影响力对训练标签的影响。为了应对这些挑战,本文引入了一个 GCNT 模型,该模型将图卷积网络与图变换器整合在一起,能有效捕捉网络拓扑、节点属性和节点影响力之间错综复杂的关系。此外,本文还提出了一种名为 "Greedy-LIE "的创新方法来生成标签,以缓解影响扩散重叠的问题。此外,还提出了专门针对 IM 问题的掩码机制以及输入嵌入平衡策略。通过在六个真实世界网络上进行的综合实验,证明了 GCNT 模型的有效性,而且该模型在影响力最大化和计算效率方面的表现都优于最先进的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
10.50
自引率
8.70%
发文量
656
审稿时长
29 days
期刊介绍: In 2022 the Journal of King Saud University - Computer and Information Sciences will become an author paid open access journal. Authors who submit their manuscript after October 31st 2021 will be asked to pay an Article Processing Charge (APC) after acceptance of their paper to make their work immediately, permanently, and freely accessible to all. The Journal of King Saud University Computer and Information Sciences is a refereed, international journal that covers all aspects of both foundations of computer and its practical applications.
×
引用
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学术官方微信