Zonghan Wu

Zonghan Wu

Auto-generated profile, based on publicly available information

Zonghan Wu

University of Technology Sydney, Ultimo, 2007, NSW, Australia

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 March 2020 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
ZWZonghan Wu
Zonghan Wu
SPShirui Pan
Shirui Pan
FCFengwen Chen
Fengwen Chen
GLGuodong Long
Guodong Long
CZChengqi Zhang
Chengqi Zhang
PYPhilip S. Yu
Philip S. Yu
Deep learning has revolutionized many machine learning tasks in recent years, ranging from image classification and video processing to speech recognition and natural language understanding. The data in these tasks are typically represented in the Euclidean space. However, there is an increasing number of applications, where data are generated from non-Euclidean domains and are represented as graphs with complex relationships and interdependency between objects. The complexity of graph data has imposed significant challenges on the existing machine learning algorithms. Recently, many studies on extending deep learning approaches for graph data have emerged. In this article, we provide a comprehensive overview of graph neural networks (GNNs) in data mining and machine learning fields. We propose a new taxonomy to divide the state-of-the-art GNNs into four categories, namely, recurrent GNNs, convolutional GNNs, graph autoencoders, and spatial-temporal GNNs. We further discuss the applications of GNNs across various domains and summarize the open-source codes, benchmark data sets, and model evaluation of GNNs. Finally, we propose potential research directions in this rapidly growing field.

13 June 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
CZChuanpan Zheng
Chuanpan Zheng
XFXiaoliang Fan
Xiaoliang Fan
SPShirui Pan
Shirui Pan
HJHaibing Jin
Haibing Jin
ZPZhaopeng Peng
Zhaopeng Peng
PYPhilip S. Yu
Philip S. Yu
Recent studies have shifted their focus towards formulating traffic forecasting as a spatio-temporal graph modeling problem. Typically, they constructed a static spatial graph at each time step and then connected each node with itself between adjacent time steps to create a spatio-temporal graph. However, this approach failed to explicitly reflect the correlations between different nodes at different time steps, thus limiting the learning capability of graph neural networks. Additionally, those models overlooked the dynamic spatio-temporal correlations among nodes by using the same adjacency matrix across different time steps. To address these limitations, we propose a novel approach called Spatio-Temporal Joint Graph Convolutional Networks (STJGCN) for accurate traffic forecasting on road networks over multiple future time steps. Specifically, our method encompasses the construction of both pre-defined and adaptive spatio-temporal joint graphs (STJGs) between any two time steps, which represent comprehensive and dynamic spatio-temporal correlations. We further introduce dilated causal spatio-temporal joint graph convolution layers on the STJG to capture spatio-temporal dependencies from distinct perspectives with multiple ranges. To aggregate information from different ranges, we propose a multi-range attention mechanism. Finally, we evaluate our approach on five public traffic datasets and experimental results demonstrate that STJGCN is not only computationally efficient but also outperforms 11 state-of-the-art baseline methods.

14 July 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
ZWZonghan Wu
Zonghan Wu
DZDa Zheng
Da Zheng
SPShirui Pan
Shirui Pan
QGQuan Gan
Quan Gan
GLGuodong Long
Guodong Long
GKGeorge Karypis
George Karypis
This article aims to unify spatial dependency and temporal dependency in a non-Euclidean space while capturing the inner spatial–temporal dependencies for traffic data. For spatial–temporal attribute entities with topological structure, the space–time is consecutive and unified while each node’s current status is influenced by its neighbors’ past states over variant periods of each neighbor. Most spatial–temporal neural networks for traffic forecasting study spatial dependency and temporal correlation separately in processing, gravely impaired the spatial–temporal integrity, and ignore the fact that the neighbors’ temporal dependency period for a node can be delayed and dynamic. To model this actual condition, we propose TraverseNet, a novel spatial–temporal graph neural network, viewing space and time as an inseparable whole, to mine spatial–temporal graphs while exploiting the evolving spatial–temporal dependencies for each node via message traverse mechanisms. Experiments with ablation and parameter studies have validated the effectiveness of the proposed TraverseNet, and the detailed implementation can be found from https://github.com/nnzhan/TraverseNet.

24 June 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
ZWZonghan Wu
Zonghan Wu
SPShirui Pan
Shirui Pan
GLGuodong Long
Guodong Long
JJJing Jiang
Jing Jiang
CZChengqi Zhang
Chengqi Zhang
Graph convolutional networks are becoming indispensable for deep learning from graph-structured data. Most of the existing graph convolutional networks share two big shortcomings. First, they are essentially low-pass filters, thus the potentially useful middle and high frequency band of graph signals are ignored. Second, the bandwidth of existing graph convolutional filters is fixed. Parameters of a graph convolutional filter only transform the graph inputs without changing the curvature of a graph convolutional filter function. In reality, we are uncertain about whether we should retain or cut off the frequency at a certain point unless we have expert domain knowledge. In this paper, we propose Automatic Graph Convolutional Networks (AutoGCN) to capture the full spectrum of graph signals and automatically update the bandwidth of graph convolutional filters. While it is based on graph spectral theory, our AutoGCN is also localized in space and has a spatial form. Experimental results show that AutoGCN achieves significant improvement over baseline methods which only work as low-pass filters.

29 January 2024 in Neural Networks
Verified
Journal Article
Closed access
ZWZihui Wang
Zihui Wang
PYPeizhen Yang
Peizhen Yang
XFXiaoliang Fan
Xiaoliang Fan
XYXu Yan
Xu Yan
ZWZonghan Wu
Zonghan Wu
RYRongshan Yu
Rongshan Yu

4 December 2019 in arXiv
Verified
Preprint
Open access
PDF file
ZWZonghan Wu
Zonghan Wu
SPShirui Pan
Shirui Pan
FCFengwen Chen
Fengwen Chen
GLGuodong Long
Guodong Long
CZChengqi Zhang
Chengqi Zhang
PYPhilip S. Yu
Philip S. Yu
Deep learning has revolutionized many machine learning tasks in recent years, ranging from image classification and video processing to speech recognition and natural language understanding. The data in these tasks are typically represented in the Euclidean space. However, there is an increasing number of applications where data are generated from non-Euclidean domains and are represented as graphs with complex relationships and interdependency between objects. The complexity of graph data has imposed significant challenges on existing machine learning algorithms. Recently, many studies on extending deep learning approaches for graph data have emerged. In this survey, we provide a comprehensive overview of graph neural networks (GNNs) in data mining and machine learning fields. We propose a new taxonomy to divide the state-of-the-art graph neural networks into four categories, namely recurrent graph neural networks, convolutional graph neural networks, graph autoencoders, and spatial-temporal graph neural networks. We further discuss the applications of graph neural networks across various domains and summarize the open source codes, benchmark data sets, and model evaluation of graph neural networks. Finally, we propose potential research directions in this rapidly growing field.