mlsanityData to 14 Oct 2026

Spatial-Temporal Bearing Fault Detection Using Graph Attention Networks and LSTM

arXiv 2410.11923 ↗First posted 15 Oct 2024cs.LG cs.NEcited by 4

Not on the map. Why?

Abstract (arXiv)

Purpose: This paper aims to enhance bearing fault diagnosis in industrial machinery by introducing a novel method that combines Graph Attention Network (GAT) and Long Short-Term Memory (LSTM) networks. This approach captures both spatial and temporal dependencies within sensor data, improving the accuracy of bearing fault detection under various conditions. Methodology: The proposed method converts time series sensor data into graph representations. GAT captures spatial relationships between components, while LSTM models temporal patterns. The model is validated using the Case Western Reserve University (CWRU) Bearing Dataset, which includes data under different horsepower levels and both normal and faulty conditions. Its performance is compared with methods such as K-Nearest Neighbors (KNN), Local Outlier Factor (LOF), Isolation Forest (IForest) and GNN-based method for bearing fault detection (GNNBFD). Findings: The model achieved outstanding results, with precision, recall, and F1-scores reaching 100% across various testing conditions. It not only identifies faults accurately but also generalizes effectively across different operational scenarios, outperforming traditional methods. Originality: This research presents a unique combination of GAT and LSTM for fault detection, overcoming the limitations of traditional time series methods by capturing complex spatial-temporal dependencies. Its superior performance demonstrates significant potential for predictive maintenance in industrial applications.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 1 of its 53 references that are in the map. First posted on arXiv 15 Oct 2024.

Builds on

1 of 53 references.

References · 1

  1. 2017Graph Attention Networkscited by 8,923

Built on by

Cited by year

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

4 papers.