Next Article in Journal
A Machine-Learning-Inspired Opinion Extraction Mechanism for Classifying Customer Reviews on Social Media
Next Article in Special Issue
A Network Analysis Approach to Detecting Social Issues with Web-Based Data
Previous Article in Journal
Design and Ground Performance Evaluation of a Multi-Joint Wheel-Track Composite Mobile Robot for Enhanced Terrain Adaptability
Previous Article in Special Issue
VLSM-Net: A Fusion Architecture for CT Image Segmentation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Predicting Critical Nodes in Temporal Networks by Dynamic Graph Convolutional Networks

1
Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 611731, China
2
School of Information Engineering, Nanjing University of Finance and Economics, Nanjing 210023, China
3
Chengdu Union Big Data Technology Incorporation, Chengdu 610041, China
*
Author to whom correspondence should be addressed.
Appl. Sci. 2023, 13(12), 7272; https://doi.org/10.3390/app13127272
Submission received: 3 May 2023 / Revised: 11 June 2023 / Accepted: 17 June 2023 / Published: 18 June 2023
(This article belongs to the Special Issue Recent Advances in Big Data Analytics)

Abstract

Many real-world systems can be expressed in temporal networks with nodes playing different roles in structure and function, and edges representing the relationships between nodes. Identifying critical nodes can help us control the spread of public opinions or epidemics, predict leading figures in academia, conduct advertisements for various commodities and so on. However, it is rather difficult to identify critical nodes, because the network structure changes over time in temporal networks. In this paper, considering the sequence topological information of temporal networks, a novel and effective learning framework based on the combination of special graph convolutional and long short-term memory network (LSTM) is proposed to identify nodes with the best spreading ability. The special graph convolutional network can embed nodes in each sequential weighted snapshot and LSTM is used to predict the future importance of timing-embedded features. The effectiveness of the approach is evaluated by a weighted Susceptible-Infected-Recovered model. Experimental results on four real-world temporal networks demonstrate that the proposed method outperforms both traditional and deep learning benchmark methods in terms of the Kendall τ coefficient and top k hit rate.
Keywords: temporal networks; deep learning; node embedding; representation learning temporal networks; deep learning; node embedding; representation learning

Share and Cite

MDPI and ACS Style

Yu, E.; Fu, Y.; Zhou, J.; Sun, H.; Chen, D. Predicting Critical Nodes in Temporal Networks by Dynamic Graph Convolutional Networks. Appl. Sci. 2023, 13, 7272. https://doi.org/10.3390/app13127272

AMA Style

Yu E, Fu Y, Zhou J, Sun H, Chen D. Predicting Critical Nodes in Temporal Networks by Dynamic Graph Convolutional Networks. Applied Sciences. 2023; 13(12):7272. https://doi.org/10.3390/app13127272

Chicago/Turabian Style

Yu, Enyu, Yan Fu, Junlin Zhou, Hongliang Sun, and Duanbing Chen. 2023. "Predicting Critical Nodes in Temporal Networks by Dynamic Graph Convolutional Networks" Applied Sciences 13, no. 12: 7272. https://doi.org/10.3390/app13127272

APA Style

Yu, E., Fu, Y., Zhou, J., Sun, H., & Chen, D. (2023). Predicting Critical Nodes in Temporal Networks by Dynamic Graph Convolutional Networks. Applied Sciences, 13(12), 7272. https://doi.org/10.3390/app13127272

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop