Synonyms
Non-linear dimension reduction methods
Definition
Dimension reduction refers to the problem of constructing a meaningful low-dimensional representation of high-dimensional data. A dimension reduction technique is generally associated with a map from a high-dimensional input space to a low-dimensional output space. If the associated map is non-linear, the dimension reduction technique is known as a non-linear dimension reduction technique.
Introduction
Dimension reduction is the construction of a meaningful low-dimensional representation of high-dimensional data. Since there are large volumes of high-dimensional data (such as climate patterns, stellar spectra, or gene distributions) in numerous real-world applications, dimension reduction is a fundamental problem in many scientific fields. From the perspective of pattern recognition, dimension reduction is an effective means of avoiding the “curse of dimensionality” and improving the computational efficiency of pattern matching.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Schölkopf, B., Smola, A., Muller, K.R.: Nonlinear component analysis as a kernel eigenvalue problem. Neural Comput. 10(5), 1299–1319 (1998)
Mika, S., Rätsch, G., Weston, J., Schölkopf, B., Müller, K.R.: Fisher discriminant analysis with kernels. IEEE International Workshop on Neural Networks for Signal Processing IX, Madison (USA), August 1999, pp. 41–48
Baudat, G., Anouar, F.: Generalized discriminant analysis using a kernel approach. Neural Comput. 12(10), 2385–2404 (2000)
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 Comput. 15(6), 1373–1396 (2003)
Yan, S., Xu, D., Zhang, B., Zhang, H.J., Yang, Q., Lin, S.: Graph embedding and extensions: A general framework for dimensionality reduction. IEEE Trans. Pattern Anal. Mach. Intell. 29(1), 40–51 (2007)
Schölkopf, B.: SVM and Kernel Method. http://www.kernel-machines.org/
Yang, J., Jin, Z., Yang, J.Y., Zhang, D., Frangi, A.F.: Essence of Kernel Fisher Discriminant: KPCA plus LDA, Pattern Recogn. 37(10), 2097–2100 (2004)
Yang, J., Frangi, A.F., Yang, J.Y., Zhang, D., Zhong, J.: KPCA plus LDA: A complete kernel fisher discriminant framework for feature extraction and recognition. IEEE Trans. Pattern. Anal. Mach. Intell. 27(2), 230–244 (2005)
Grimes, C., Donoho, D.: Can these things really work? Theoretical Results for ISOMAP and LLE, a presentation at the Workshop of Spectral Methods in Dimensionality Reduction, Clustering, and Classification in NIPS 2002. http://www.cse.msu.edu/∼lawhiu/manifold/
McMillan, L.: Dimensionality reduction Part 2: Nonlinear methods. http://www.cs.unc.edu/Courses/comp290-90-f03/
Yang, J., Zhang, D., Yang, J.Y., Niu, B.: Globally maximizing, locally minimizing: Unsupervised discriminant projection with applications to face and palm biometrics. IEEE Trans Pattern Anal. Mach. Intell. 29(4), 650–664 (2007)
Ham, J., Lee, D., Mika, S., Schölkopf, B.: A kernel view of the dimensionality reduction of manifolds. In: Proceedings of the Twenty-First International Conference on Machine Learning, Alberta, Canada, pp. 369–376 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this entry
Cite this entry
Yang, J., Jin, Z., Yang, J. (2009). Non-linear Techniques for Dimension Reduction. In: Li, S.Z., Jain, A. (eds) Encyclopedia of Biometrics. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-73003-5_294
Download citation
DOI: https://doi.org/10.1007/978-0-387-73003-5_294
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-73002-8
Online ISBN: 978-0-387-73003-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering