Boosting interaction tree stumps for modeling interactions

DOI10.1016/J.CSDA.2025.108247MaRDI QIDQ6902940zbMATH OpenFDO

Authors Michael P. H. Lau, Tamara Schikowski, Holger Schwender

Publication date 10 November 2025

Published in Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.CSDA.2025.108247

zbMATH Keywords

linear interaction modelsmachine learningpenalized regressionpolygenic risk scores

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Cites work

• \(p\)-values for high-dimensional regression
• A lasso for hierarchical interactions
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons
• Boosting algorithms: regularization, prediction and model fitting
• Greedy function approximation: A gradient boosting machine.
• Group regularized estimation under structural hierarchy
• Hierarchical sparse modeling: a choice of two group Lasso formulations
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 1149432 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Identifying gene-gene interactions using penalized tensor regression
• Least angle regression. (With discussion)
• Multivariate adaptive regression splines
• Node harvest
• Optimal classification trees
• Optimization by simulated annealing
• Penalized interaction estimation for ultrahigh dimensional quadratic regression
• Predictive learning via rule ensembles
• Random forests
• Relaxed Lasso

This page was built for publication: Boosting interaction tree stumps for modeling interactions

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