Incremental Manifold Learning Via Tangent Space Alignment
Several algorithms have been proposed to analysis the structure of high-dimensional data based on the notion of manifold learning. They have been used to extract the intrinsic characteristic of different type of high-dimensional data by performing nonlinear dimensionality reduction. Most of them operate in a “batch” mode and cannot be efficiently applied when data are collected sequentially. In this paper, we proposed an incremental version (ILTSA) of LTSA (Local Tangent Space Alignment), which is one of the key manifold learning algorithms. Besides, a landmark version of LTSA (LLTSA) is proposed, where landmarks are selected based on LASSO regression, which is well known to favor sparse approximations because it uses regularization with l1 norm. Furthermore, an incremental version (ILLTSA) of LLTSA is also proposed. Experimental results on synthetic data and real word data sets demonstrate the effectivity of our algorithms.
Keywordsmanifold learning LTSA incremental learning LASSO
- 8.ZhenYue Zhang, H.Z.: A Domain Decomposition Method for Fast Manifold Learning. In: Advances in Neural Information Processing Systems, MIT Press, Cambridge (2006)Google Scholar
- 10.Efron, B., Hastie, T., Johnstone, I., Tibshirani, R.: Least angle regression. Annals of Statistics (2003)Google Scholar
- 11.de Silva, V.J.B.T.: Global versus Local Approaches to Nonlinear Dimensionality Reduction. In: Advances in Neural Information Processing Systems, vol. 15 (2003)Google Scholar
- 12.Jorge Gomes da Silva, J.S.M.: Jo?o Manuel Lage de Miranda Lemos. Selecting Landmark Points for Sparse Manifold Learning. In: Advances in Neural Information Processing Systems, MIT Press, Vancouver, Canada (2006)Google Scholar
- 13.Golub, G.H., V.L., C.F.: Matrix Computations. Johns Hopkins University Press (1996)Google Scholar