Skip to main content

Application of Random Forest Algorithm in Machine Fault Diagnosis

  • Conference paper
Engineering Asset Management

Abstract

The purpose of this paper is to present a methodology by which rotating machinery faults can be diagnosed. The proposed method is based on random forests algorithm (RF), a novel assemble classifier which builds a large amount of decision trees to improve on the single tree classifier. Although there are several existed techniques for faults diagnosis, such as artificial neural network, support vector machines etc, the research on RF is meaningful and necessary because of its fast executed speed, the characteristic of tree classifier, and high performance in machine faults diagnosis. Evaluation of the RF based method has been demonstrated by a case study on induction motors faults diagnosis. Experimental results indicate the validity and reliability of RF based fault diagnosis methodology. Furthermore, an optimized form of RF is also provided in this paper. We employ the genetic algorithm to strengthen RF. The capability of optimized RF algorithm is proved with same experimental data. It is the evidence that RF based diagnosis methodology can generate more accurate outcome by combining with other optimization method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7 References

  1. Breiman L. (2001) Random forests. Machine Learning, 40(1), 5–32

    Article  Google Scholar 

  2. Breiman L., Random Forest User Notes.: ftp://ftp.stat.berkeley.edu/pub/users/breiman/notes_on_random_forests_v2.pdf

    Google Scholar 

  3. Gislason PO, Benediktsson JA & Sveinsson JR (2004) Random forest classification of multisource remote sensing and geographic data. Proceedings of IGARSS’ 04 IEEE International, 2, 1049–1052

    Article  Google Scholar 

  4. Remlinger K (2003) Introduction and application of random forest on high throughput screening data from drug discovery. Proceedings of Workshop for the SAMSI Program on Data Mining and Machine Learning

    Google Scholar 

  5. L. Breiman L (1996) Bagging predictors. Machine Learning, 24, 123–140

    MATH  MathSciNet  Google Scholar 

  6. Yang BS, Han T & An JL (2004) ART-KOHONEN neural network for fault diagnosis of rotating machinery. Mechanical Systems and Signal Processing, 18, 645–657

    Article  Google Scholar 

  7. Pal M (2003) Random forests for land cover classification. Geoscience and Remote Sensing Symposium, IGARSS

    Google Scholar 

  8. Dargupta H & Dutta H (2004) Orthogonal decision trees. Proceedings of 4th IEEE International Conference on Data Mining, 427–430

    Google Scholar 

  9. Goldberg GE (1989) Genetic Algorithm in Search, Optimization and Machine Learning. Addison Wesley, New York

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Joseph Mathew Jim Kennedy Lin Ma Andy Tan Deryk Anderson

Rights and permissions

Reprints and permissions

Copyright information

© 2006 CIEAM/MESA

About this paper

Cite this paper

Han, X.D.T., Yang, BS., Lee, SJ. (2006). Application of Random Forest Algorithm in Machine Fault Diagnosis. In: Mathew, J., Kennedy, J., Ma, L., Tan, A., Anderson, D. (eds) Engineering Asset Management. Springer, London. https://doi.org/10.1007/978-1-84628-814-2_82

Download citation

  • DOI: https://doi.org/10.1007/978-1-84628-814-2_82

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84628-583-7

  • Online ISBN: 978-1-84628-814-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics