Linear classifiers in perceptron design

Proceedings - International Conference on Pattern Recognition

Volumn 4, Issue , 1996, Pages 763-767

  Raudys, Sarunas ^a  

^a VILNIUS UNIVERSITY   (Lithuania)

Author keywords

Complexity; Initialisation; Learning set size; Learning step; Margin

Indexed keywords

COVARIANCE MATRIX; DISCRIMINANT ANALYSIS;

COMPLEXITY; INITIALISATION; LEARNING SET SIZE; LEARNING STEP; MARGIN;

PATTERN RECOGNITION;

EID: 84898777449     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.1996.547666     Document Type: Conference Paper

References (19)

1. Babu, C.C., and W.C.Chen (1971). An optimal algorithm for pattern classification - Int. J. Control. V 13, N. 3, pp. 577-586.
2. Boser B., I.Guyon and V.Vapnik (1992). A training algorithm for optimal margin classifiers. - Proc. of the 5th annual workshop on computational learning theory. Vol. 5, pp. 144-152, Pittsburgh.
3. Cortes, C., and V.Vapnik (1995). Support-vector networks. - Machine Learning, Vol. 20, N. 3, pp. 273-297.
4. Do-Tu, H., and Installe, M. (1978). Learning algorithms for nonparametrical solution to the minimum error classification problem. - IEEE Trans. Computers, Vol. C-27, pp. 648-659.
5. Duin R.P.W. (1995), Small sample size generalization, - Proc. 9th Scandinavian Conference on Image Analysis, June 6- 9, 1995, Uppsala, Sweden.
6. Fisher, R.A. (1936). The use of multiple measurements in taxonomic problems. -Ann. of Eugenics, Vol. 7, No. 2, London, .
7. Friedman J.M.( 1989). Regularised discriminant analysis, J. American Statistical Association, Vol. 84, pp. 165-175.
8. Glucksman, H. (1966). On improvement of a linear separation by extending the adaptive process with a stricter criterion. - IEEE Trans. Electr. Computers, EC-15, N 6, pp. 941-944.
9. Ibaraki T. and S.Muroga (1970) Adaptive linear classifier by linear programming, - IEEE Trans. on Systems Science and Cybernetics, V. SSC-6, pp. 53-62.
10. Koford, J.S., and G.F.Groner (1966). The use of an adaptive threshold element to design a linear optimal pattern classifier. - IEEE Trans on Information Theory, V. IT-12, pp. 42-50.
11. Malinovskij, L.G.(1979). Hypotheses on subspaces in the problem of discriminant analysis of normal populations. Moscow: Nauka, pp. 195-206, (in Russian).
12. Miyake A. (1979). Mathematical aspects of optimal linear discriminant function, COMPSAC79 - Proc. IEEE Comput. Soc. 3rd Int. Comput. Software and Applic. conference, chicago, III, 1979, pp 161-166.
13. Pietrantonio H. and P.C.Jurs (1972). Iterative least squares development of discriminant functions for spectroscopic data analysis by pattern recognition, -Patfern Recognition, V. 4, N4, pp 391-400.
14. Randles, R.H., Brofitt, J.D., Ramberg, I.S., and Hogg, R.V. (1978). Generalised linear and quadratic discriminant functions using robust estimates. - J. of American Statistical Association, V. 73, N. 363, pp. 564-568.
15. Schurmann J. (1977) Polynomklassifkatoren fur Zeichenerkennung, R.Oldenbourg Verlag, Munchen Wien.
16. Vapnik, V.N., and Tchervonenkis, D.Ya. (1974). Theory of pattern recognition - statistical learning problems. Moscow: Nauka, (in Russian).
17. Wannack R.E. and R.C.Gonzales (1973) An algorithm for optimal solution of linear inequalities and its application to pattern recognition, - IEEE Trans. on Computers, Vol. C-22, pp. 1065-1075.
18. Wolf, A.C. (1966). The estimation of the optimum linear decision function with a sequential random method. - ZEEE Trans. on Information Theory, Vol. IT-12, NO. 3, pp. 312-315.
19. Yau, S.S., and Schumpert, J.M. (1968). Design of pattem classifiers with the updating property using stochastic approximation techniques. - IEEE Trans. Computers, Vol. C 17 pp. 179-188.