Abstract
A method for the linear discrimination of two classes has been proposed by us in [3]. It searches for the discriminant direction which maximizes the distance between the projected class-conditional densities. It is a nonparametric method in the sense that the densities are estimated from the data. Since the distance between the projected densities is a highly nonlinear function with respect to the projected direction we maximize the objective function by an iterative optimization algorithm. The solution of this algorithm depends strongly on the starting point of the optimizer and the observed maximum can be merely a local maximum. In [3] we proposed a procedure for recursive optimization which searches for several local maxima of the objective function ensuring that a maximum already found will not be chosen again at a later stage. In this paper we refine this method.We propose a procedure which provides a batch mode optimization instead an interactive optimization employed in [3]. By means of a simulation we compare our procedure and the conventional optimization starting optimizers at random. The results obtained confirm the efficacy of our method.
This work was supported in part by the Paul Ivanier Center for Robotics and Production Management, Ben-Gurion University of the Negev, Israel.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aladjem, M. E.: Multiclass discriminant mappings. Signal Processing. 35 (1994) 1–18
Aladjem, M. E.: Linear discriminant analysis for two-classes via removal of classification structure. IEEE Trans. Pattern Anal. Mach. Intell. 19 (1997) 187–192
Aladjem, M. E.: Nonparametric discriminant analysis via recursive optimization of Patrick-Fisher distance. IEEE Trans. on Syst., Man, Cybern. 28B (1998) 292–299
Aladjem, M. E.: Linear discriminant analysis for two classes via recursive neural network reduction of the class separation. In A. Amin, D. Dori, P. Pudil and H. Freeman (eds.), Lecture Notes in Computer Science 1451: Advances in Pattern Recognition. (1998) 775–784
Devijver, P. A., Kittler, J.: Pattern Recognition: A Statistical Approach. Prentice-Hall International Inc., London. (1982)
Friedman, J. H.: Exploratory projection pursuit. Journal of the American Statistical Association. 82 (1987) 249–266
Huber, P. J.: Projected pursuit, including discussions. The Annals of Statistics. 13 (1985) 435–525
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aladjem, M. (1999). Nonparametric Linear Discriminant Analysis by Recursive Optimization with Random Initialization. In: Hand, D.J., Kok, J.N., Berthold, M.R. (eds) Advances in Intelligent Data Analysis. IDA 1999. Lecture Notes in Computer Science, vol 1642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48412-4_19
Download citation
DOI: https://doi.org/10.1007/3-540-48412-4_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66332-4
Online ISBN: 978-3-540-48412-7
eBook Packages: Springer Book Archive