Comprehensive survey reveals insights on regression trees, CART algorithm, and their implications in machine learning.
Regression trees have emerged as one of the most interpretable and powerful tools in the machine learning arsenal, offering a unique balance between predictive accuracy and model transparency. This comprehensive survey examines the theoretical foundations, algorithmic implementations, and practical applications of regression trees across diverse domains. We provide an in-depth analysis of the CART (Classification and Regression Trees) algorithm, explore various splitting criteria including mean squared error and mean absolute deviation, and discuss pruning techniques for optimal model complexity. Through extensive examples from finance, healthcare, and environmental science, we demonstrate the versatility of regression trees in handling both linear and non-linear relationships. Furthermore, we analyze the strengths and limitations of single regression trees, their integration into ensemble methods, and their role in modern machine learning pipelines. This paper serves as a comprehensive resource for researchers and practitioners seeking to understand the fundamental principles and applications of regression trees in contemporary data science.
No takes yet. Share an insight, caveat, or question.
Rayarao et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: