Skip to main content

Fast Pseudo Random Forest Using Discrimination Hyperspace

  • Conference paper
  • First Online:
Advances in Swarm Intelligence (ICSI 2017)

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

Included in the following conference series:

  • 2133 Accesses

Abstract

In recent years, machine learning technique has been applied to various problems. The improvement of computational power enables the processing of large scale data in a practical time and brought the success of machine learning technique. However, the processing speed of current machine learning models still have a potential to be improved. We are trying to improve the processing speed of Random Forest, which is known as a fast and reliable classification model. In this study, we propose a Discrimination HyperSpace called DHS, which realized a pseudo Random Forest. Experiment results show our method runs much faster than original Random Forest without losing classification performance.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. Breiman, L.: Random forests. Mach. Learn. 45, 5–32 (2001)

    Article  MATH  Google Scholar 

  2. Habe, H.: Random forests. In: CVIM, vol. 182, no. 31, pp. 1–8 (2012)

    Google Scholar 

  3. Shotton, J., Fitzgibbon, A., Cook, M., Sharp, T., Finocchio, M., Moore, R., Kipman, A., Blake, A.: Real-time human pose recognition in parts for single depth images. Commun. ACM 56(1), 116–124 (2013)

    Google Scholar 

  4. Toshev, A., Szegedy, C.: DeepPose: human pose estimation via deep neural networks. In: The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1653–1660 (2014)

    Google Scholar 

  5. Kato, M.F.N, Qi, W.: Automatic image annotation by variational random forests. In: IEICE Technical report, vol. 110, no. 414, PRMU2010-209 (2011)

    Google Scholar 

  6. UCI Machine Learning Repository, iris. https://archive.ics.uci.edu/ml/machine-learning-databases/iris/iris.data

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tojiro Kaneko .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Kaneko, T., Akiyma, H., Aramaki, S. (2017). Fast Pseudo Random Forest Using Discrimination Hyperspace. In: Tan, Y., Takagi, H., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2017. Lecture Notes in Computer Science(), vol 10386. Springer, Cham. https://doi.org/10.1007/978-3-319-61833-3_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-61833-3_40

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-61832-6

  • Online ISBN: 978-3-319-61833-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics