Abstract
Manifold learning is to construct nonlinear low-dimensional manifolds from sample data points embedded in high-dimensional spaces. In streaming data applications, new data points come continually, which will change the existing data points’ neighborhoods and their local distributions. Such applications call for incremental algorithms not only to deal with the adding of new data points but also to update the local neighborhoods of the existing data points. In this paper, we introduce a new manifold learning algorithm by updating the structure of eigen-problem iteratively. Incremental spectral decomposition is used in the iterative process and the resulting eigenvectors correspond to the low dimensional embedded coordinates. Experimental results show that 1) as the number of data points increases, the mapping results of the proposed approach become closer and closer to that of batch-style approaches, including LTSA and LE, and 2) the proposed approach outperforms the incremental ISOMAP (IISOMAP, a typical incremental manifold learning algorithm) in mapping accuracy. We argue that the new algorithm is suitable for incremental learning of large-scale data streams.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319–2323 (2000)
Roweis, S.T., Saul, L.K.: Nonlinear dimensionality reduction by locally linear embedding. Science 290, 2323–2326 (2000)
Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15(6), 1373–1396 (2003)
Donoho, D.L., Grimes, C.: Hessian eigenmaps: Locally Linear embedding techniques for high-dimensional data. Proceedings of the National Academy of Sciences 100, 5591–5596 (2003)
Chung, F.R.K.: Spectral Graph Theory. CBMS Regional Conference Series in Mathematics. American Mathematical Society, Providence (1997)
Zhang, Z.Y., Zha, H.Y.: Principal manifolds and nonlinear dimensionality reduction via tangent space alignment. SIAM Journal of Scientific Computing 26, 313–338 (2004)
Ning, H.Z., Xu, W., et al.: Incremental spectral clustering by efficiently updating the eigen-system. Pattern Recognition 43, 113–127 (2010)
Saul, L., Roweis, S.: Think globally, fit locally: Unsupervised learning of nonlinear manifolds. J. Mach. Learn. Res. 4, 119–155 (2003)
Golub, G.H., Van, L.C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)
Law, M.H.C., Jain, A.K.: Incremental nonlinear dimensionality reduction by manifold learning. IEEE Trans on Pattern Analysis and Machine Intelligence 28, 377–391 (2006)
Zhang, Y., Weng, J.: Convergence analysis of complementary candid incremental principal component Analysis. Technical report, Michigan State University (2001)
Yan, J., Zhang, B., et al.: IMMC: Incremental maximum margin criterion. In: Proceedings of SIGKDD 2004, pp. 725–730 (2004)
Lu, K., He, X.: Image retrieval basedon incremental subspace learning. Pattern Recognition 38, 2047–2054 (2005)
Jia, P., Yin, J., et al.: Incremental Laplacian eigenmaps by preserving adjacent information between data points. Pattern Recognition Letters 30, 1457–1463 (2009)
Weng, J.Y., Zhang, Y.L., Hwang, W.S.: Candid Covariance-free Incremental Principal Component Analysis. IEEE Trans on Pattern Analysis and Machine Intelligence 25(8), 1034–1040 (2003)
Kouropteva, O., Okun, O., et al.: Incremental locally linear embedding. Pattern Recognition 38, 1764–1767 (2005)
Abdel-Mannan, O., Ben Hamza, A., et al.: Incremental Line Tangent Space Alignment Algorithm. In: Proceedings of CCECE 2007, pp. 1329–1332 (2007)
Coifman, R., Lafon, S., et al.: Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps. PNAS 102(21), 7426–7431 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tan, C., Guan, J. (2012). A New Manifold Learning Algorithm Based on Incremental Spectral Decomposition. In: Zhou, S., Zhang, S., Karypis, G. (eds) Advanced Data Mining and Applications. ADMA 2012. Lecture Notes in Computer Science(), vol 7713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35527-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-35527-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35526-4
Online ISBN: 978-3-642-35527-1
eBook Packages: Computer ScienceComputer Science (R0)