基于变压器节点嵌入和深度神经网络的多层社交网络影响最大化

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Xilai Ju , Ali Seyfi , Asgarali Bouyer , Alireza Rouhi , Xiaoyang Liu , Bahman Arasteh
{"title":"基于变压器节点嵌入和深度神经网络的多层社交网络影响最大化","authors":"Xilai Ju ,&nbsp;Ali Seyfi ,&nbsp;Asgarali Bouyer ,&nbsp;Alireza Rouhi ,&nbsp;Xiaoyang Liu ,&nbsp;Bahman Arasteh","doi":"10.1016/j.neucom.2025.130939","DOIUrl":null,"url":null,"abstract":"<div><div>Studies have shown that individuals frequently interact and influence other people within a society. Understanding and identifying influential individuals within a network is crucial for optimizing information diffusion. This challenge, known as influence maximization, has attracted significant attention, particularly in multilayer social networks where individuals participate across diverse contexts. Traditional approaches rely on heuristic or approximation algorithms, but their scalability and adaptability remain limited. In this paper, we propose a novel deep neural network architecture to predict and maximize influence in multilayer social networks. The framework utilizes a combination of node- and layer-specific feature embeddings, a transformer encoder for contextual feature integration, and multilayer perceptron (MLPs) for influence regression. The input comprises feature vectors representing nodes and layers, which are encoded and aggregated to approximate the influence of each node within its respective layer. A final aggregation step computes the total influence spread across layers, enabling efficient seed set selection of highly influential nodes. Our method yields favorable outcomes, effectively tackling challenges such as hardware resource requirements, scalability, and runtime performance. Empirical evaluations against state-of-the-art algorithms demonstrate the effectiveness of the proposed model in achieving superior influence spread with reduced computational overhead. This approach proposes new paths for influence maximization in large-scale, multilayer social networks.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"651 ","pages":"Article 130939"},"PeriodicalIF":5.5000,"publicationDate":"2025-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Influence maximization in multilayer social networks using transformer-based node embeddings and deep neural networks\",\"authors\":\"Xilai Ju ,&nbsp;Ali Seyfi ,&nbsp;Asgarali Bouyer ,&nbsp;Alireza Rouhi ,&nbsp;Xiaoyang Liu ,&nbsp;Bahman Arasteh\",\"doi\":\"10.1016/j.neucom.2025.130939\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Studies have shown that individuals frequently interact and influence other people within a society. Understanding and identifying influential individuals within a network is crucial for optimizing information diffusion. This challenge, known as influence maximization, has attracted significant attention, particularly in multilayer social networks where individuals participate across diverse contexts. Traditional approaches rely on heuristic or approximation algorithms, but their scalability and adaptability remain limited. In this paper, we propose a novel deep neural network architecture to predict and maximize influence in multilayer social networks. The framework utilizes a combination of node- and layer-specific feature embeddings, a transformer encoder for contextual feature integration, and multilayer perceptron (MLPs) for influence regression. The input comprises feature vectors representing nodes and layers, which are encoded and aggregated to approximate the influence of each node within its respective layer. A final aggregation step computes the total influence spread across layers, enabling efficient seed set selection of highly influential nodes. Our method yields favorable outcomes, effectively tackling challenges such as hardware resource requirements, scalability, and runtime performance. Empirical evaluations against state-of-the-art algorithms demonstrate the effectiveness of the proposed model in achieving superior influence spread with reduced computational overhead. This approach proposes new paths for influence maximization in large-scale, multilayer social networks.</div></div>\",\"PeriodicalId\":19268,\"journal\":{\"name\":\"Neurocomputing\",\"volume\":\"651 \",\"pages\":\"Article 130939\"},\"PeriodicalIF\":5.5000,\"publicationDate\":\"2025-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Neurocomputing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S092523122501611X\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S092523122501611X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

研究表明,在一个社会中,个人经常相互作用并影响其他人。了解和识别网络中有影响力的个人对于优化信息传播至关重要。这一挑战被称为影响力最大化,已经引起了极大的关注,特别是在个人参与不同背景的多层社交网络中。传统的方法依赖于启发式或近似算法,但其可扩展性和适应性仍然有限。在本文中,我们提出了一种新的深度神经网络架构来预测和最大化多层社会网络中的影响。该框架结合了特定节点和特定层的特征嵌入、用于上下文特征集成的转换器编码器和用于影响回归的多层感知器(mlp)。输入包括表示节点和层的特征向量,这些特征向量被编码和聚合以近似每个节点在其各自层内的影响。最后的聚合步骤计算跨层的总影响分布,从而实现对高影响节点的有效种子集选择。我们的方法产生了有利的结果,有效地解决了硬件资源需求、可伸缩性和运行时性能等挑战。针对最先进算法的经验评估证明了所提出模型在减少计算开销的情况下实现卓越影响传播的有效性。这种方法提出了在大规模、多层次的社会网络中影响最大化的新途径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Influence maximization in multilayer social networks using transformer-based node embeddings and deep neural networks
Studies have shown that individuals frequently interact and influence other people within a society. Understanding and identifying influential individuals within a network is crucial for optimizing information diffusion. This challenge, known as influence maximization, has attracted significant attention, particularly in multilayer social networks where individuals participate across diverse contexts. Traditional approaches rely on heuristic or approximation algorithms, but their scalability and adaptability remain limited. In this paper, we propose a novel deep neural network architecture to predict and maximize influence in multilayer social networks. The framework utilizes a combination of node- and layer-specific feature embeddings, a transformer encoder for contextual feature integration, and multilayer perceptron (MLPs) for influence regression. The input comprises feature vectors representing nodes and layers, which are encoded and aggregated to approximate the influence of each node within its respective layer. A final aggregation step computes the total influence spread across layers, enabling efficient seed set selection of highly influential nodes. Our method yields favorable outcomes, effectively tackling challenges such as hardware resource requirements, scalability, and runtime performance. Empirical evaluations against state-of-the-art algorithms demonstrate the effectiveness of the proposed model in achieving superior influence spread with reduced computational overhead. This approach proposes new paths for influence maximization in large-scale, multilayer social networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Neurocomputing
Neurocomputing 工程技术-计算机:人工智能
CiteScore
13.10
自引率
10.00%
发文量
1382
审稿时长
70 days
期刊介绍: Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.
×
引用
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学术官方微信