Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

GARF: Towards Self-optimised Random Forests

  • Conference paper
Neural Information Processing (ICONIP 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7664))

Included in the following conference series:

Abstract

Ensemble learning is a machine learning approach that utilises a number of classifiers to contribute via voting to identifying the class label for any unlabelled instances. Random Forests RF is an ensemble classification approach that has proved its high accuracy and superiority. However, most of the commonly used selection methods are static. Motivated by the idea of having self-optimised RF capable of dynamical changing the trees in the forest. This study uses a genetic algorithm GA approach to further enhance the accuracy of RF. The approach is termed as Genetic Algorithm based RF (GARF). Our extensive experimental study has proved that RF performance is be boosted using the GA approach.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

Similar content being viewed by others

References

  1. Asuncion, D.N.A.: UCI machine learning repository (2007)

    Google Scholar 

  2. Abdulsalam, H., Skillicorn, D.B., Martin, P.: Classification using streaming random forests. IEEE Trans. Knowl. Data Eng. 23, 22–36 (2011)

    Article  Google Scholar 

  3. Bader-El-Den, M., Poli, R.: Generating SAT Local-Search Heuristics Using a GP Hyper-Heuristic Framework. In: Monmarché, N., Talbi, E.-G., Collet, P., Schoenauer, M., Lutton, E. (eds.) EA 2007. LNCS, vol. 4926, pp. 37–49. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  5. Breiman, L.: Random forests. Machine Learning 45, 5–32 (2001)

    Article  MATH  Google Scholar 

  6. Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Statistics/Probability Series. Wadsworth Publishing Company, Belmont (1984)

    MATH  Google Scholar 

  7. Freund, Y., Schapire, R.E.: A Decision-Theoretic Generalization of On-Line Learning and An Application to Boosting. In: Vitányi, P.M.B. (ed.) EuroCOLT 1995. LNCS, vol. 904, pp. 23–37. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  8. Haupt, R.L., Haupt, S.E.: Practical Genetic Algorithms. Wiley (2004)

    Google Scholar 

  9. Holland, J.H.: Adaptation in natural and artificial systems. MIT Press, Cambridge (1992)

    Google Scholar 

  10. Martin-Bautista, M., Vila, M.A.: A survey of genetic feature selection in mining issues. In: Proceedings of the Congress on Evolutionary Computation, CEC 1999, vol. 2 (1999)

    Google Scholar 

  11. Norenkov, I.: Scheduling and allocation for simulation and synthesis of cad system hardware. In: Proceedings EWITD 1994, East-West International Conference, ICSTI, Moscow, pp. 20–24 (1994)

    Google Scholar 

  12. Robnik-Šikonja, M.: Improving Random Forests. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol. 3201, pp. 359–370. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Robnik-Sikonja, M., Kononenko, I.: Theoretical and empirical analysis of relieff and rrelieff. Mach. Learn. 53, 23–69 (2003)

    Article  MATH  Google Scholar 

  14. Sylvester, J., Chawla, N.: Evolutionary ensemble creation and thinning. In: International Conference on Neural Networks, pp. 5148–5155. IEEE (2006)

    Google Scholar 

  15. Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. The Morgan Kaufmann Series in Data Management Systems. Morgan Kaufmann Publishers, San Francisco (2005)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bader-El-Den, M., Gaber, M. (2012). GARF: Towards Self-optimised Random Forests. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds) Neural Information Processing. ICONIP 2012. Lecture Notes in Computer Science, vol 7664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34481-7_62

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34481-7_62

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34480-0

  • Online ISBN: 978-3-642-34481-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics