Skip to content
naulon
Not checkedNot checked for notices yet.

An Ensemble Learning and RUL Prediction Method Based on Bearings Degradation Indicator Construction

Qiaoping Tian, Honglei Wang

Applied Sciences · 2020

doi:10.3390/app10010346 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

The prediction of the remaining life of a bearing plays a vital role in reducing the accident-related maintenance costs of machinery and in improving the reliability of machinery and equipment. To predict bearing remaining useful life (RUL), the abilities of statistical characteristics to reflect the bearing degradation state differ, and the single prediction model has low generalization ability and a poor prediction effect. An ensemble robust prediction method is proposed here to predict bearing RUL based on the construction of a bearing degradation indicator set: the initial bearing degradation indicator subsets were constructed using the Fast Correlation-Based Filter with Approximate Markov Blankets (FCBF-AMB) and Maximal Information Coefficient (MIC) selection methods. Through the cross-operation of the obtained subsets, we obtained a set of robust degradation indicators. These selected degradation indicators were fed into the long short-term memory (LSTM) neural network prediction model enhanced by the AdaBoost algorithm. We found through calculation that the average prediction accuracy of the proposed method is 91.40%, 92.04%, and 93.25% at 2100, 2250, and 2400 rpm, respectively. Compared with other methods, the proposed method improves the prediction accuracy by 1.8% to 14.87% at most. Therefore, the method proposed in this paper is more accurate than the other methods in terms of RUL prediction.

Abstract licence: CC BY

References45

  1. 40.

44 more references, whose wording the paper’s licence keeps private.

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.