A reformative kernel Fisher discriminant method is proposed, which is directly derived from the naive kernel Fisher discriminant analysis with superiority in classiΓΏcation e ciency. In the novel method only a part of training patterns, called "signiΓΏcant nodes", are necessary to be adopted in classi
Sparse multinomial kernel discriminant analysis (sMKDA)
β Scribed by Robert F. Harrison; Kitsuchart Pasupa
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 297 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Small sample size and high computational complexity are two major problems encountered when traditional kernel discriminant analysis methods are applied to high-dimensional pattern classification tasks such as face recognition. In this paper, we introduce a new kernel discriminant learning method, w
Linear discriminant analysis (LDA) is a simple but widely used algorithm in the area of pattern recognition. However, it has some shortcomings in that it is sensitive to outliers and limited to linearly separable cases. To solve these problems, in this paper, a non-linear robust variant of LDA, call