Building Trees for Probabilistic Prediction via Scoring Rules
From MaRDI portal
Publication:6637486
DOI10.1080/00401706.2024.2343062MaRDI QIDQ6637486
Seth D. Guikema, Unnamed Author, Sara Shashaani, Matthew Plumlee
Publication date: 13 November 2024
Published in: Technometrics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Generalized random forests
- The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality
- The geometry of proper scoring rules
- Consistent nonparametric regression from recursive partitioning schemes
- Estimation of the continuous ranked probability score with limited information and applications to ensemble weather forecasts
- Coherent dispersion criteria for optimal experimental design
- Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory
- Technical note: Some properties of splitting criteria
- Consistency of random forests
- Recursive partitioning for heterogeneous causal effects
- An Overview of Applications of Proper Scoring Rules
- Building Consistent Regression Trees From Complex Sample Data
- Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
- An Introduction to Statistical Learning
- Survival Trees by Goodness of Split
- Strictly Proper Scoring Rules, Prediction, and Estimation
- Probabilistic Forecasts, Calibration and Sharpness
- Statistical Methods for Eliciting Probability Distributions
- Proper Scoring Rules for Evaluating Density Forecasts with Asymmetric Loss Functions
- The Elements of Statistical Learning
This page was built for publication: Building Trees for Probabilistic Prediction via Scoring Rules
