Improving random forest algorithm by Lasso method

DOI10.1080/00949655.2020.1814776MaRDI QIDQ5033957zbMATH OpenOpenAlexFDO

Authors Hui Wang, Guizhi Wang

Publication date 24 February 2022

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

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

zbMATH Keywords

decision treesensemble learningLassopost-selectionpredictionrandom forest

Mathematics Subject Classification ID

Statistics (62-XX)

Recommendations

• A random forest guided tour
• Double random forest
• Random forest with acceptance-rejection trees
• Machine Learning: ECML 2004
• Random forests

Cites work

• A decision-theoretic generalization of on-line learning and an application to boosting
• A general lower bound on the number of examples needed for learning
• A new variable selection approach using random forests
• Bagging predictors
• Bootstrap methods: another look at the jackknife
• Greedy function approximation: A gradient boosting machine.
• scientific article; zbMATH DE number 6378123 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Linear programming boosting via column generation
• Machine Learning: ECML 2004
• Quantifying uncertainty in random forests via confidence intervals and hypothesis tests
• Random forests
• Signal Recovery by Proximal Forward-Backward Splitting

Cited in

(3)

• Nonparametric feature selection by random forests and deep neural networks
• Improved Random Forest for Classification
• Improving random forest algorithm by selecting appropriate penalized method

Describes a project that uses

Uses Software

• GeneSrF
• AdaBoost.MH

This page was built for publication: Improving random forest algorithm by Lasso method

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