Contrast trees and distribution boosting
From MaRDI portal
Publication:5073143
Abstract: Often machine learning methods are applied and results reported in cases where there is little to no information concerning accuracy of the output. Simply because a computer program returns a result does not insure its validity. If decisions are to be made based on such results it is important to have some notion of their veracity. Contrast trees represent a new approach for assessing the accuracy of many types of machine learning estimates that are not amenable to standard (cross) validation methods. In situations where inaccuracies are detected boosted contrast trees can often improve performance. A special case, distribution boosting, provides an assumption free method for estimating the full probability distribution of an outcome variable given any set of joint input predictor variable values.
Cites work
- A decision-theoretic generalization of on-line learning and an application to boosting
- Asymptotic Theory of Certain "Goodness of Fit" Criteria Based on Stochastic Processes
- Building more accurate decision trees with the additive tree
- Fifty years of classification and regression trees
- Generalized random forests
- Greedy function approximation: A gradient boosting machine.
- Heteroscedastic BART via Multiplicative Regression Trees
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 3535474 (Why is no real title available?)
- scientific article; zbMATH DE number 708500 (Why is no real title available?)
- Problems in the Analysis of Survey Data, and a Proposal
- Quantile regression forests
- Random forests
- Transformation boosting machines
Cited in
(3)
This page was built for publication: Contrast trees and distribution boosting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5073143)