Empirical risk minimization and problems of constructing linear classifiers

DOI10.1007/S10559-011-9344-0zbMATH Open1306.90102OpenAlexW2052096767MaRDI QIDQ464946

A. P. Vinogradov, Yu. P. Laptin, Yu. I. Zhuravlev

Publication date: 30 October 2014

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-011-9344-0

zbMATH Keywords

optimization methodempirical risklinear classification algorithmlinear separability of setssupport vector method

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites Work

• Optimal pattern recognition procedures and their application
• An approach to the solution of nonlinear unconstrained optimization problems
• Nondifferentiable optimization and polynomial problems
• Structure of homothetic linearly separable sets in \(n\)-dimensional Euclidean space. I

Related Items (2)

Linear classifier and projection onto a polytope ⋮ Stochastic generalized gradient methods for training nonconvex nonsmooth neural networks

This page was built for publication: Empirical risk minimization and problems of constructing linear classifiers