A reformative kernel Fisher discriminant analysis
A reformative kernel Fisher discriminant method is proposed, which is directly derived from the naive kernel Fisher discriminant analysis with superiority in classification efficiency. In the novel method only a part of training patterns, called significant nodes, are necessary to be adopted in classifying one test pattern. A recursive algorithm for selecting significant nodes, which is the key of the novel method, is presented in detail. The experiment on benchmarks shows that the novel method is effective and much efficient in classifying.
fisher discriminant analysis kernel trick pattern recognition