Evidence map›Paper›PMID 41305248›Full record

ArticleSensors (Basel, Switzerland)2025

Robust Sparse Non-Negative Matrix Factorization for Identifying Signals of Interest in Bearing Fault Detection.

Hamid Shiri, Anna Michalak

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Hamid ShiriTony Davies High Voltage Laboratory, School of Electronics and Computer Science, Faculty of Engineering and Physical Sciences, University of Southampton, Southampton SO17 1BJ, UK.ORCID 0000-0002-1878-4718
Anna MichalakFaculty of Geoengineering, Mining and Geology, Wroclaw University of Science and Technology, Na Grobli 15, 50-421 Wrocław, Poland.ORCID 0000-0003-1297-3590

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Bearings are among the most failure-prone components in rotating systems, making early fault detection crucial in industrial applications. While recent publications have focused on this issue, challenges remain, particularly in dealing with heavy-tailed or non-cyclic impulsive noise in recorded signals. Such noise poses significant challenges for classical fault selectors like kurtosis-based methods. Moreover, many deep-learning approaches struggle in these environments, as they often assume Gaussian or stationary noise and rely on large labeled datasets that are rarely available in practice. To address this, we propose a robust sparse non-negative matrix factorization (NMF) method based on the maximum-correntropy criterion, which is known for its robustness in the presence of heavy-tailed noise. This methodology is applied to identify fault frequency bands in the spectrogram of the signal. The effectiveness of the approach is validated using simulated fault signals under both Gaussian and heavy-tailed noise conditions through Monte Carlo simulations. A statistical efficiency analysis confirms robustness to random perturbations. Additionally, three real datasets are used to evaluate the performance of the proposed method. Results from both simulations and real-world data demonstrate the effectiveness of the proposed approach.

Indexed as

bearing fault detectionfault frequency bandheavy-tailed noisemaximum-correntropy criterionMonte Carlo simulationnon-cyclic impulsive noiserobust sparse non-negative matrix factorization

Identifiers

PMID41305248
PMCPMC12656686

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.