DS-TAGCN: A Dual-Stream Topology Attentive GCN for Node Classification in Dynamic Graphs

Jinteng Ruan, Hao-peng Chen, Ziming Wang, Shuyu Chen
{"title":"DS-TAGCN: A Dual-Stream Topology Attentive GCN for Node Classification in Dynamic Graphs","authors":"Jinteng Ruan, Hao-peng Chen, Ziming Wang, Shuyu Chen","doi":"10.1109/IJCNN52387.2021.9533699","DOIUrl":null,"url":null,"abstract":"With the rapid growth of information, large amounts of graph-structured data have been generated. As an important task in graph-structured data research, node classification, which aims to classify nodes into different categories, has attracted a lot of attention from researchers in recent years. Real-life graphs are often dynamic whose graph topology and node attributes are constantly evolving. However, most of the studies focus on static graphs which can not capture the evolution of dynamic graphs. Node classification in dynamic graphs mainly has the following two challenges. First, it is difficult to effectively integrate modeling spatial and temporal features. Second, the evolution of dynamic graphs is located not only in node attributes but also in the graph topology. It is hard to learn the evolution of both aspects in the meantime. Besides, existing methods focus only on topological relations connected by explicit edges, while ignoring implicit topological relations that act in non-edge form. Implicit topological relations can help aggregate neighborhood features and further refine the modeling of node evolution patterns. To address these challenges and problems, we propose DS-TAGCN, a dual-stream topology attentive GCN for dynamic graph node classification. DS- TAGCN learns spatial-temporal features simultaneously by using a combination of GCN and LSTM. A dual-stream framework is designed to focus on the evolution of node attributes and graph topology, respectively. To mine the implicit topology, we propose TAGCN instead of GCN to model the implicit topological relations. Additionally, we incorporate a hierarchical attention mechanism in the network to automatically model the importance of different dimensional features. Extensive experiments demonstrate the effectiveness of DS-TAGCN.","PeriodicalId":396583,"journal":{"name":"2021 International Joint Conference on Neural Networks (IJCNN)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Joint Conference on Neural Networks (IJCNN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCNN52387.2021.9533699","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the rapid growth of information, large amounts of graph-structured data have been generated. As an important task in graph-structured data research, node classification, which aims to classify nodes into different categories, has attracted a lot of attention from researchers in recent years. Real-life graphs are often dynamic whose graph topology and node attributes are constantly evolving. However, most of the studies focus on static graphs which can not capture the evolution of dynamic graphs. Node classification in dynamic graphs mainly has the following two challenges. First, it is difficult to effectively integrate modeling spatial and temporal features. Second, the evolution of dynamic graphs is located not only in node attributes but also in the graph topology. It is hard to learn the evolution of both aspects in the meantime. Besides, existing methods focus only on topological relations connected by explicit edges, while ignoring implicit topological relations that act in non-edge form. Implicit topological relations can help aggregate neighborhood features and further refine the modeling of node evolution patterns. To address these challenges and problems, we propose DS-TAGCN, a dual-stream topology attentive GCN for dynamic graph node classification. DS- TAGCN learns spatial-temporal features simultaneously by using a combination of GCN and LSTM. A dual-stream framework is designed to focus on the evolution of node attributes and graph topology, respectively. To mine the implicit topology, we propose TAGCN instead of GCN to model the implicit topological relations. Additionally, we incorporate a hierarchical attention mechanism in the network to automatically model the importance of different dimensional features. Extensive experiments demonstrate the effectiveness of DS-TAGCN.
DS-TAGCN:用于动态图中节点分类的双流拓扑关注GCN
随着信息的快速增长,产生了大量的图结构数据。节点分类是图结构数据研究中的一项重要任务,其目的是将节点划分为不同的类别,近年来受到了研究人员的广泛关注。现实生活中的图通常是动态的,图的拓扑结构和节点属性是不断发展的。然而,大多数研究都集中在静态图上,无法捕捉到动态图的演变。动态图中的节点分类主要有以下两个挑战。首先,难以将建模的时空特征有效整合。其次,动态图的演化不仅存在于节点属性中,而且存在于图的拓扑结构中。很难同时了解这两个方面的演变。此外,现有方法只关注由显式边连接的拓扑关系,而忽略了以非边形式作用的隐式拓扑关系。隐式拓扑关系有助于聚合邻域特征,进一步细化节点演化模式的建模。为了解决这些挑战和问题,我们提出了DS-TAGCN,一种用于动态图节点分类的双流拓扑关注GCN。DS- TAGCN采用GCN和LSTM相结合的方法同时学习时空特征。设计了双流框架,分别关注节点属性和图拓扑的演化。为了挖掘隐式拓扑,我们提出用TAGCN代替GCN对隐式拓扑关系建模。此外,我们在网络中加入了分层注意机制,以自动建模不同维度特征的重要性。大量实验证明了DS-TAGCN的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信