In this paper, we proposed a new nonlinear dimensionality reduction algorithm called regularized Kernel Local Linear Embedding (rKLLE) for highly structured data. It is built on the original LLE by introducing kernel alignment type of constraint to effectively reduce the solution space and find out the embeddings reflecting the prior knowledge. To enable the non-vectorial data applicability of the algorithm, a kernelized LLE is used to get the reconstruction weights. Our experiments on typical non-vectorial data show that rKLLE greatly improves the results of KLLE. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Guo, Y., Gao, J., & Kwan, P. W. (2009). Regularized Kernel Local Linear Embedding on dimensionality reduction for non-vectorial data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5866 LNAI, pp. 240–249). https://doi.org/10.1007/978-3-642-10439-8_25
Mendeley helps you to discover research relevant for your work.