Results 281 to 290 of about 360,197 (329)

Empirical Likelihood for Random Forests and Ensembles

open access: green
Chiang, Harold D.   +2 more
openalex   +1 more source

Features with their corresponding Gini feature importance scores for decision trees and random forests predicting hospitalizations after outpatient urinary tract infection (UTI).

open access: green
Varuni Sarwal (6291391)   +4 more
openalex   +1 more source
Some of the next articles are maybe not open access.

Related searches:

Optimizing random forests: spark implementations of random genetic forests

BOHR International Journal of Engineering, 2022
The Random Forest (RF) algorithm, originally proposed by Breiman et al. (1), is a widely used machine learning algorithm that gains its merit from its fast learning speed as well as high classification accuracy. However, despiteits widespread use, the different mechanisms at work in Breiman’s RF are not yet fully understood, and there is stillon-going ...
Sikha Bagui, Timothy Bennett
openaire   +1 more source

A comparison of random forest based algorithms: random credal random forest versus oblique random forest

Soft Computing, 2018
Random forest (RF) is an ensemble learning method, and it is considered a reference due to its excellent performance. Several improvements in RF have been published. A kind of improvement for the RF algorithm is based on the use of multivariate decision trees with local optimization process (oblique RF).
Carlos J. Mantas   +3 more
openaire   +1 more source

Random Forest

Journal of Insurance Medicine, 2017
For the task of analyzing survival data to derive risk factors associated with mortality, physicians, researchers, and biostatisticians have typically relied on certain types of regression techniques, most notably the Cox model. With the advent of more widely distributed computing power, methods which require more complex mathematics have become ...
openaire   +2 more sources

On learning Random Forests for Random Forest-clustering

2020 25th International Conference on Pattern Recognition (ICPR), 2021
In this paper we study the poorly investigated problem of learning Random Forests for distance-based Random Forest clustering. We studied both classic schemes as well as alternative approaches, novel in this context. In particular, we investigated the suitability of Gaussian Density Forests [1], Random Forests specifically designed for density ...
Bicego, M, Escolano, F
openaire   +2 more sources

Components of Random Forests

Combinatorics, Probability and Computing, 1992
A forest ℱ(n, M) chosen uniformly from the family of all labelled unrooted forests with n vertices and M edges is studied. We show that, like the Érdős-Rényi random graph G(n, M), the random forest exhibits three modes of asymptotic behaviour: subcritical, nearcritical and supercritical, with the phase transition at the point M = n/2.
Łuczak, Tomasz, Pittel, Boris
openaire   +2 more sources

Home - About - Disclaimer - Privacy