Contrast trees and distribution boosting

DOI10.1073/pnas.1921562117zbMath1485.62033arXiv1912.03785OpenAlexW3062089313WikidataQ98575712 ScholiaQ98575712MaRDI QIDQ5073143

Jerome H. Friedman

Publication date: 5 May 2022

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Nonparametric estimation (62G05)

Related Items (2)

Unnamed Item ⋮ conTree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedy function approximation: A gradient boosting machine.
• Generalized random forests
• A decision-theoretic generalization of on-line learning and an application to boosting
• Transformation boosting machines
• Heteroscedastic BART via Multiplicative Regression Trees
• Fifty Years of Classification and Regression Trees
• Building more accurate decision trees with the additive tree
• Problems in the Analysis of Survey Data, and a Proposal
• Asymptotic Theory of Certain "Goodness of Fit" Criteria Based on Stochastic Processes
• Random forests

This page was built for publication: Contrast trees and distribution boosting