Soft regression trees: a model variant and a decomposition training algorithm
From MaRDI portal
Cites work
- A universal approximation theorem for mixture-of-experts models
- Approximation by superpositions of a sigmoidal function
- Constructing optimal binary decision trees is NP-complete
- Convergent decomposition techniques for training RBF neural networks
- Creating a marketing strategy in healthcare industry: a holistic data analytic approach
- Globally convergent block-coordinate techniques for unconstrained optimization
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- Large-scale machine learning with stochastic gradient descent
- Learning decision trees with flexible constraints and objectives using integer optimization
- Least squares quantization in PCM
- Multivariate adaptive regression splines
- Near-optimal nonlinear regression trees
- On multivariate randomized classification trees: \(l_0\)-based sparsity, VC dimension and decomposition methods
- On sparse optimal regression trees
- Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
- Random forests
- Sparsity in optimal randomized classification trees
- Strong optimal classification trees
Cited in
(2)
This page was built for publication: Soft regression trees: a model variant and a decomposition training algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862058)
