scientific article; zbMATH DE number 7625179
From MaRDI portal
Publication:5054624
No author found.
Publication date: 29 November 2022
Full work available at URL: https://arxiv.org/abs/2007.12652
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
On Tackling Explanation Redundancy in Decision Trees ⋮ Time and space complexity of deterministic and nondeterministic decision trees ⋮ On multivariate randomized classification trees: \(l_0\)-based sparsity, VC dimension and decomposition methods ⋮ On optimal regression trees to detect critical intervals for multivariate functional data
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning Certifiably Optimal Rule Lists for Categorical Data
- Learning optimal decision trees using constraint programming
- Mathematical optimization in classification and regression trees
- On the handling of continuous-valued attributes in decision tree generation
- Constructing optimal binary decision trees is NP-complete
- A SAT-based approach to learn explainable decision sets
- Cluster-grouping: from subgroup discovery to clustering
- Learning decision trees with flexible constraints and objectives using integer optimization
- Constraint programming for high school timetabling: a scheduling-based model with hot starts
- End-to-end learning of decision trees and forests
- Sparsity in optimal randomized classification trees
- SAT-based encodings for optimal decision trees with explicit paths
- Classification and Regression via Integer Optimization
- dtControl
- Optimal Binary Identification Procedures
- Optimal classification trees
This page was built for publication:
