Mixed-integer linear optimization for semi-supervised optimal classification trees
From MaRDI portal
Cites work
- An optimization-based algorithm for fair and calibrated synthetic data generation
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Decision trees using model ensemble-based nodes
- Estimation of regional transition probabilities for spatial dynamic microsimulations from survey data lacking in regional detail
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- Introduction to semi-supervised learning.
- Inverse probability weighting for clustered nonresponse
- JuMP: a modeling language for mathematical optimization
- Laplacian support vector machines trained in the primal
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- Mathematical optimization in classification and regression trees
- Multivariate classification trees based on minimum features discrete support vector machines
- New optimization models for optimal classification trees
- Optimal classification trees
- Optimal classification trees with leaf-branch and binary constraints
- Optimal randomized classification trees
- Optimization approaches to semi-supervised learning
- Optimization problems for machine learning: a survey
- Robust optimal classification trees under noisy labels
- Sparsity in optimal randomized classification trees
- Strong optimal classification trees
- Support-vector networks
This page was built for publication: Mixed-integer linear optimization for semi-supervised optimal classification trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411481)