A metric multidimensional scaling-based nonlinear manifold learning approach for unsupervised data reduction

2Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

Abstract

Manifold learning may be seen as a procedure aiming at capturing the degrees of freedom and structure characterizing a set of high-dimensional data, such as images or patterns. The usual goals are data understanding, visualization, classification, and the computation of means. In a linear framework, this problem is typically addressed by principal component analysis (PCA). We propose here a nonlinear extension to PCA. Firstly, the reduced variables are determined in the metric multidimensional scaling framework. Secondly, regression of the original variables with respect to the reduced variables is achieved considering a piecewise linear model. Both steps parameterize the (noisy) manifold holding the original data. Finally, we address the projection of data onto the manifold. The problem is cast in a Bayesian framework. Application of the proposed approach to standard data sets such as the COIL-20 database is presented.

Cite

CITATION STYLE

APA

Brucher, M., Heinrich, C., Heitz, F., & Armspach, J. P. (2008). A metric multidimensional scaling-based nonlinear manifold learning approach for unsupervised data reduction. Eurasip Journal on Advances in Signal Processing, 2008. https://doi.org/10.1155/2008/862015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free