New methods for testing linear separability

DOI10.1016/S0925-2312(01)00587-2MaRDI QIDQ1851922zbMATH OpenFDO

Authors Mohamed Tajine

Publication date 9 January 2003

Published in Neurocomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0925-2312(01)00587-2

zbMATH Keywords

Class of separabilityConvex hullLinear separabilityPerceptron

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Growing methods for constructing Recursive Deterministic Perceptron neural networks and knowledge extraction
• On linear separability of sequences and structures
• Perceptron algorithms for the classification of non-separable populations
• A method of synthesis of linear discriminant function in the case of nonseparability
• scientific article; zbMATH DE number 2233588

Cited in

(7)

• Growing methods for constructing Recursive Deterministic Perceptron neural networks and knowledge extraction
• Analysis and test of efficient methods for building recursive deterministic perceptron neural networks
• On the projection of k-valued non-linearly separable problems into m-valued linearly separable problems
• Monotonicity of Linear Separability Under Translation
• A regression based approach to a maximum margin classifier for separation of linearly inseparable pattern classes
• On linear separability of sequences and structures
• Motion Contrast Classification Is a Linearly Nonseparable Problem

This page was built for publication: New methods for testing linear separability

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