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
Optimally regularised kernel Fisher discriminant classification
β Scribed by Kamel Saadi; Nicola L.C. Talbot; Gavin C. Cawley
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 694 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0893-6080
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In spite of the popularity of Fisher discriminant analysis in the realm of feature extraction and pattern classification, it is beyond the capability of Fisher discriminant analysis to extract nonlinear structures from the data. That is where the kernel Fisher discriminant algorithm sets in the scen
apply the "kernel trick" to obtain a non-linear variant of Fisher's linear discriminant analysis method, demonstrating state-of-the-art performance on a range of benchmark data sets. We show that leave-one-out cross-validation of kernel Fisher discriminant classiΓΏers can be implemented with a comput
In this paper, an imprecise data classification is considered using new version of Fisher discriminator, namely interval Fisher. In the conventional formulation of Fisher, elements of within-class scatter matrix (related to covariance matrix between clusters) and between-class scatter matrix (relate