mlsanityData to 14 Oct 2026

Interpretable Fault Diagnosis of Rolling Element Bearings with Temporal Logic Neural Network

arXiv 2204.07579 ↗First posted 15 Apr 2022cs.LG cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Machine learning-based methods have achieved successful applications in machinery fault diagnosis. However, the main limitation that exists for these methods is that they operate as a black box and are generally not interpretable. This paper proposes a novel neural network structure, called temporal logic neural network (TLNN), in which the neurons of the network are logic propositions. More importantly, the network can be described and interpreted as a weighted signal temporal logic. TLNN not only keeps the nice properties of traditional neuron networks but also provides a formal interpretation of itself with formal language. Experiments with real datasets show the proposed neural network can obtain highly accurate fault diagnosis results with good computation efficiency. Additionally, the embedded formal language of the neuron network can provide explanations about the decision process, thus achieve interpretable fault diagnosis.

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

Builds on

7 of 27 references.

References · 7

  1. 2019Differentiable Soft Quantization: Bridging Full-Precision and Low-Bit Neural Networkscited by 238
  2. 2015Robust Online Monitoring of Signal Temporal Logiccited by 39
  3. 2020On Robustness Metrics for Learning STL Taskscited by 27
  4. 2020Specifying User Preferences using Weighted Signal Temporal Logiccited by 22
  5. 2020A Smooth Robustness Measure of Signal Temporal Logic for Symbolic Controlcited by 21
  6. 2019Arithmetic-Geometric Mean Robustness for Control from Signal Temporal Logic Specificationscited by 19
  7. 2014On-Line Monitoring for Temporal Logic Robustnesscited by 15

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 3.

4 papers.