Optimally trained regression trees and Occam's razor

DOI10.1007/978-3-642-57489-4_73zbMATH Open1444.62023OpenAlexW51126094MaRDI QIDQ3298732FDOQ3298732

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

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

zbMATH Keywords

optimizationdynamic programmingrecursive partitioningOccam's razorgeneralizationbottom-up algorithmsregressí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)

Cites Work

• Title not available (Why is that?)
• Occam's razor
• Title not available (Why is that?)
• Optimal classification trees

Cited In (6)

• Optimal classification trees
• Title not available (Why is that?)
• Efficient construction of regression trees with range and region splitting
• Title not available (Why is that?)
• Title not available (Why is that?)
• On sparse optimal regression trees

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)