Improving classification precision by implicit kernels motivated by manifold learning

Recently several algorithms, e.g., Isomap, self-organizing isometric embedding (SIE), Locally linear embedding (LLE) and Laplacian eigenmap, were proposed to deal with the problem of learning low dimensional nonlinear manifold embedded in a high dimensional space. Motivated by these algorithms, there is a trend of exploiting the intrinsic manifold structure of the data to improve precision and/or efficiency of classification under the assumption that the high dimensional observable data resides on a low dimensional manifold of latten variables. But these methods suffer their flaws respectively. In this work, we unified the problems of supervised manifold learning in a kernel view and proposed a novel implicit kernel construction method, i. e. supervised locally principal direction preservation kernel (SLPDK) construction, to combine the advantages of current implicit kernel construction methods motivated by manifold learning and try to overcome their disadvantages. SLPDK uses class information and locally principal direction of manifold to implement an approximately symmetric embedding. Implicit kernels constructed by SLPDK have a natural geometrical explanation and can gain a considerable classification precision improvement when the condition of locally linear manifold separability (LLMS) holds.

[1]  Mikhail Belkin,et al.  Using manifold structure for partially labelled classification , 2002, NIPS 2002.

[2]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[3]  A. Vinciarelli,et al.  Estimating the Intrinsic Dimension of Data with a Fractal-Based Method , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Balázs Kégl,et al.  Intrinsic Dimension Estimation Using Packing Numbers , 2002, NIPS.

[5]  Václav Hlaváč,et al.  Statistical Pattern Recognition Toolbox for Matlab User's guide , 2004 .

[6]  Tristrom Cooke,et al.  Two Variations on Fisher's Linear Discriminant for Pattern Recognition , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Mikhail Belkin,et al.  Using Manifold Stucture for Partially Labeled Classification , 2002, NIPS.

[8]  L. Glass,et al.  Understanding Nonlinear Dynamics , 1995 .

[9]  Bernhard Schölkopf,et al.  A kernel view of the dimensionality reduction of manifolds , 2004, ICML.

[10]  Mikhail Belkin,et al.  Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering , 2001, NIPS.

[11]  Matti Pietikäinen,et al.  Classification of handwritten digits using supervised locally linear embedding algorithm and support vector machine , 2003, ESANN.

[12]  Matti Pietikäinen,et al.  Supervised Locally Linear Embedding , 2003, ICANN.

[13]  Matthew Brand,et al.  Charting a Manifold , 2002, NIPS.

[14]  Yuexian Hou,et al.  Robust Nonlinear Dimension Reduction: A Self-organizing Approach , 2005, FSKD.

[15]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.