Improving random forest algorithm by selecting appropriate penalized method
From MaRDI portal
Cites work
- A Recursive Partitioning Decision Rule for Nonparametric Classification
- Bayesian bootstrap adaptive lasso estimators of regression models
- Comment: From Ridge Regression to Methods of Regularization
- Consistency of the group Lasso and multiple kernel learning
- Hedonic housing prices and the demand for clean air
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- Improving accuracy models using elastic net regression approach based on empirical mode decomposition
- Improving random forest algorithm by Lasso method
- Improving the prediction performance of the Lasso by subtracting the additive structural noises
- Model Selection and Estimation in Regression with Grouped Variables
- Optimal partial ridge estimation in restricted semiparametric regression models
- Optimal QR-based estimation in partially linear regression models with correlated errors using GCV criterion
- Random forests
- Regularization and Variable Selection Via the Elastic Net
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Statistics for high-dimensional data. Methods, theory and applications.
- The Adaptive Lasso and Its Oracle Properties
- The elements of statistical learning. Data mining, inference, and prediction
This page was built for publication: Improving random forest algorithm by selecting appropriate penalized method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972424)
