Node harvest

DOI10.1214/10-AOAS367zbMath1220.62084arXiv0910.2145OpenAlexW3037729706MaRDI QIDQ542973

Nicolai Meinshausen

Publication date: 20 June 2011

Published in: The Annals of Applied Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.2145

zbMATH Keywords

quadratic programmingtreesmachine learningrandom forestssparsitytree ensembles

Mathematics Subject Classification ID

Related Items (15)

Mathematical optimization in classification and regression trees ⋮ The Delaunay triangulation learner and its ensembles ⋮ Disjunctive Rule Lists ⋮ Supervised classification and mathematical optimization ⋮ Conclusive local interpretation rules for random forests ⋮ Model transparency and interpretability: survey and application to the insurance industry ⋮ SUBiNN: a stacked uni- and bivariate \(k\)NN sparse ensemble ⋮ On optimal regression trees to detect critical intervals for multivariate functional data ⋮ Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model ⋮ A decision-theoretic approach for model interpretability in Bayesian framework ⋮ SIRUS: stable and interpretable RUle set for classification ⋮ Learning customized and optimized lists of rules with mathematical programming ⋮ Imputation Scores ⋮ Ensemble of optimal trees, random forest and random projection ensemble classification ⋮ Consistent regression using data-dependent coverings

Uses Software

• R
• UCI-ml
• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• Predictive learning via rule ensembles
• A numerically stable dual method for solving strictly convex quadratic programs
• Bagging predictors
• Random survival forests
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Least angle regression. (With discussion)
• Stacked regressions
• Forest Garrote
• Atomic Decomposition by Basis Pursuit
• Boosting With theL₂Loss
• Probabilistic Sensitivity Analysis of Complex Models: A Bayesian Approach
• Breast Cancer Diagnosis and Prognosis Via Linear Programming
• Convexity, Classification, and Risk Bounds
• Random Forests and Adaptive Nearest Neighbors
• The elements of statistical learning. Data mining, inference, and prediction
• Random forests

This page was built for publication: Node harvest