Random Forests and Kernel Methods
From MaRDI portal
Abstract: Random forests are ensemble methods which grow trees as base learners and combine their predictions by averaging. Random forests are known for their good practical performance, particularly in high dimensional set-tings. On the theoretical side, several studies highlight the potentially fruitful connection between random forests and kernel methods. In this paper, we work out in full details this connection. In particular, we show that by slightly modifying their definition, random forests can be rewrit-ten as kernel methods (called KeRF for Kernel based on Random Forests) which are more interpretable and easier to analyze. Explicit expressions of KeRF estimates for some specific random forest models are given, together with upper bounds on their rate of consistency. We also show empirically that KeRF estimates compare favourably to random forest estimates.
Cited in
(29)- Modification of random forest based approach for streaming data with concept drift
- Random forest estimation of conditional distribution functions and conditional quantiles
- Rates of convergence for random forests via generalized U-statistics
- Random Forests for Spatially Dependent Data
- Smoothing and adaptation of shifted Pólya tree ensembles
- Approximation error from discretizations and its applications
- Random forests and selected samples
- Model-Assisted Estimation Through Random Forests in Finite Population Sampling
- scientific article; zbMATH DE number 6781369 (Why is no real title available?)
- A random forest guided tour
- Interpreting uninterpretable predictors: kernel methods, Shtarkov solutions, and random forests
- Prescriptive analytics for data-driven capacity management
- Improved convergence rates for some kernel random forest algorithms
- Nonunitarizable Representations and Random Forests
- Dimension Reduction Forests: Local Variable Importance Using Structured Random Forests
- scientific article; zbMATH DE number 7370525 (Why is no real title available?)
- Debiased machine learning for logistic partially linear mediation models with high-dimensional confounders
- Random Forest Prediction Intervals
- Towards optimal doubly robust estimation of heterogeneous causal effects
- New forest-based approaches for sufficient dimension reduction
- Boosting Random Forests to Reduce Bias; One-Step Boosted Forest and Its Variance Estimate
- Random forests
- Measuring the algorithmic convergence of randomized ensembles: the regression setting
- Nonparametric binary regression models with spherical predictors based on the random forests kernel
- Neural networks meet random forests
- Estimating the algorithmic variance of randomized ensembles via the bootstrap
- Stochastic Geometry to Generalize the Mondrian Process
- scientific article; zbMATH DE number 7307469 (Why is no real title available?)
- A suite of intelligent tools for early detection and prevention of blackouts in power interconnections
This page was built for publication: Random Forests and Kernel Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976982)
