The Linear Separability Problem: Some Testing Methods
Author:
- 6 March 2006
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 17 (2) , 330-344
Abstract
The notion of linear separability is used widely in machine learning research. Learning algorithms that use this concept to learn include neural networks (single layer perceptron and recursive deterministic perceptron), and kernel machines (support vector machines). This paper presents an overview of several of the methods for testing linear separability between two classes. The methods are divided into four groups: Those based on linear programming, those based on computational geometry, one based on neural networks, and one based on quadratic programming. The Fisher linear discriminant method is also presented. A section on the quantification of the complexity of classification problems is included.Keywords
This publication has 16 references indexed in Scilit:
- Searching for linearly separable subsets using the class of linear separability method2005
- Sequencing-by-hybridization revisited: the analog-spectrum proposalIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
- New methods for testing linear separabilityNeurocomputing, 2002
- Complexity measures of supervised classification problemsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
- Expanding the search for a linear separability constraint on category learningMemory & Cognition, 2001
- How good are convex hull algorithms?1995
- The densest hemisphere problemTheoretical Computer Science, 1978
- Convexity and Optimization in Finite Dimensions I1970
- A logical calculus of the ideas immanent in nervous activityBulletin of Mathematical Biology, 1943
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMSAnnals of Eugenics, 1936