Some approaches to the solution of optimization problems in supervised learning
From MaRDI portal
(Redirected from Publication:267571)
Recommendations
- Optimization approaches to supervised classification
- Optimization problems for machine learning: a survey
- Optimization approaches to semi-supervised learning
- Supervised classification and mathematical optimization
- Approximation methods for supervised learning
- Machine learning problems from optimization perspective
- Regularization techniques and suboptimal solutions to optimization problems in learning from data
- A preference optimization based unifying framework for supervised learning problems
- Optimization techniques for semi-supervised support vector machines
Cites work
- scientific article; zbMATH DE number 2186837 (Why is no real title available?)
- scientific article; zbMATH DE number 1120263 (Why is no real title available?)
- An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problem
- Finding the minimum weight IIS cover of an infeasible system of linear inequalities
- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem
- Some results concerning post-infeasibility analysis
- Systems of linear inequalities and linear optimization
Cited in
(8)- scientific article; zbMATH DE number 6781359 (Why is no real title available?)
- Approximation methods for supervised learning
- Supervised training using global search methods.
- The maximum feasible subset problem (maxFS) and applications
- Supervised Machine Learning
- Optimization problems for machine learning: a survey
- Graphs for pattern recognition. Infeasible systems of linear inequalities
- The application of an oblique-projected Landweber method to a model of supervised learning
This page was built for publication: Some approaches to the solution of optimization problems in supervised learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q267571)
