mlsanityData to 14 Oct 2026

Canonical Polyadic Decomposition and Deep Learning for Machine Fault Detection

arXiv 2107.09519 ↗First posted 20 Jul 2021stat.ML cs.LG eess.AScited by 3

Not on the map. Why?

Abstract (arXiv)

Acoustic monitoring for machine fault detection is a recent and expanding research path that has already provided promising results for industries. However, it is impossible to collect enough data to learn all types of faults from a machine. Thus, new algorithms, trained using data from healthy conditions only, were developed to perform unsupervised anomaly detection. A key issue in the development of these algorithms is the noise in the signals, as it impacts the anomaly detection performance. In this work, we propose a powerful data-driven and quasi non-parametric denoising strategy for spectral data based on a tensor decomposition: the Non-negative Canonical Polyadic (CP) decomposition. This method is particularly adapted for machine emitting stationary sound. We demonstrate in a case study, the Malfunctioning Industrial Machine Investigation and Inspection (MIMII) baseline, how the use of our denoising strategy leads to a sensible improvement of the unsupervised anomaly detection. Such approaches are capable to make sound-based monitoring of industrial processes more reliable.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 5 of its 28 references that are in the map. First posted on arXiv 20 Jul 2021.

Builds on

5 of 28 references.

References · 5

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2019Deep Learning for Audio Signal Processingcited by 92
  3. 2019MIMII Dataset: Sound Dataset for Malfunctioning Industrial Machine Investigation and Inspectioncited by 58
  4. 2020Fusing Physics-based and Deep Learning Models for Prognosticscited by 40
  5. 2018Feature Learning for Fault Detection in High-Dimensional Condition-Monitoring Signalscited by 5

Built on by

Cited by year (2026 to 14 Oct)

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

3 papers.