A tree approach for variable selection and its random forest
From MaRDI portal
Cites work
- A computationally fast variable importance test for random forests for high-dimensional data
- A generic sure independence screening procedure
- A Mathematical Theory of Communication
- Algorithmic Learning Theory
- Bagging predictors
- Composite coefficient of determination and its application in ultrahigh dimensional variable screening
- Distribution Free Tests of Independence Based on the Sample Distribution Function
- Estimating the dimension of a model
- Feature screening via distance correlation learning
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 410126 (Why is no real title available?)
- scientific article; zbMATH DE number 3444596 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Jackknife approach to the estimation of mutual information
- Local independence feature screening for nonparametric and semiparametric models by marginal empirical likelihood
- Martingale difference correlation and its use in high-dimensional variable screening
- Measuring and testing dependence by correlation of distances
- Model-free feature screening for ultrahigh dimensional data through a modified Blum-Kiefer-Rosenblatt correlation
- Model-free feature screening for ultrahigh-dimensional data
- Optimal rates of convergence for nonparametric estimators
- Random forests
- Stochastic gradient boosting.
- Sure independence screening for ultrahigh dimensional feature space. With discussion and authors' reply
- Ultrahigh dimensional feature selection: beyond the linear model
- Variable selection in high-dimensional linear models: partially faithful distributions and the PC-simple algorithm
This page was built for publication: A tree approach for variable selection and its random forest
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955449)
