IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v37y2020i1d10.1007_s00357-019-09322-8.html
   My bibliography  Save this article

On Cesáro Averages for Weighted Trees in the Random Forest

Author

Listed:
  • Hieu Pham

    (Iowa State University)

  • Sigurður Olafsson

    (Iowa State University)

Abstract

The random forest is a popular and effective classification method. It uses a combination of bootstrap resampling and subspace sampling to construct an ensemble of decision trees that are then averaged for a final prediction. In this paper, we propose a potential improvement on the random forest that can be thought of as applying a weight to each tree before averaging. The new method is motivated by the potential instability of averaging predictions of trees that may be of highly variable quality, and because of this, we replace the regular average with a Cesáro average. We provide both a theoretical analysis that gives exact conditions under which the new approach outperforms the traditional random forest, and numerical analysis that shows the new approach is competitive when training a classification model on numerous realistic data sets.

Suggested Citation

  • Hieu Pham & Sigurður Olafsson, 2020. "On Cesáro Averages for Weighted Trees in the Random Forest," Journal of Classification, Springer;The Classification Society, vol. 37(1), pages 223-236, April.
    • Handle: RePEc:spr:jclass:v:37:y:2020:i:1:d:10.1007_s00357-019-09322-8
    DOI: 10.1007/s00357-019-09322-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00357-019-09322-8
    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/s00357-019-09322-8?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. Jerome H. Friedman, 2006. "Recent Advances in Predictive (Machine) Learning," Journal of Classification, Springer;The Classification Society, vol. 23(2), pages 175-197, September.
    Full references (including those not matched with items on IDEAS)

    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. Wang Chamont & Gevertz Jana L., 2016. "Finding causative genes from high-dimensional data: an appraisal of statistical and machine learning approaches," Statistical Applications in Genetics and Molecular Biology, De Gruyter, vol. 15(4), pages 321-347, August.
    2. Dong-Yop Oh & J. Gray, 2013. "GA-Ensemble: a genetic algorithm for robust ensembles," Computational Statistics, Springer, vol. 28(5), pages 2333-2347, October.
    3. Milena Buric & Milijana Novovic Buric & Andjela Jaksic Stojanovic & Ljiljana Kascelan & Dragica Zugić, 2022. "Sustainability of Online Teaching: The Case Study Mother Tongue Spelling Course at Montenegrin Universities," Sustainability, MDPI, vol. 14(21), pages 1-27, October.
    4. Stefan Lessmann & Stefan Voß, 2010. "Customer-Centric Decision Support," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 2(2), pages 79-93, April.
    5. Dongyun Nie & Michael Scriney & Xiaoning Liang & Mark Roantree, 2024. "From data acquisition to validation: a complete workflow for predicting individual customer lifetime value," Journal of Marketing Analytics, Palgrave Macmillan, vol. 12(2), pages 321-341, June.

    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:jclass:v:37:y:2020:i:1:d:10.1007_s00357-019-09322-8. 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.