Publications

Filter by year, topic, or keyword. Badges highlight awards and reproducibility artifacts.

ACM-TIST · 2026

Atom-Motif Contrastive Transformer for Molecular Property Prediction

Wentao Yu, Shuo Chen, Chen Gong, Bo Han, Gang Niu, Masashi Sugiyama

A novel Atom-Motif Contrastive Transformer for Molecular Property Prediction.

Recently, Graph Transformer (GT) models have been widely used in the task of Molecular Property Prediction (MPP) due to their high reliability in characterizing the latent relationship among graph nodes (i.e., the atoms in a molecule). However, most existing GT-based methods usually explore the basic interactions between pairwise atoms, and thus they fail to consider the important interactions among critical motifs (e.g., functional groups consisted of several atoms) of molecules. As motifs in a molecule are significant patterns that are of great importance for determining molecular properties (e.g., toxicity and solubility), overlooking motif interactions inevitably hinders the effectiveness of MPP. To address this issue, we propose a novel Atom-Motif Contrastive Transformer (AMCT), which not only explores the atom-level interactions but also considers the motif-level interactions. Since the representations of atoms and motifs for a given molecule are actually two different views of the same instance, they are naturally aligned to generate the self-supervisory signals for model training. Meanwhile, the same motif can exist in different molecules, and hence we also employ the contrastive loss to maximize the representation agreement of identical motifs across different molecules. Finally, in order to clearly identify the motifs that are critical in deciding the properties of each molecule, we further construct a property-aware attention mechanism into our learning framework. Our proposed AMCT is extensively evaluated on ten popular benchmark datasets, and both quantitative and qualitative results firmly demonstrate its effectiveness when compared with the state-of-the-art methods.

Graph Contrastive LearningMolecular Property Prediction
dataset-release

AAAI · 2026

Inter-Client Dependency Recovery with Hidden Global Components for Federated Traffic Prediction

Hang Zhou, Wentao Yu, Yang Wei, Guangyu Li, SHA XU, Chen Gong

Poster

A novel Federated method which recovers the inter-client dependency with HIdden global componeNTs (FedHINT).

Current works either fail to capture the missing inter-client dependency or compromise data privacy to recover the inter-client dependency. To address this issue, we propose a novel Federated method which recovers the inter-client dependency with HIdden global componeNTs (FedHINT). We find that the traffic data from different local regions actually contain hidden global components that reflect cross-regional traffic changes. Therefore, our FedHINT aims to extract hidden global components from each client to generate proxy nodes that represent global information, which are then utilized to recover the inter-client dependency. To be specific, we employ an attention module, which is guided by the shared global queries to capture hidden global components from local traffic data, to generate proxy nodes. Subsequently, our FedHINT adaptively learns the correlations between proxy nodes and local nodes through a global encoder. During this process, the global information in proxy nodes compensate for the loss of information from cross-regional nodes, which thereby recovers the missing inter-client dependency.

Graph Federated LearningFederated Traffic Prediction
dataset-releasecode-release

AAAI · 2025

Modeling Inter-Intra Heterogeneity for Graph Federated Learning

Wentao Yu, Shuo Chen, Yongxin Tong, Tianlong Gu, Chen Gong

Poster

A novel Graph Federated Learning method by integrally modeling the Inter-Intra Heterogeneity.

We propose a novel method FedIIH, which naturally integrates the inter- and intra- heterogeneity in Graph Federated Learning (GFL). On one hand, our method characterizes the interheterogeneity from a multi-level global perspective, and thus it can properly compute the inter-subgraph similarities based on the whole distribution. On the other hand, it disentangles the subgraph into several latent factors, so that we can further consider the critical intra-heterogeneity. To the best of our knowledge, this is the first time in GFL that combines both inter- and intra- heterogeneity into a unified framework.

Graph Federated LearningPersonalized Federated Learning
dataset-releasecode-release

ICDM · 2024

Traffic Pattern Sharing for Federated Traffic Flow Prediction with Personalization

Hang Zhou, Wentao Yu, Sheng Wan, Yongxin Tong, Tianlong Gu, Chen Gong

ICDM Best Student Paper Runner-Up Award

A FL framework termed “personalized Federated learning with Traffic Pattern Sharing” (FedTPS) to solve federated Traffic Flow Prediction problem.

This paper develops a new FL framework termed “personalized Federated learning with Traffic Pattern Sharing” (FedTPS) to solve federated TFP problem. Our FedTPS critically exploits the underlying common traffic patterns (e.g., morning and evening rush hours) shared across different city regions and meanwhile maintaining the region-specific data characteristics in a personalized FL manner. Specifically, to extract the common traffic patterns, we decompose the traffic data in each client via using discrete wavelet transform, where the low-frequency components uncover the stable traffic dynamics of different regions and thus can be considered as the common traffic patterns. These common patterns are then shared among different clients through traffic pattern repositories on the server side to aid the global collaborative traffic flow modeling. Moreover, the model components capturing spatial-temporal dependencies in traffic data are retained for local training, thereby enabling personalized learning based on regional characteristics. Intensive experiments on four real-world traffic datasets firmly demonstrate the superiority of our proposed FedTPS over other compared typical FL methods in terms of various estimation errors.

Graph Federated LearningFederated Traffic Prediction
artifact-evaluatedcode-release

IEEE-TGRS · 2023

Hyperspectral Image Classification With Contrastive Graph Convolutional Network

Wentao Yu, Sheng Wan, Guangyu Li, Jian Yang, Chen Gong

ESI Highly Cited

We introduce a GCN model with contrastive learning that enhances the feature representation ability for hyperspectral image classification.

To enhance the feature representation ability, in this paper, a GCN model with contrastive learning is proposed to explore the supervision signals contained in both spectral information and spatial relations, which is termed Contrastive Graph Convolutional Network (ConGCN), for HSI classification.

Contrastive LearningGraph Convolutional NetworkHyperspectral Image Classification
open-sourcereproducible

IEEE-TCYB · 2022

Two-Stream Spatial–Temporal Graph Convolutional Networks for Driver Drowsiness Detection

Jing Bai, Wentao Yu, Zhu Xiao, Guangyu Li, Vincent Havyarimana, Amelia C. Regan, Hongbo Jiang

ESI Highly Cited

We propose a novel and robust two-stream spatial–temporal graph convolutional network (2s-STGCN) for driver drowsiness detection.

In this article, we propose a novel and robust two-stream spatial–temporal graph convolutional network (2s-STGCN) for driver drowsiness detection to solve the above-mentioned challenges. To take advantage of the spatial and temporal features of the input data, we use a facial landmark detection method to extract the driver’s facial landmarks from real-time videos and then obtain the driver drowsiness detection result by 2s-STGCN. Unlike existing methods, our proposed method uses videos rather than consecutive video frames as processing units. This is the first effort to exploit these processing units in the field of driver drowsiness detection. Moreover, the two-stream framework not only models both the spatial and temporal features but also models both the first-order and second-order information simultaneously, thereby notably improving driver drowsiness detection. Extensive experiments have been performed on the yawn detection dataset (YawDD) and the National TsingHua University drowsy driver detection (NTHU-DDD) dataset. The experimental results validate the feasibility of the proposed method. This method achieves an average accuracy of 93.4% on the YawDD dataset and an average accuracy of 92.7% on the evaluation set of the NTHU-DDD dataset.

Graph Neural NetworksFeature Extraction
dataset-release