A Novel Representation Learning for Dynamic Graphs Based on Graph Convolutional Networks

• Published in: IEEE transactions on cybernetics Vol. 53; no. 6; pp. 3599 - 3612
• Main Authors: Gao, Chao, Zhu, Junyou, Zhang, Fan, Wang, Zhen, Li, Xuelong
• Format: Journal Article
• Language: English
• Published: United States IEEE 01.06.2023; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Agglomeration; Artificial neural networks; Clustering; Deep learning; Dynamic characteristics; Dynamic graphs; graph convolutional networks (GCNs); graph representation learning; Graph representations; Graphical representations; Graphs; Machine learning; Marine vehicles; Mutual information; mutual information (MI); Nodes; Performance evaluation; Proteins; Representation learning; Task analysis; Training
• ISSN: 2168-2267; 2168-2275; 2168-2275
• DOI: 10.1109/TCYB.2022.3159661

Graph representation learning has re-emerged as a fascinating research topic due to the successful application of graph convolutional networks (GCNs) for graphs and inspires various downstream tasks, such as node classification and link prediction. Nevertheless, existing GCN-based methods for graph representation learning mainly focus on static graphs. Although some methods consider the dynamic characteristics of networks, the global structure information, which helps a node to gain worthy features from distant but valuable nodes, has not received enough attention. Moreover, these methods generally update the features of the nodes by averaging the features of neighboring nodes, which may not effectively consider the importance of different neighboring nodes during the aggregation. In this article, we propose a novel representation learning for dynamic graphs based on the GCNs, called DGCN. More specifically, the long short-term memory (LSTM) is utilized to update the weight parameters of GCN for capturing the global structure information across all time steps of dynamic graphs. Besides, a new Dice similarity is proposed to overcome the problem that the influence of directed neighbors is unnoticeable, which is further used to guide the aggregation. We evaluate the performance of the proposed method in the field of node clustering and link prediction, and the experimental results show a generally better performance of our proposed DGCN than baseline methods.