Manifold-Based Learning and Synthesis

June 2009

Manifold-Based Learning and Synthesis

Authors:

Dong Huang, Zhang Yi, and Xiaorong Pu

Abstract:

This paper proposes a new approach to analyze high-dimensional data set using low-dimensional manifold. This manifold-based approach provides a unified formulation for both learning from and synthesis back to the input space. The manifold learning method desires to solve two problems in many existing algorithms. The first problem is the local manifold distortion caused by the cost averaging of the global cost optimization during the manifold learning. The second problem results from the unit variance constraint generally used in those spectral embedding methods where global metric information is lost. For the out-of-sample data points, the proposed approach gives simple solutions to transverse between the input space and the feature space. In addition, this method can be used to estimate the underlying dimension and is robust to the number of neighbors. Experiments on both low-dimensional data and real image data are performed to illustrate the theory.
@article{Huang-2009-127321,
author = {Dong Huang And Zhang Yi And Xiaorong Pu},
title = {Manifold-Based Learning and Synthesis},
journal = {Proceedings of IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)},
year = {2009},
month = {June},
volume = {39},
number = {3},
pages = {592 - 606},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.