A method of synthesis of linear discriminant function in the case of nonseparability

DOI10.1016/0031-3203(84)90059-1zbMath0538.62053OpenAlexW2022278206WikidataQ62048845 ScholiaQ62048845MaRDI QIDQ793475

Wojciech Niemiro, Leon Bobrowski

Publication date: 1984

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0031-3203(84)90059-1

zbMATH Keywords

simplex methodlinear separabilitynonseparabilitylinear discriminant functionperceptron criterion function

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to statistics (62-04) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Probabilistic methods, stochastic differential equations (65C99)

Related Items (4)

Linear discrimination with symmetrical models ⋮ Rank correlation estimators and their limiting distributions ⋮ Lasso with convex loss: Model selection consistency and estimation ⋮ A survey of fuzzy clustering

Cites Work

• A penalty linear programming method using reduced-gradient basis-exchange techniques
• Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
• An algorithm for the chromatic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A method of synthesis of linear discriminant function in the case of nonseparability