Memory-based walk-enhanced dynamic graph neural network for temporal graph representation learning

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Neurocomputing Pub Date : 2025-02-22 DOI:10.1016/j.neucom.2025.129759
Zhigang Jin , Renjun Su , Hao Zhang , Xiaofang Zhao
{"title":"Memory-based walk-enhanced dynamic graph neural network for temporal graph representation learning","authors":"Zhigang Jin ,&nbsp;Renjun Su ,&nbsp;Hao Zhang ,&nbsp;Xiaofang Zhao","doi":"10.1016/j.neucom.2025.129759","DOIUrl":null,"url":null,"abstract":"<div><div>Depending on the ability of obtaining low-dimensional representations of nodes that preserve valuable structural information, graph representation learning has a wide range of applications in graph analysis and inference. However, real-world complex systems are naturally heterogeneous and time-varying, which makes it difficult to learn high-quality node representations. We propose a <strong>M</strong>emory-based <strong>W</strong>alk-enhanced <strong>D</strong>ynamic <strong>G</strong>raph neural <strong>N</strong>etwork (denoted as MWDGN) to fully exploit the dependencies and structural features in temporal graph. To capture long-term dependencies, we use a memory module to store and evolve dynamic node representations. MWDGN captures network structural information by constructing time-constrained walk sequences for each interaction node. The walk sequence features are creatively integrated into the update process of memory module, so as to capture the useful information of neighborhood structure features for the interaction node while preserving the long-term dependency of the temporal graph. In addition, we focus on the enlightenment of non-negligible temporal information for sensing key historical interaction nodes of the target node, and design a new aggregation method of historical interaction nodes information. It exploits the temporal attenuation effect of event impact to model short-term dependencies. We further exploit causal convolutional network to mine the potential associations of historical interaction node features of the target node. Comparison experiments on six datasets with mainstream baseline models demonstrate that MWDGN is capable of jointly extracting the heterogeneity and evolutionary patterns of nodes in the graph, improving the node representation quality, and enhancing the performance of the temporal link prediction and dynamic node classification tasks. The effectiveness of the proposed model is further proved by time complexity analysis, ablation study and parameter sensitivity analysis.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"633 ","pages":"Article 129759"},"PeriodicalIF":5.5000,"publicationDate":"2025-02-22","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/S092523122500431X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Depending on the ability of obtaining low-dimensional representations of nodes that preserve valuable structural information, graph representation learning has a wide range of applications in graph analysis and inference. However, real-world complex systems are naturally heterogeneous and time-varying, which makes it difficult to learn high-quality node representations. We propose a Memory-based Walk-enhanced Dynamic Graph neural Network (denoted as MWDGN) to fully exploit the dependencies and structural features in temporal graph. To capture long-term dependencies, we use a memory module to store and evolve dynamic node representations. MWDGN captures network structural information by constructing time-constrained walk sequences for each interaction node. The walk sequence features are creatively integrated into the update process of memory module, so as to capture the useful information of neighborhood structure features for the interaction node while preserving the long-term dependency of the temporal graph. In addition, we focus on the enlightenment of non-negligible temporal information for sensing key historical interaction nodes of the target node, and design a new aggregation method of historical interaction nodes information. It exploits the temporal attenuation effect of event impact to model short-term dependencies. We further exploit causal convolutional network to mine the potential associations of historical interaction node features of the target node. Comparison experiments on six datasets with mainstream baseline models demonstrate that MWDGN is capable of jointly extracting the heterogeneity and evolutionary patterns of nodes in the graph, improving the node representation quality, and enhancing the performance of the temporal link prediction and dynamic node classification tasks. The effectiveness of the proposed model is further proved by time complexity analysis, ablation study and parameter sensitivity analysis.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
图表示学习能够获得保留有价值结构信息的低维节点表示,因此在图分析和推理中有着广泛的应用。然而,现实世界中的复杂系统具有天然的异质性和时变性,这使得学习高质量的节点表征变得十分困难。我们提出了一种基于记忆的步行增强动态图神经网络(简称 MWDGN),以充分利用时序图中的依赖关系和结构特征。为了捕捉长期依赖关系,我们使用记忆模块来存储和演化动态节点表征。MWDGN 通过为每个交互节点构建受时间限制的行走序列来捕捉网络结构信息。行走序列特征被创造性地集成到内存模块的更新过程中,从而在捕捉交互节点邻域结构特征的有用信息的同时,保留了时序图的长期依赖性。此外,我们还注重对感知目标节点关键历史交互节点的不可忽略的时间信息的启示,并设计了一种新的历史交互节点信息聚合方法。它利用事件影响的时间衰减效应来建立短期依赖关系模型。我们进一步利用因果卷积网络挖掘目标节点历史交互节点特征的潜在关联。在六个数据集上与主流基线模型的对比实验表明,MWDGN 能够联合提取图中节点的异质性和演化模式,改善节点表示质量,提高时序链接预测和动态节点分类任务的性能。时间复杂性分析、消融研究和参数敏感性分析进一步证明了所提模型的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
Editorial Board Momentum gradient-based untargeted poisoning attack on hypergraph neural networks Memo-UNet: Leveraging historical information for enhanced wave height prediction LN-DETR: An efficient Transformer architecture for lung nodule detection with multi-scale feature fusion CMGN: Text GNN and RWKV MLP-mixer combined with cross-feature fusion for fake news detection
×
引用
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