Open Access
June 2007 Eigenvalues of an alignment matrix in nonlinear manifold learning
Chi-Kwong Li, Ren-Cang Li, Qiang Ye
Commun. Math. Sci. 5(2): 313-329 (June 2007).


The alignment algorithm of Zhang and Zha is an effective method recently proposed for nonlinear manifold learning (or dimensionality reduction). By first computing local coordinates of a data set, it constructs an alignment matrix from which a global coordinate is obtained from its null space. In practice, the local coordinates can only be constructed approximately and so is the alignment matrix. This together with roundoff errors requires that we compute the the eigenspace associated with a few smallest eigenvalues of an approximate alignment matrix. For this purpose, it is important to know the first nonzero eigenvalue of the alignment matrix or a lower bound in order to computationally separate the null space. This paper bounds the smallest nonzero eigenvalue, which serves as an indicator of how difficult it is to correctly compute the desired null space of the approximate alignment matrix.


Download Citation

Chi-Kwong Li. Ren-Cang Li. Qiang Ye. "Eigenvalues of an alignment matrix in nonlinear manifold learning." Commun. Math. Sci. 5 (2) 313 - 329, June 2007.


Published: June 2007
First available in Project Euclid: 9 July 2007

zbMATH: 1135.65019
MathSciNet: MR2334845

Primary: 15A18‎ , 65F15

Keywords: alignment matrix , dimensionality reduction , nonlinear manifold learning , overlapped partition , Smallest nonzero eigenvalues

Rights: Copyright © 2007 International Press of Boston

Vol.5 • No. 2 • June 2007
Back to Top