Data-driven multinomial random forest

Junhao Chen, Xueli wang
4/9/2023
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

In this article, we strengthen the proof methods of some previously weakly consistent variants of random forests into strongly consistent proof methods, and improve the data utilization of these variants, in order to obtain better theoretical properties and experimental performance. In addition, based on the multinomial random forest (MRF) and Bernoulli random forest (BRF), we propose a data-driven multinomial random forest (DMRF) algorithm, which has lower complexity than MRF and higher complexity than BRF while satisfying strong consistency. It has better performance in classification and regression problems than previous RF variants that only satisfy weak consistency, and in most cases even surpasses standard random forest. To the best of our knowledge, DMRF is currently the most excellent strongly consistent RF variant with low algorithm complexity

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

A Powerful Random Forest Featuring Linear Extensions (RaFFLE)

80% match2025

Grafting: Making Random Forests Consistent

79% match2024

Random Forest Calibration

79% match1 repo2025

A survey and taxonomy of methods interpreting random forest models

78% match2024

Very fast, approximate counterfactual explanations for decision forests

77% match2023

Randomness control and reproducibility study of random forest algorithm in R and Python

77% match2024

Cite this paper

@article{chen2023datadriven,
  title  = {Data-driven multinomial random forest},
  author = {Junhao Chen and Xueli wang},
  year   = {2023},
  eprint = {2304.04240},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.04240v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.04240.svg)](https://codeofpaper.com/paper/2304.04240)

Discussion