Enhancing random forest algorithm performance using non-concave penalization techniques

DOI10.1080/00949655.2026.2632969MaRDI QIDQ7390617zbMATH OpenFDO

Authors H. Bevrani, Mehdi Ebady Manaa

Publication date 2026

Published in Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00949655.2026.2632969

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
• Hedonic housing prices and the demand for clean air
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Improving random forest algorithm by Lasso method
• Improving random forest algorithm by selecting appropriate penalized method
• Nonlinear optimization and support vector machines
• Regularization and Variable Selection Via the Elastic Net
• Smoothly clipped absolute deviation on high dimensions
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

This page was built for publication: Enhancing random forest algorithm performance using non-concave penalization techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7390617)