IDEAS home Printed from https://ideas.repec.org/a/spr/advdac/v12y2018i4d10.1007_s11634-018-0318-1.html
   My bibliography  Save this article

An efficient random forests algorithm for high dimensional data classification

Author

Listed:
  • Qiang Wang

    (Shenzhen University)

  • Thanh-Tung Nguyen

    (Thuyloi University
    Unité de Modélisation Mathématiques et Informatique des Systèmes Complexes)

  • Joshua Z. Huang

    (Shenzhen University)

  • Thuy Thi Nguyen

    (Vietnam National University of Agriculture)

Abstract

In this paper, we propose a new random forest (RF) algorithm to deal with high dimensional data for classification using subspace feature sampling method and feature value searching. The new subspace sampling method maintains the diversity and randomness of the forest and enables one to generate trees with a lower prediction error. A greedy technique is used to handle cardinal categorical features for efficient node splitting when building decision trees in the forest. This allows trees to handle very high cardinality meanwhile reducing computational time in building the RF model. Extensive experiments on high dimensional real data sets including standard machine learning data sets and image data sets have been conducted. The results demonstrated that the proposed approach for learning RFs significantly reduced prediction errors and outperformed most existing RFs when dealing with high-dimensional data.

Suggested Citation

  • Qiang Wang & Thanh-Tung Nguyen & Joshua Z. Huang & Thuy Thi Nguyen, 2018. "An efficient random forests algorithm for high dimensional data classification," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(4), pages 953-972, December.
    • Handle: RePEc:spr:advdac:v:12:y:2018:i:4:d:10.1007_s11634-018-0318-1
    DOI: 10.1007/s11634-018-0318-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11634-018-0318-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11634-018-0318-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Baoxun Xu & Joshua Zhexue Huang & Graham Williams & Qiang Wang & Yunming Ye, 2012. "Classifying Very High-Dimensional Data with Random Forests Built from Small Subspaces," International Journal of Data Warehousing and Mining (IJDWM), IGI Global, vol. 8(2), pages 44-63, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Oyebayo Ridwan Olaniran & Ali Rashash R. Alzahrani, 2023. "On the Oracle Properties of Bayesian Random Forest for Sparse High-Dimensional Gaussian Regression," Mathematics, MDPI, vol. 11(24), pages 1-29, December.
    2. Erika Slabber & Tanja Verster & Riaan de Jongh, 2023. "Some Insights about the Applicability of Logistic Factorisation Machines in Banking," Risks, MDPI, vol. 11(3), pages 1-21, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhao, He & Williams, Graham J. & Huang, Joshua Zhexue, 2017. "wsrf: An R Package for Classification with Scalable Weighted Subspace Random Forests," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 77(i03).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:advdac:v:12:y:2018:i:4:d:10.1007_s11634-018-0318-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.