New methods for testing linear separability

Neurocomputing

Volumn 47, Issue 1-4, 2002, Pages 161-188

  Tajine, M ^a   Elizondo, D ^b  

^a UNIVERSITÉ DE STRASBOURG   (France)

^b Faculté de Médecine   (France)

Author keywords

Class of separability; Convex hull; Linear separability; Perception

Indexed keywords

APPROXIMATION THEORY; LEARNING ALGORITHMS; MATHEMATICAL TRANSFORMATIONS; NONLINEAR CONTROL SYSTEMS; PROBLEM SOLVING;

LINEAR SEPARABILITY;

FEEDFORWARD NEURAL NETWORKS;

ALGORITHM; ARTIFICIAL NEURAL NETWORK; CLASSIFICATION; COMPUTER MODEL; GEOMETRY; LINEAR SYSTEM; METHODOLOGY; NONLINEAR SYSTEM; PRIORITY JOURNAL; REVIEW;

EID: 0036707195     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-2312(01)00587-2     Document Type: Review

References (20)

1. A.V. Aho, J.E. Hopcroft, J. Ullman, Design and Analysis of Computer Algorithm, Addison-Wesley, Reading MA, 1974.
2. M.S. Bazaraa, J.J. Jarvis, Linear Programming and Network Flow, Wiley, London, 1977.
3. N.K. Bose, A.K. Garga, Neural network design using Voronoi disgrams, IEEE Trans. Neural Networks 4 (5) (1993) 778-787.
4. R. De Santis, A generalization of Helly's theorem, Proc. Math. Soc. 8 (1957) 336-340.
5. S. Fahlman, C. Lebiere, The cascade correlation architecture, in: D. Touretzky (Ed.), Advances in Neural Information Processing Systems, Vol. 2, Morgan Kaufmann, San Mateo, CA, 1990, pp. 524-532.
6. F. Fogelman, E. Viennet, B. Lamy, Multi-modular neural netwoprk architectures: applications in optical character and human face recognition, Internat. J. Pattern Recognition Artif. Intell. 7(4) 2 (1993) 721-755.
7. S.I. Gallant, Perceptron-based learning algorithms, IEEE Trans. Neural Networks 1 (2) (1990) 179-191.
8. M.R. Garey, D.S. Johnson, Computer and Intractability a Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
9. E. Helly, Über Mengen konvexer Körper mit gemeinschaftlichen Punkten, Jber. Deutsch. Math. Verein. 32 (1923) 175-176.
10. D.S. Johnson, F.P. Preparata, The densest hemisphere problem, Theoret. Comput. Sci. 6 (1978) 93-107.
11. J.H. Kim, S.K. Park, The geometrical learning of binary neural networks, IEEE Trans. Neural Networks 6 (1) (1995) 237-247.
12. H.W. Kuhn, Solvability and consistency for linear equations and inequalities, Amer. Math. Monthly 63 (1956) 217-232.
13. R.P. Lippman, An introduction to computing with neural network, IEEE ASSP Mag. 4 (2) (1987) 4-22.
14. W. McCulloch, W. Pitts, A logical calculus of the ideas imminent in nervous activity, Bull. Math. Biophys. 5 (1943) 217-232.
15. M. Minsky, S. Papert, Perceptrons, MIT Press, Cambridge, MA, 1969.
16. F.P. Preparata, M. Shamos, Computational Geometry, An Introduction, Springer, New York, 1985.
17. J.R. Quinlan, Induction of decision trees, Machine Learning 1 (1986) 91-106.
18. V.P. Rochowdhunry, K.Y. Siu, T. Kailath, Classification of lineraly nonseparable patterns by linear threshold elements, Trans. Neural Networks 6 (2) (1995) 318-331.
19. F. Rosenblatt, Principles of Neurodynamics, Spartatan, Washington DC, 1962.
20. J. Stoer, C. Witzgall, Convexity and Optimization in Finite Dimensions I, Springer, Berlin, 1970.