Guided Random Forest and its application to data approximation

2019-09-02 · Prashant Gupta, Aashi Jindal, Jayadeva, Debarka Sengupta

We present a new way of constructing an ensemble classifier, named the Guided Random Forest (GRAF) in the sequel. GRAF extends the idea of building oblique decision trees with localized partitioning to obtain a global partitioning. We show that global partitioning bridges the gap between decision trees and boosting algorithms. We empirically demonstrate that global partitioning reduces the generalization error bound. Results on 115 benchmark datasets show that GRAF yields comparable or better results on a majority of datasets. We also present a new way of approximating the datasets in the framework of random forests.

📄 PDF Abstract BibTeX arXiv:1909.00659

Code (0)

등록된 구현이 없습니다.

Guided Random Forest in the RRF Package

2013-06-02 · Houtao Deng

Random Forest (RF) is a powerful supervised learner and has been popularly used in many applications such as bioinformatics. In this work we propose the guided random forest (GRF) for feature selection. Similar to a fe…

feature selection

Q-learning with online random forests

2022-04-07 · Joosung Min, Lloyd T. Elliott

$Q$-learning is the most fundamental model-free reinforcement learning algorithm. Deployment of $Q$-learning requires approximation of the state-action value function (also known as the $Q$-function). In this work, we pr…

Q-Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Comments on: "A Random Forest Guided Tour" by G. Biau and E. Scornet

2016-04-06 · Sylvain Arlot, Robin Genuer

This paper is a comment on the survey paper by Biau and Scornet (2016) about random forests. We focus on the problem of quantifying the impact of each ingredient of random forests on their performance. We show that such …

Survey

Multivariate Gaussian Approximation for Random Forest via Region-based Stabilization

2024-03-15 · Zhaoyang Shi, Chinmoy Bhattacharjee, Krishnakumar Balasubramanian, Wolfgang Polonik

We derive Gaussian approximation bounds for $k$-Potential Nearest Neighbor ($k$-PNN) based random forest predictions based on a set of training points given by a Poisson process under fairly mild regularity assumptions o…

Asymptotic confidence bands for centered purely random forests

2025-11-17 · Natalie Neumeyer, Jan Rabe, Mathias Trabs arxiv

In a multivariate nonparametric regression setting we construct explicit asymptotic uniform confidence bands for centered purely random forests. Since the most popular example in this class of random forests, namely the …