Generalised Random Forest Space Overview
Assuming a view of the Random Forest as a special case of a nested ensemble of interchangeable modules, we construct a generalisation space allowing one to easily develop novel methods based on this algorithm. We discuss the role and required properties of modules at each level, especially in context of some already proposed RF generalisations.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Generalised Boosted Forests
This paper extends recent work on boosting random forests to model non-Gaussian responses. Given an exponential family $\mathbb{E}[Y|X] = g^{-1}(f(X))$ our goal is to obtain an estimate for $f$. We start with an MLE-type…
Deforestation and world population sustainability: a quantitative analysis
In this paper we afford a quantitative analysis of the sustainability of current world population growth in relation to the parallel deforestation process adopting a statistical point of view. We consider a simplified mo…
Oblique and rotation double random forest
Random Forest is an ensemble of decision trees based on the bagging and random subspace concepts. As suggested by Breiman, the strength of unstable learners and the diversity among them are the ensemble models' core stre…
DiversityComputing AIC for black-box models using Generalised Degrees of Freedom: a comparison with cross-validation
Generalised Degrees of Freedom (GDF), as defined by Ye (1998 JASA 93:120-131), represent the sensitivity of model fits to perturbations of the data. As such they can be computed for any statistical model, making it possi…
regressionLearning Clique Forests
We propose a topological learning algorithm for the estimation of the conditional dependency structure of large sets of random variables from sparse and noisy data. The algorithm, named Maximally Filtered Clique Forest (…
parameter estimation