mlsanityData to 14 Oct 2026

Fed-LDR: Federated Local Data-infused Graph Creation with Node-centric Model Refinement

arXiv 2411.04936 ↗First posted 7 Nov 2024cs.LG cs.DC cs.SIcited by 2

Not on the map. Why?

Abstract (arXiv)

The rapid acceleration of global urbanization has introduced novel challenges in enhancing urban infrastructure and services. Spatio-temporal data, integrating spatial and temporal dimensions, has emerged as a critical tool for understanding urban phenomena and promoting sustainability. In this context, Federated Learning (FL) has gained prominence as a distributed learning paradigm aligned with the privacy requirements of urban IoT environments. However, integrating traditional and deep learning models into the FL framework poses significant challenges, particularly in capturing complex spatio-temporal dependencies and adapting to diverse urban conditions. To address these challenges, we propose the Federated Local Data-Infused Graph Creation with Node-centric Model Refinement (Fed-LDR) algorithm. Fed-LDR leverages FL and Graph Convolutional Networks (GCN) to enhance spatio-temporal data analysis in urban environments. The algorithm comprises two key modules: (1) the Local Data-Infused Graph Creation (LDIGC) module, which dynamically reconfigures adjacency matrices to reflect evolving spatial relationships within urban environments, and (2) the Node-centric Model Refinement (NoMoR) module, which customizes model parameters for individual urban nodes to accommodate heterogeneity. Evaluations on the PeMSD4 and PeMSD8 datasets demonstrate Fed-LDR's superior performance over six baseline methods. Fed-LDR achieved the lowest Mean Absolute Error (MAE) values of 20.15 and 17.30, and the lowest Root Mean Square Error (RMSE) values of 32.30 and 27.15, respectively, while maintaining a high correlation coefficient of 0.96 across both datasets. Notably, on the PeMSD4 dataset, Fed-LDR reduced MAE and RMSE by up to 81% and 78%, respectively, compared to the best-performing baseline FedMedian.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 12 of its 31 references that are in the map. First posted on arXiv 7 Nov 2024.

Builds on

12 of 31 references.

References · 12

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  3. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,475
  4. 2017Spatio-Temporal Graph Convolutional Networks: A Deep Learning Framework for Traffic Forecastingcited by 1,136
  5. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 711
  6. 2018Adaptive Federated Learning in Resource Constrained Edge Computing Systemscited by 409
  7. 2018Adaptive Graph Convolutional Neural Networkscited by 155
  8. 2018Traffic Graph Convolutional Recurrent Neural Network: A Deep Learning Framework for Network-Scale Traffic Learning and Forecastingcited by 146
  9. 2019Attention Guided Graph Convolutional Networks for Relation Extractioncited by 82
  10. 2021Heterogeneous Temporal Graph Neural Networkcited by 23
  11. 2024Tensor Graph Convolutional Network for Dynamic Graph Representation Learningcited by 8
  12. 2021Spatio-Temporal Federated Learning for Massive Wireless Edge Networkscited by 1

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.