Empirical risk minimization with piecewise-linear classifiers
From MaRDI portal
zbMATH Open0611.90100MaRDI QIDQ1087477FDOQ1087477
Authors: E. V. Rozhkov
Publication date: 1986
Published in: Automation and Remote Control (Search for Journal in Brave)
Recommendations
- Empirical risk minimization and problems of constructing linear classifiers
- Piecewise linear classifiers preserving high local recognition rates.
- Piecewise-linear classifiers and ``generalized moving control: an effective design procedure
- Automated design of multiple-class piecewise linear classifiers
- A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
Pattern recognition, speech recognition (68T10) Applications of mathematical programming (90C90) Mixed integer programming (90C11)
Cited In (13)
- Classification through incremental max-min separability
- Hinge-minimax learner for the ensemble of hyperplanes
- Piecewise-linear classifiers and ``generalized moving control: an effective design procedure
- Empirical risk minimization and problems of constructing linear classifiers
- An incremental piecewise linear classifier based on polyhedral conic separation
- Automated design of multiple-class piecewise linear classifiers
- Learning perceptrons and piecewise linear classifiers sensitive to example dependent costs
- Piecewise linear classifiers preserving high local recognition rates.
- A simple and fast multi-class piecewise linear pattern classifier
- Optimizing \(\psi\)-learning via mixed integer programming
- A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Empirical risk minimization with piecewise-linear classifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087477)