Position-Aware Structural Knowledge Sharing-Based Federated Graph Learning for Intelligent Transportation Systems

Federated Graph Learning (FGL) combines the powerful graph data modeling capabilities of Graph Neural Networks (GNNs) with the distributed processing requirements of intelligent transportation systems (ITS), making it a prominent focus in recent research. In the context of the Internet of Everything (IoE), diverse devices and services generate highly heterogeneous, non-independent, and non-identically distributed (non-IID) data, which limits model generalization and training efficiency. To tackle these challenges, this paper proposes a Position-Aware Structural Sharing Federated Graph Learning Framework tailored for ITS applications. This framework enhances GNNs’ capacity to process cross-domain graph data, significantly improving model applicability and performance across various ITS scenarios. Specifically, we use a structural encoder alongside a position-aware structural encoder to capture generic structural knowledge, sharing these embeddings across clients in an FGL setup. Extensive experiments on different datasets demonstrate that our method outperforms existing approaches in handling non-IID federated graph learning tasks, particularly within cross-dataset and cross-domain environments.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Intelligent Transportation Systems
Published
2025-01-01
DOI
https://doi.org/10.1109/tits.2025.3561244
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Position-Aware Structural Knowledge Sharing-Based Federated Graph Learning for Intelligent Transportation Systems

Sahil Garg, Bing Guo, Georges Kaddoum, Cheng Dai et al.
IEEE Transactions on Intelligent Transportation Systems
Privacy-Preserving Technologies in Data
article

Position-Aware Structural Knowledge Sharing-Based Federated Graph Learning for Intelligent Transportation Systems

Sahil Garg, Bing Guo, Georges Kaddoum, Cheng Dai, Mohammad Mehedi Hassan, Guangdong He
article en

Abstract

Federated Graph Learning (FGL) combines the powerful graph data modeling capabilities of Graph Neural Networks (GNNs) with the distributed processing requirements of intelligent transportation systems (ITS), making it a prominent focus in recent research. In the context of the Internet of Everything (IoE), diverse devices and services generate highly heterogeneous, non-independent, and non-identically distributed (non-IID) data, which limits model generalization and training efficiency. To tackle these challenges, this paper proposes a Position-Aware Structural Sharing Federated Graph Learning Framework tailored for ITS applications. This framework enhances GNNs’ capacity to process cross-domain graph data, significantly improving model applicability and performance across various ITS scenarios. Specifically, we use a structural encoder alongside a position-aware structural encoder to capture generic structural knowledge, sharing these embeddings across clients in an FGL setup. Extensive experiments on different datasets demonstrate that our method outperforms existing approaches in handling non-IID federated graph learning tasks, particularly within cross-dataset and cross-domain environments.

IEEE Transactions on Intelligent Transportation Systems
Sichuan University (CN), King Saud University (SA), Chengdu University (CN), École de Technologie Supérieure (CA)
National Natural Science Foundation of China
Openalex Percentile: Top 95%
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.