A fusion sparse learning algorithm for fault identification of rolling bearings

Liu, Yefeng, Liu, Jingjing, Ma, Yanwei, Wang, Shuai and Zhang, Qichun (2026) A fusion sparse learning algorithm for fault identification of rolling bearings. PLOS One, 21 (1). e0339859. ISSN 1932-6203

Text 20777_Zhang.pdf - Published Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (7MB)

Abstract

A key part of CNC machine tools is the rolling bearing, and thus, it is vital to employ a data-driven approach for fault diagnosis. This paper proposes a two-stage fusion sparse learning algorithm for fault data processing that can identify and diagnose the fault types of rolling bearings based on sensor measurement data. During the feature extraction phase, temporal features of sequential data within the big data are extracted using a Long Short - Term Memory (LSTM) network. Moreover, the classification learning stage contains a new sparse learning algorithm, which applies L1/2 regularization on stochastic configuration networks (SCN). The iterative learning formula combines the alternating direction method of multipliers (ADMM) with the analysis of the quadratic equations theory. Simultaneously, the model’s inequality supervision mechanism is updated based on convergence analysis. This developed algorithm incorporates the benefits of LSTM in extracting temporal data characteristics, along with the sparsity, ease of convergence, and lightweight nature of SCN. Consequently, it mitigates the shortcomings of deep models in end-to-end applications, particularly in terms of interpretability and structural redundancy, thus making it suitable for deployment on edge devices. Finally, a fusion sparse learning model (LSTM-L1/2-SCN) is introduced based on the two-stage learning algorithm for rolling bearing fault diagnosis. In the experiments on the benchmark dataset, the optimal sparsity degree of this algorithm for the Sparse Coding Network (SCN) reached 76.66%, which was 30% higher than that of the Pooling-based Sparse Coding Network (PSCN). Moreover, in the experiments based on the dataset of Case Western Reserve University (CWRU), the optimal test classification accuracy achieved was 97.51%, and the optimal sparsity degree for SCN reached 29.39%. These results verify that the proposed algorithm exhibits sparsity, demonstrates effectiveness, and is capable of identifying faults in rolling bearings.

Item Type:	Article
Additional Information:	** From PLOS via Jisc Publications Router ** History: received 01-03-2025; accepted 11-12-2025; collection 01-01-2026; epub 05-01-2026. ** Licence for this article: http://creativecommons.org/licenses/by/4.0/ ** Acknowledgements: The authors would like to express their gratitude to EditSprings (https://www.editsprings.cn) for the expert linguistic services provided.
SWORD Depositor:	JISC Router
Depositing User:	JISC Router
Date Deposited:	22 Jan 2026 12:33
Last Modified:	22 Jan 2026 12:37
URI:	https://bnu.repository.guildhe.ac.uk/id/eprint/20777

Actions (login required)

Edit Item