On multivariate randomized classification trees: l0-based sparsity, VC dimension and decomposition methods.
Edoardo AmaldiAntonio ConsoloAndrea MannoPublished in: Comput. Oper. Res. (2023)
Keyphrases
- decomposition methods
- vc dimension
- classification trees
- decision trees
- upper bound
- decomposition method
- training data
- sample complexity
- logistic regression
- lower bound
- inductive inference
- inductive learning
- regression trees
- constraint satisfaction problems
- regression model
- sample size
- learning machines
- high dimensional
- compression scheme
- worst case
- learning algorithm
- class distribution
- data sets
- training set
- random forests
- input space
- learning problems
- theoretical analysis
- multi class
- bayesian networks
- active learning