A representation theorem for linear pattern classifier training

DOI10.1109/TSMC.1985.6313405MaRDI QIDQ3690250zbMATH OpenOpenAlexFDO

Authors Stevo Bozinovski

Publication date 1985

Published in IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsmc.1985.6313405

zbMATH Keywords

pattern classification trainingteaching space

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Pattern classification by linear goal programming and its extensions
• Linear potential proximal support vector machines for pattern classification
• A discriminant model for the pattern recognition of linearly independent samples
• scientific article; zbMATH DE number 4203760
• Robust linear classification from limited training data
• The maximum cosine framework for deriving perceptron based linear classifiers
• Linear discrimination with equicorrelated training vectors
• Training \(\nu\)-support vector classifiers: Theory and algorithms

Cited in

(1)

• When a Constant Classifier is as Good as Any Linear Classifier

This page was built for publication: A representation theorem for linear pattern classifier training

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