Bearing fault identification based on ASMOTE-CFR
Huanke Cheng^{1} , Ping Wang^{2} , Guangbin Wang^{3} , Ying Lv^{4}
^{1}Hunan University of Science and Technology, Hunan Provincial Key Laboratory of Mechanical Equipment Health, Xiangtan, China
^{2}Hunan Power Machinery Research Institute of AECC, Zhuzhou, China
^{3, 4}College of Mechanical Engineering, Lingnan Normal University, Zhanjiang, 524048, China
^{3}Corresponding author
Vibroengineering PROCEDIA, Vol. 32, 2020, p. 62-68.
https://doi.org/10.21595/vp.2020.21520
Received 9 June 2020; accepted 16 June 2020; published 29 June 2020
46th International Conference on Vibroengineering in St. Petersburg, Russia, June 29 - July 1, 2020
Aiming at the problem of data unbalance caused by the lack of bearing failure test data, the paper proposes a collaborative filtering recommendation (CFR) method for adaptive Smote (ASMOTE) resampling and matrix decomposition of minority samples (ASMOTE-CFR). The method first adopts adaptive Smote method to synthesize different number of new sample equalization test data sets according to the data distribution. and then a variety of typical feature values such as time domain, frequency domain, time frequency domain, etc. are extracted to obtain the bearing feature matrix, and then a scoring matrix that accurately describes the bearing state is designed and based on the matrix Based on the decomposed collaborative filtering algorithm, a set of collaborative filtering recommendation system for bearing state recognition is proposed. Using this method, different forms of fault data on the outer ring of the rolling bearing were identified and verified. The accuracy of identification reached more than 98 %. Compared with the recognition accuracy of the collaborative filtering recommendation algorithm, this method improved 8 %.
Keywords: smote, unbalanced data, collaborative filtering, recommended system.
1. Introduction
During the operation of the wind turbine, bearing failure is the main failure of the wind turbine. If the timeliness of finding the bearing failure cannot be guaranteed, the operating life of the entire generator set will be greatly reduced, or even cause a major safety accident, so how to effectively identify the bearing The fault state has become one of the main contents in the field of fault diagnosis.
Motor bearings will generate huge amounts of data during monitoring. Normally, the normal sample data will be much larger than the fault sample. In recent years, many scholars have carried out research to improve the imbalanced learning problem [1-4]. Sampling Random Oversampling randomly copies a few samples to balance the class distribution; Jose et al. [5] proposed a Smote oversampling method. This method is not simply to copy its samples but there is a synthetic sample mechanism blindly so that the learning of samples is easy to cause overfitting.
At present, Collaborative Filtering (CF) is one of the most commonly used methods in the field of recommendation systems. The core idea is to predict user preferences through rating information of similar users or similar items [2, 6]. The paper [7-9] proposed a probabilistic matrix decomposition model, which describes the matrix decomposition process from the perspective of the probability generation process, effectively alleviating the problem of data sparsity.
Aiming at the difficulty of designing the scoring matrix of the recommendation system in the field of fault diagnosis, this paper first extracts the typical features from the time domain, frequency domain, and time-frequency domain to obtain the bearing feature matrix, and then constructs a set of accurate scoring matrices for the bearing state. Two matrixes with different characteristics are organically combined to obtain a joint scoring matrix for bearing state recognition. Based on the matrix filtering collaborative filtering algorithm and gradient descent optimization algorithm, a set of collaborative filtering recommendation systems for bearing state recognition is proposed.
2. CFR system based on ASMOTE
2.1. Adaptive smote oversampling method (ASMOTE)
This article sets the number of new minority samples to be generated according to the balance of data distribution. The specific algorithm flow is as follows:
Step 1: Calculate the degree of unbalance. Recall that the minority sample is ${X}_{s}$ and the majority is ${X}_{m}$, then the imbalance:
Step 2: Calculate the number of samples to be synthesized:
where $b\in \left(\mathrm{0,1}\right)$ is a parameter used to specify the desired balance level after generation of the synthetic data.
Step 3: For each sample $X$ that belongs to the minority class, calculate the $X=\{{X}_{1},{X}_{2},\cdots ,{X}_{n}\}$ neighbors with Euclidean distance, $\mathrm{\Delta}i$ is the number of samples belonging to the majority class among the $k$ neighbors, and the ratio $r$ is $r=\mathrm{\Delta}i/k$, $i=$ 1, 2,…, ${X}_{s}$, $r\in \left(\mathrm{0,1}\right)$, where $\mathrm{\Delta}i$ is the number of examples in the $k$ nearest neighbors of ${x}_{i}$ that belong to the majority class.
Step 4: Normalize ${r}_{i}$ for each minority sample obtained in Eq. (3):
Step 5: Calculate the number of synthesized samples for each minority sample:
Step 6: Randomly choose one minority data example, ${x}_{zi}$, from the $K$ nearest neigh bors for data ${x}_{i}$. and synthesize according to the following equation:
Repeat the synthesis until the number of synthesis required by Eq. (5) is satisfied.
2.2. Collaborative filtering recommendation algorithm based on matrix decomposition
The idea of the collaborative filtering algorithm based on matrix decomposition is to decompose the higher-dimensional “user-movie” rating matrix into the product of two lower-dimensional matrices. These two low-dimensional matrices are the user latent factor matrix and Project latent factor matrix, where $k$ is the number of latent factor features, as shown in Eq. (6):
For the existing $n$ score records, the square of error is used to calculate the loss function of each score. The specific formula is as follows:
To prevent overfitting, regularization terms are added to the overall loss function:
where $\lambda $ is the regularization coefficient, further, the gradient descent method is used to deal with the minimization problem, the core problem of the matrix factorization model is to minimize the overall loss function of the above formula by finding the appropriate parameters $P$ and $Q$.
3. Bearing fault identification based on ASMOTE-CFR
ASMOTE-CFR is based on the unbalance of data in massive data. First, the ASMOTE algorithm is used to equalize a few samples of faulty bearings. Further combined with the CFR method to design specific scoring rules to establish the corresponding scoring matrix, so as to effectively solve the problem of low accuracy in unbalanced data sets. Then extract the typical characteristic values in the time domain, the fuzzy entropy value in the frequency domain and the wavelet packet entropy value in the frequency domain to obtain the bearing feature matrix, and then design a scoring matrix that accurately describes the bearing state. Finally, these two matrices with different characteristics are organically Combined, a joint scoring matrix for bearing status identification is obtained. Based on the joint scoring matrix, the bearing status is effectively identified.
Suppose there are signal data of $u$ group of rolling bearings $({S}^{1},{S}^{1},\cdots ,{S}^{k},{S}^{k+1},\cdots ,{S}^{u-1},{S}^{u})$ and there are $v$ different types of states) $({Z}_{1},{Z}_{2},{Z}_{3},\dots ,{Z}_{v})$. In the signal data of group $u$ rolling bearings, it is assumed that the set of minority samples is ${X}_{s}=\{{X}_{1},{X}_{2},\dots ,{X}_{n}\}$, the set of majority samples is ${X}_{m}=\{{X}_{1},{X}_{2},\dots ,{X}_{m}\}$, ${X}_{n}$ represents the feature vector of the $n$ minority sample, and ${X}_{m}$ represents the feature vector of the $m$ majority sample. and here $(m+n\le u)$. Calculate the number of samples to be synthesized by $G=({X}_{m}-{X}_{s})\mathrm{*}b$, $b\in \left(\mathrm{0,1}\right)$, and for the minority sample ${X}_{s}$, use the Euclidean distance to calculate the $h$ nearest neighbor, and then randomly choose one minority data example, ${x}_{zi}$ ,from the $h$ nearest neigh bors for data ${x}_{i}$ and synthesize according to ${S}_{i}={X}_{s}+({X}_{s}-{X}_{i})\times \lambda $. The sample data after ASMOTE will increase by certain percentage. Assuming that the data after ASMOTE has $w$ group, the state of the previous $k$ group of training data ${S}^{1},{S}^{1},\cdots ,{S}^{k}$ is known, and now the CFR is used to identify the state of the $w-k+1$ group of test data. ${S}^{k+1},\cdots ,{S}^{w}.$
In the $i$ group of data, 17 features are extracted in the time domain, which are average, root mean square value, root square amplitude, rectified average, kurtosis, variance, maximum, minimum, peak-to-peak value, Standard deviation, waveform index, peak index, pulse index, margin index, skewness index, kurtosis index. Frequency domain extraction fuzzy entropy and sample entropy, time-frequency domain extraction wavelet packet energy entropy and EMD decomposition into 12 Each order component IMF entropy extracts a total of 32 mixed domain features.
The entropy extraction is defined as follows.
Assuming that the energy corresponding to ${S}_{aj}^{i}$$(i=\mathrm{0,1},2,\cdots ,b)$ is $e$$(j=\mathrm{0,1},2,\cdots ,b)$, then:
Then the total energy of the signal is:
then the entropy is:
According to the information entropy, the fuzzy entropy in the frequency domain, the sample entropy, the IMF entropy of the EMD components in the time-frequency domain, and the wavelet packet entropy are obtained. Furthermore, the 32 feature extraction values are used as elements to construct a normalized feature vector as follows:
According to the corresponding state of the bearing, the paper designs the state score table of the bearing, as shown in the Table 1 and obtains the corresponding state score matrix $B$.
As shown in the Table 2, the maximum value of the corresponding state for the training data ${S}^{1},{S}^{2},\cdots ,{S}^{w}$ is 1 and the given state is recorded as the minimum value $\epsilon $ ($\epsilon $ is a number infinitely close to 0), and for the test data ${S}^{k+1},\cdots ,{S}^{w}$, the score of the state ${Z}_{v}$ is unknown, given a value of 0, and recorded as ${R}_{i\mathrm{\text{'}}}^{j}\mathrm{}(i\mathrm{\text{'}}=k+1,k+2,\cdots ,w,j=\mathrm{1,2},\cdots ,v)$.
Table 1. Bearing characteristic score table
Feature | Dataset | ||||||
${S}^{1}$ | ${S}^{2}$ | … | ${S}^{k}$ | ${S}^{k+1}$ | … | ${S}^{w}$ | |
${{f}_{a0}}^{i}$ | ${{f}_{a0}}^{1}$ | ${{f}_{a0}}^{2}$ | … | ${{f}_{a0}}^{k}$ | ${{f}_{a0}}^{k+1}$ | … | ${{f}_{a0}}^{w}$ |
${{f}_{a1}}^{i}$ | ${{f}_{a1}}^{1}$ | ${{f}_{a1}}^{2}$ | … | ${{f}_{a1}}^{k}$ | ${{f}_{a1}}^{k+1}$ | … | ${{f}_{a1}}^{w}$ |
${{f}_{a2}}^{i}$ | ${{f}_{a2}}^{1}$ | ${{f}_{a2}}^{2}$ | … | ${{f}_{a2}}^{k}$ | ${{f}_{a2}}^{k+1}$ | … | ${{f}_{a2}}^{w}$ |
$\vdots $ | $\vdots $ | $\vdots $ | $\ddots $ | $\vdots $ | $\vdots $ | $\ddots $ | $\vdots $ |
${{f}_{ab}}^{i}$ | ${{f}_{ab}}^{1}$ | ${{f}_{ab}}^{2}$ | … | ${{f}_{ab}}^{k}$ | ${{f}_{ab}}^{k+1}$ | … | ${{f}_{ab}}^{w}$ |
Table 2. Bearing condition score table
Bearing status | ${S}^{1}$ | ${S}^{2}$ | … | ${S}^{k}$ | ${S}^{k+1}$ | … | ${S}^{w}$ |
${Z}_{1}$ | 1 | $\epsilon $ | … | $\epsilon $ | ${R}_{1}^{k+1}$ | … | ${R}_{1}^{w}$ |
${Z}_{2}$ | $\epsilon $ | 1 | … | $\epsilon $ | ${R}_{2}^{k+1}$ | … | ${R}_{2}^{w}$ |
$\vdots $ | $\vdots $ | $\vdots $ | $\ddots $ | $\vdots $ | $\vdots $ | $\ddots $ | $\vdots $ |
${Z}_{v}$ | $\epsilon $ | $\epsilon $ | … | 1 | ${R}_{v}^{k+1}$ | … | ${R}_{v}^{w}$ |
This paper combines the bearing feature scoring matrix $A$ and the bearing status scoring matrix $B$ to obtain a joint scoring matrix $C$ for bearing status recognition; in order to diagnose the state of the test data, we need to decompose the joint scoring matrix $C$ into two low-dimensional feature matrices $P$ and $Q$, it is $C=P\mathrm{*}{Q}^{T}$. Furthermore, the state score of the test data is predict ${P}_{i\mathrm{\text{'}}}^{j}$$(i\mathrm{\text{'}}=k+1,k+2,\cdots ,w;j=\mathrm{1,2},\cdots ,v)$ based on these two feature matrices. Finally, the gradient descent method is used to find the optimal parameters $P$ and $Q$ to minimize the overall loss function, and then the test data ${S}^{k+1}$ predicts the score ${R}_{i\mathrm{\text{'}}}^{j}\mathrm{}(i\mathrm{\text{'}}=k+1,k+2,\cdots ,w;j=\mathrm{1,2},\cdots ,v)$ for the state ${Z}_{j}$, where ${R}_{i\mathrm{\text{'}}}^{j}={P}_{i\mathrm{\text{'}}}^{j}\mathrm{*}{Q}_{i\mathrm{\text{'}}}^{j}$, then the state ${Z}_{j}$ corresponding to the highest score ${R}_{i\mathrm{\text{'}}}^{j}$ is the predicted test data state ${S}^{k+1}$.
4. Example verification of different failure forms of bearing outer ring
In order to further verify the effectiveness of the fault identification method proposed in this paper, this section identifies different forms of faults on the bearing outer ring. Using the bearing test stand as shown Fig. 3, set the speed to 1200 rpm and the sampling frequency to 16384 Hz. Experiment with 6205EKA deep groove ball bearings. Collect 402 groups outer ring pitting corrosion and 390 groups outer ring cracks (as shown Fig. 2), outer ring current damage (as shown Fig. 1) 85 groups and normal 423 groups total 1300 sets of data samples.
First use ASMOTE to take 423 groups of normal state samples as reference, oversample a few types of shaft current damage samples by 3 times, and finally get 255 groups of shaft current damage samples, and then further equalize the total 1470 groups of samples according to 6:2:2 ratio is randomly divided into a training set (882 groups), a cross-validation set (294 groups) and a test set (294 groups), and a state-of-the-art recognition is performed using a collaborative filtering recommendation system for bearing state recognition.
As can be seen from the Fig. 5, when the regularization coefficients $\lambda =$ 0.002 and $K=$ 11, the bearing condition score of the test set reached 99.23 %, and when $K=$ 11, $\lambda $ is 0.0025, 0.003, and 0.0035, the accuracy of the bearing test set of state has reached 98.63 %, 98.98 % and 98.76 %, respectively. The performance of the model on the test set is evaluated, which proves that the model has good generalization ability under this parameter.
Fig. 1. Shaft current damage
Fig. 2. Crack damage
Fig. 3. Test bench
Fig. 4. Accuracy identification CFR
Fig. 5. Accuracy identification ASMOTE- CFR
Fig. 6. Compare $k=$11 the recognition rate CFR and ASMOTE-CFR
Taking $\lambda =$0.002 and $K=$11 as examples, the Table 3 shows the specific recognition of the model for various states on the test set.
Table 3. Test set recognition effect
Bearing status | Number of test samples | Recognize the number correctly | Recognize the number false | State recognition accuracy |
Crack | 69 | 67 | 2 | 97 % |
Putting | 79 | 79 | 0 | 100 % |
Shaft current | 49 | 49 | 0 | 100 % |
Normal | 97 | 49 | 0 | 100 % |
Total | 294 | 292 | 2 | 99 % |
5. Conclusions
In this paper, the combination of adaptive synthetic minority oversampling technology (ASMOTE) and matrix decomposition-based collaborative filtering technology (CFR) is applied to the field of mechanical equipment fault recognition. For the identification of rolling bearing states, this paper oversamples a few types of shaft current samples by three times, then extracts 32 typical features in time domain, frequency domain, time frequency domain and other multi-domain states to construct a bearing feature matrix, and then designs an accurate description of the bearing status , And finally combine these two matrices with different characteristics organically to obtain a joint scoring matrix for bearing status identification. Experiments with different regularization coefficients and eigenvalues on bearings with pitting corrosion, cracks, and current damage on the outer ring of rolling bearings and normal bearings, the highest accuracy rate reached more than 98 %. Compared with CFR, the accuracy of method ASMOTE-CFR is improved by 8 %.
Acknowledgements
Financial support from National Natural Science Foundation of China (51575178), financial support from Hunan Natural Science Foundation of China (2018JJ2120) and Hunan Power Machinery Research Institute of AECC.
References
- Manlangit S., Azam S., Shanmugam B., et al. An efficient method for detecting fraudulent transactions using classification algorithms on an anonymized credit card data set. Proceedings of International Conference on Intelligent Systems Design and Applications, 2017. [Search CrossRef]
- Liu C., Wu J., Mirador L., et al. Classifying DNA methylation imbalance data in cancer risk prediction using Smote and Tomek Lonk methods. Communications in Computer and Information Science, Vol. 902, Issue 5, 2018, p. 1-9. [Search CrossRef]
- Al-Azani S., El-Alfy E.-S.-M. Using word embeddings and ensemble learning for highly imbalanced data sentiment analysis in short Arabic text. Procedia Computer Science, Vol. 109, Issue 22, 2017, p. 359-366. [Publisher]
- Ebo Bennin K., Keung J., Phannachitta P., et al. MAHAKIL: diversity based oversampling approach to alleviate the class imbalance issue in software defect prediction. IEEE Transactions on Software Engineering, Vol. 44, Issue 1, 2017, p. 534-550. [Search CrossRef]
- Saez J. A., Luengo J., Stefanowski J., Herrera F. SMOTE-IPF: Addressing the noisy and borderline examples problem in imbalanced classification by a re-sampling method with filtering. Information Sciences, Vol. 291, Issue 10, 2015, p. 184-203. [Publisher]
- Guo Gui Bing, Zhang Jie, Thalmann Daniel, et al. From ratings to trust: an empirical study of implicit trust in recommender systems. Proceedings of the 29th Annual ACM Symposium on Applied Computing, 2014. [Publisher]
- Kim MinGun, Kim Kyoungjae Recommender systems using SVD with social network information. Journal of Intelligence and Information Systems, Vol. 2, Issue 4, 2016, p. 1-18. [Search CrossRef]
- Parham Moradi, Sajad Ahmadian A reliability-based recommendation method to improve trust-aware recommender systems. Expert Systems with Applications, Vol. 42, Issue 21, 2015, p. 7386-7398. [Publisher]
- Ma Hao, Yang Hai Xuan, Lyu Michael R., et al. So Rec: social recommendation using probabilistic matrix factorization. Proceedings of the17th ACM Conference on Information and Knowledge Management, 2008. [Search CrossRef]
- Rodriguez T., Di Persia L. E., Milone D. H., et al. Extreme learning machine prediction under high class imbalance in bioinformatics. Latin American Computer Conference, 2017. [Search CrossRef]
- Moreo A., Esuli A., Sebastiani F. Distributional random oversampling for imbalanced text classification. Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information, 2016. [Search CrossRef]