DocumentCode
2006283
Title
Boundary Constrained Manifold Unfolding
Author
Bo, Liu ; Hongbin, Zhang ; Wenan, Chen
Author_Institution
Coll. of Comput. Sci., Beijing Univ. of Technol., Beijing
fYear
2008
fDate
11-13 Dec. 2008
Firstpage
174
Lastpage
181
Abstract
A new manifold learning algorithm is proposed in this paper. Our method is motivated by the unit covariance constraint problem of spectral embedding methods, where a unit covariance constraint is imposed to avoid degenerate solutions that map all manifold samples to one point. This constraint distorts the aspect ratio and introduces unwanted correlation between different components of embedding coordinates. Instead, our method uses boundary conditions to pull apart mapped points, and obtains the embedding by solving linear systems under boundary conditions. The mapping of boundary samples is decided by that of a coarse version of manifold, obtained by a graph simplification algorithm designed by us. Comparisons between our method and several other representative manifold learning methods are made, and the results demonstrate the effectiveness of the proposed method.
Keywords
learning (artificial intelligence); boundary conditions; boundary constrained manifold unfolding; graph simplification algorithm; manifold learning algorithm; spectral embedding methods; unit covariance constraint problem; Application software; Boundary conditions; Computer science; Educational institutions; Laplace equations; Learning systems; Machine learning; Machine learning algorithms; Manifolds; Minimization methods; manifold learning; nonlinear dimensionality reduction; spectral embedding;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Applications, 2008. ICMLA '08. Seventh International Conference on
Conference_Location
San Diego, CA
Print_ISBN
978-0-7695-3495-4
Type
conf
DOI
10.1109/ICMLA.2008.65
Filename
4724972
Link To Document