用于连续时间动态事件序列的时序图网络

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Ke Cheng, Junchen Ye, Xiaodong Lu, Leilei Sun, Bowen Du
{"title":"用于连续时间动态事件序列的时序图网络","authors":"Ke Cheng,&nbsp;Junchen Ye,&nbsp;Xiaodong Lu,&nbsp;Leilei Sun,&nbsp;Bowen Du","doi":"10.1016/j.knosys.2024.112452","DOIUrl":null,"url":null,"abstract":"<div><p>Continuous-Time Dynamic Graph (CTDG) methods have shown their superior ability in learning representations for dynamic graph-structured data, the methods split the sequential updating process into discrete batches to reduce the computation costs, as a result, the message constructor in existing CTDG methods cannot be optimized by gradient descent and is designed to be parameter-free. In particular, this layer fails to embed complex event subgraphs and ignores the structure information, while most real-world events are structured and complex. For example, a paper publication event in an academic graph contains different relations like authorship and citations. Furthermore, the corresponding nodes could not receive position-wise messages to make precise representation updates. To tackle this issue, we propose a new method called Temporal Graph Network for continuous-time dynamic Event sequence (TGNE) with a structure-aware message constructor to update node representation with complex event subgraph, by treating message construction and delivery as a message-passing process, in this way, the message constructor can be formalized as a graph neural network layer. TGNE extends the input of CTDG methods to subgraphs with complex structures and preserves more information in message delivery. Extensive experiments demonstrate that the proposed method can achieve competitive performance on traditional tasks on bipartite graphs and event sequence learning tasks on heterogeneous graphs.</p></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":null,"pages":null},"PeriodicalIF":7.2000,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Temporal Graph Network for continuous-time dynamic event sequence\",\"authors\":\"Ke Cheng,&nbsp;Junchen Ye,&nbsp;Xiaodong Lu,&nbsp;Leilei Sun,&nbsp;Bowen Du\",\"doi\":\"10.1016/j.knosys.2024.112452\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Continuous-Time Dynamic Graph (CTDG) methods have shown their superior ability in learning representations for dynamic graph-structured data, the methods split the sequential updating process into discrete batches to reduce the computation costs, as a result, the message constructor in existing CTDG methods cannot be optimized by gradient descent and is designed to be parameter-free. In particular, this layer fails to embed complex event subgraphs and ignores the structure information, while most real-world events are structured and complex. For example, a paper publication event in an academic graph contains different relations like authorship and citations. Furthermore, the corresponding nodes could not receive position-wise messages to make precise representation updates. To tackle this issue, we propose a new method called Temporal Graph Network for continuous-time dynamic Event sequence (TGNE) with a structure-aware message constructor to update node representation with complex event subgraph, by treating message construction and delivery as a message-passing process, in this way, the message constructor can be formalized as a graph neural network layer. TGNE extends the input of CTDG methods to subgraphs with complex structures and preserves more information in message delivery. Extensive experiments demonstrate that the proposed method can achieve competitive performance on traditional tasks on bipartite graphs and event sequence learning tasks on heterogeneous graphs.</p></div>\",\"PeriodicalId\":49939,\"journal\":{\"name\":\"Knowledge-Based Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2024-09-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Knowledge-Based Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0950705124010864\",\"RegionNum\":1,\"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":"Knowledge-Based Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0950705124010864","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

连续时间动态图(Continuous-Time Dynamic Graph,CTDG)方法在学习动态图结构数据的表征方面表现出了卓越的能力,这些方法将连续更新过程分割成离散的批次,以降低计算成本,因此,现有 CTDG 方法中的消息构造函数无法通过梯度下降进行优化,其设计是无参数的。尤其是,这一层无法嵌入复杂的事件子图,也忽略了结构信息,而现实世界中的大多数事件都是结构复杂的。例如,学术图谱中的论文发表事件包含作者和引用等不同关系。此外,相应的节点无法接收位置信息来进行精确的表示更新。为了解决这个问题,我们提出了一种名为连续时间动态事件序列时序图网络(Temporal Graph Network for continuous-time dynamic Event sequence,TGNE)的新方法,它具有结构感知的消息构造器,可以更新具有复杂事件子图的节点表示。TGNE 将 CTDG 方法的输入扩展到了具有复杂结构的子图中,并在信息传递过程中保留了更多信息。大量实验证明,所提出的方法可以在双方图上的传统任务和异构图上的事件序列学习任务中取得具有竞争力的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Temporal Graph Network for continuous-time dynamic event sequence

Continuous-Time Dynamic Graph (CTDG) methods have shown their superior ability in learning representations for dynamic graph-structured data, the methods split the sequential updating process into discrete batches to reduce the computation costs, as a result, the message constructor in existing CTDG methods cannot be optimized by gradient descent and is designed to be parameter-free. In particular, this layer fails to embed complex event subgraphs and ignores the structure information, while most real-world events are structured and complex. For example, a paper publication event in an academic graph contains different relations like authorship and citations. Furthermore, the corresponding nodes could not receive position-wise messages to make precise representation updates. To tackle this issue, we propose a new method called Temporal Graph Network for continuous-time dynamic Event sequence (TGNE) with a structure-aware message constructor to update node representation with complex event subgraph, by treating message construction and delivery as a message-passing process, in this way, the message constructor can be formalized as a graph neural network layer. TGNE extends the input of CTDG methods to subgraphs with complex structures and preserves more information in message delivery. Extensive experiments demonstrate that the proposed method can achieve competitive performance on traditional tasks on bipartite graphs and event sequence learning tasks on heterogeneous graphs.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Knowledge-Based Systems
Knowledge-Based Systems 工程技术-计算机:人工智能
CiteScore
14.80
自引率
12.50%
发文量
1245
审稿时长
7.8 months
期刊介绍: Knowledge-Based Systems, an international and interdisciplinary journal in artificial intelligence, publishes original, innovative, and creative research results in the field. It focuses on knowledge-based and other artificial intelligence techniques-based systems. The journal aims to support human prediction and decision-making through data science and computation techniques, provide a balanced coverage of theory and practical study, and encourage the development and implementation of knowledge-based intelligence models, methods, systems, and software tools. Applications in business, government, education, engineering, and healthcare are emphasized.
×
引用
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学术官方微信