Skip to content
naulon
Not checkedNot checked for notices yet.

A Fault Diagnosis Method of Mine Hoist Disc Brake System Based on Machine Learning

Juanli Li, Shuo Jiang, Menghui Li and 1 more

Applied Sciences · 2020

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

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

Abstract

The performance of the brake system is directly related to the safety and reliability of the mine hoist operation. Mining the useful fault information in the operation of a mine hoist brake system, analyzing the abnormal parts and causes of the equipment, and making accurate early prediction and diagnosis of hidden faults are of great significance to ensure the safe and stable operation of a mine hoist. This study presents a fault diagnosis method for hoist disc brake system based on machine learning. First, the monitoring system collects the information of the hoist brake system, extracts the fault features, and pretreats it by SPSS (Statistical Product and Service Solutions). This work provides data support for fault classification. Then, due to the complex structure of the hoist brake system, the relationship between the fault factors often has a significant impact on the fault. Considering the correlation between the fault samples and the attributes of each sample data, the C4.5 decision tree algorithm is improved by adding Kendall concordance coefficient, and the improved algorithm is used to train the sample data to get the decision tree classification model. Finally, the fault sample of the hoist brake system is trained to get the algorithm model, and then the fault diagnosis rules are generated. The state of the brake system is judged by classifying the data. Experiments show that the improved C4.5 decision tree algorithm takes the relativity of conditional attributes into account, has a higher diagnostic accuracy when processing more data, and has concise and clear fault classification rules, which can meet the needs of hoist fault diagnosis.

Abstract licence: CC BY

References22

    22 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.