Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/108682
PIRA download icon_1.1View/Download Full Text
Title: Research on SVM-based bearing fault diagnosis modeling and multiple swarm genetic algorithm parameter identification method
Authors: Mo, C
Han, H 
Liu, M
Zhang, Q
Yang, T
Zhang, F
Issue Date: Jul-2023
Source: Mathematics, July 2023, v. 11, no. 13, 2864
Abstract: The bearing fault diagnosis of petrochemical rotating machinery faces the problems of large data volume, weak fault feature signal strength and susceptibility to noise interference. To solve these problems, current research presents a combined ICEEMDAN-wavelet threshold joint noise reduction, mutual dimensionless metrics and MPGA-SVM approach for rotating machinery bearing fault diagnosis. Firstly, we propose an improved joint noise-reduction method of an Improved Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (ICEEMDAN) and wavelet thresholding. Moreover, the noise-reduced data are processed by mutual dimensionless processing to construct a mutual dimensionless index sensitive to bearing fault features and complete the fault feature extraction of the bearing signals. Furthermore, we design experiments on faulty bearings of multistage centrifugal fans in petrochemical rotating machinery and processed the input data set according to ICEEMDAN-wavelet threshold joint noise reduction and mutual dimensionless indexes for later validation of the model and algorithm. Finally, a support vector machine model used to effectively identify the bearing failures, and a multi-population genetic algorithm, is studied to optimize the relevant parameters of the support vector machine. The powerful global parallel search capability of the multigroup genetic algorithm is used to search for the penalty factor c and kernel parameter r that affect the classification performance of the support vector machine. The global optimal solutions of c and r are found in a short time to construct a multigroup genetic algorithm-support vector machine bearing fault diagnosis and identification model. The proposed model is verified to have 95.3% accuracy for the bearing fault diagnosis, and the training time is 11.1608 s, while the traditional GA-SVM has only 89.875% accuracy and the training time is 17.4612 s. Meanwhile, to exclude the influence of experimental data on the specificity of our method, the experimental validation of the Western Reserve University bearing failure open-source dataset was added, and the results showed that the accuracy could reach 97.1% with a training time of 14.2735 s, thus proving that the method proposed in our paper can achieve good results in practical applications.
Keywords: Bearing fault diagnosis
Improved joint noise-reduction method
Multi-population genetic algorithm
Mutual dimensionless
Publisher: MDPI AG
Journal: Mathematics 
EISSN: 2227-7390
DOI: 10.3390/math11132864
Rights: © 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
The following Mo C, Han H, Liu M, Zhang Q, Yang T, Zhang F. Research on SVM-Based Bearing Fault Diagnosis Modeling and Multiple Swarm Genetic Algorithm Parameter Identification Method. Mathematics. 2023; 11(13):2864 is available at https://doi.org/10.3390/math11132864.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
mathematics-11-02864.pdf13.59 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

65
Citations as of Nov 10, 2025

Downloads

69
Citations as of Nov 10, 2025

SCOPUSTM   
Citations

14
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

8
Citations as of Feb 13, 2025

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.