Empirical risk minimization and problems of constructing linear classifiers
From MaRDI portal
Publication:464946
DOI10.1007/S10559-011-9344-0zbMATH Open1306.90102OpenAlexW2052096767MaRDI QIDQ464946FDOQ464946
Authors: Alexander 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
Recommendations
- Empirical risk minimization with piecewise-linear classifiers
- Efficiency of classification methods based on empirical risk minimization
- Integrality constraints in minimizing the empirical loss function of linear decision rules
- Structural, Syntactic, and Statistical Pattern Recognition
- scientific article; zbMATH DE number 5158916
empirical risklinear classification algorithmlinear separability of setsoptimization methodsupport vector method
Cites Work
Cited In (11)
- Empirical risk minimization with piecewise-linear classifiers
- Linear classifier and projection onto a polytope
- Efficiency of classification methods based on empirical risk minimization
- Minimizing the error of linear separators on linearly inseparable data
- On a minimum linear classification problem
- Title not available (Why is that?)
- Robust linear classification from limited training data
- Stochastic generalized gradient methods for training nonconvex nonsmooth neural networks
- Integrality constraints in minimizing the empirical loss function of linear decision rules
- Title not available (Why is that?)
- The Investigation of Risk for Statistical Classifiers Using Minimum Estimators
This page was built for publication: Empirical risk minimization and problems of constructing linear classifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464946)