Optimally trained regression trees and Occam's razor

DOI10.1007/978-3-642-57489-4_73MaRDI QIDQ3298732zbMATH OpenOpenAlexFDO

Authors Petr Savický, Jan Klaschka

Publication date 15 July 2020

Published in Compstat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-57489-4_73

zbMATH Keywords

bottom-up algorithmsdynamic programminggeneralizationOccam's razoroptimizationrecursive partitioningregressíon trees

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Statistical aspects of big data and data science (62R07) Applications of mathematical programming (90C90)

Recommendations

• Optimal classification trees
• A novel algorithm to optimize classification trees
• Efficient construction of regression trees with range and region splitting
• On sparse optimal regression trees
• scientific article; zbMATH DE number 1149435

Cites work

• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 1149435 (Why is no real title available?)
• Occam's razor
• Optimal classification trees

Cited in

(7)

• Near-optimal nonlinear regression trees
• On sparse optimal regression trees
• scientific article; zbMATH DE number 1149435 (Why is no real title available?)
• scientific article; zbMATH DE number 1881953 (Why is no real title available?)
• scientific article; zbMATH DE number 2209345 (Why is no real title available?)
• Optimal classification trees
• Efficient construction of regression trees with range and region splitting

Describes a project that uses

Uses Software

• C4.5

This page was built for publication: Optimally trained regression trees and Occam's razor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3298732)