Design of the best linear classifier for box-constrained data sets

DOI10.1007/978-3-030-87809-2_9MaRDI QIDQ2091432zbMATH OpenOpenAlexFDO

Authors Z. R. Gabidullina

Publication date 1 November 2022

Full work available at URL https://doi.org/10.1007/978-3-030-87809-2_9

Mathematics Subject Classification ID

Numerical methods for partial differential equations, boundary value problems (65Nxx)

Cites work

• scientific article; zbMATH DE number 51950 (Why is no real title available?)
• scientific article; zbMATH DE number 3802747 (Why is no real title available?)
• A linear separability criterion for sets of Euclidean space
• A theorem on strict separability of convex polyhedra and its applications in optimization
• A unified classification model based on robust optimization
• Adaptive conditional gradient method
• Finding the Point of a Polyhedron Closest to the Origin
• Finding the nearest point in A polytope
• Method of successive projections for finding a common point of sets in metric spaces
• Necessary and sufficient conditions for emptiness of the cones of generalized support vectors
• Robust data mining
• Supervised machine learning: a review of classification techniques
• The problem of projecting the origin of Euclidean space onto the convex polyhedron

Cited in

(1)

• scientific article; zbMATH DE number 7108841 (Why is no real title available?)

This page was built for publication: Design of the best linear classifier for box-constrained data sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2091432)