A kernel based neighborhood discriminant submanifold learning for pattern classification

We propose a novel method,called kernel neighborhood discriminant analysis (knda),which can be regarded as a supervised kernel extension of locality preserving projection (lpp). knda nonlinearly maps the original data into a kernel space in which two graphs are constructed to depict the within-class submanifold and the between-class submanifold. then a criterion function which minimizes the quotient between the within-class representation and the between-class representation of the submanifolds is designed to separate each submanifold constructed by each class. the real contribution of this paper is that we bring and extend the submanifold based algorithm to a general model and by some derivation a simple result is given by which we can classify a given object to a predefined class effectively. experiments on the mnist handwritten digits database,the binary alphadigits database,the orl face database,the extended yale face database b,and a downloaded documents dataset demonstrate the effectiveness and robustness of the proposed method. © 2014 xu zhao.