Semi-supervised learning in Spectral Dimensionality Reduction
نویسنده
چکیده
Biometric face data are essentially high dimensional data and as such are susceptible to the well-known problem of the curse of dimensionality when analyzed using machine learning techniques. Various dimensionality reduction methods have been proposed in the literature to represent high dimensional data in a lower dimensional space. Research has shown that biometric face data are non-linear in structure, and when subject to analysis using linear dimensionality reduction methods, such as PCA and LDA, important information is lost. However, manifold learning methods (LLE, Laplacian Eigenmaps, Isomap) are able to preserve the original non-linear structure of high dimensional data in lower dimensional space, resulting in much less information loss. Despite the success in preserving the non-linear structure of data, manifold learning methods suffer from two problems. First the generalization problem, that is, the proposed methods operate in batch mode and are not extendable to new unseen test data. Second, the classification problem, that is, the inability of the manifold learning methods to incorporate labeled information into their learning algorithms. The aim of this dissertation, is to provide a comprehensive survey of the existing methods in the literature that contribute to the problems of manifold learning where generalization and classification are necessary. In this dissertation, we will present Graph Embedding and Semi-supervised Graph Embedding as the approved approaches to advance the applicability of manifold learning methods in the application of biometric face recognition. This dissertation will provide a comprehensive presentation of the existing literature, and provide a framework under which new Semi-Supervised Manifold Learning methods could be proposed and studied. In addition, this thesis, presents a new semi-supervised manifold learning method, which has superior performance in face recognition, against the similar approaches of semi-supervised learning.
منابع مشابه
Spectral Methods for Linear and Non-Linear Semi-Supervised Dimensionality Reduction
We present a general framework of spectral methods for semi-supervised dimensionality reduction. Applying an approach called manifold regularization, our framework naturally generalizes existent supervised frameworks. Furthermore, by our two semi-supervised versions of the representer theorem, our framework can be kernelized as well. Using our framework, we give three examples of semi-supervise...
متن کاملA unified semi-supervised dimensionality reduction framework for manifold learning
We present a general framework of semi-supervised dimensionality reduction for manifold learning which naturally generalizes existing supervised and unsupervised learning frameworks which apply the spectral decomposition. Algorithms derived under our framework are able to employ both labeled and unlabeled examples and are able to handle complex problems where data form separate clusters of mani...
متن کاملEstimation of tangent planes for neighborhood graph correction
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neighborhood graph. In the presence of shortcuts (union of two points whose distance measure along the submanifold is actually large), the resulting embbeding will be unsatisfactory. This paper proposes an algorithm to co...
متن کاملA Spatial Hypergraph Based Semi-Supervised Band Selection Method for Hyperspectral Imagery Semantic Interpretation
Hyperspectral imagery (HSI) typically provides a wealth of information captured in a wide range of the electromagnetic spectrum for each pixel in the image. Hence, a pixel in HSI is a high-dimensional vector of intensities with a large spectral range and a high spectral resolution. Therefore, the semantic interpretation is a challenging task of HSI analysis. We focused in this paper on object c...
متن کاملSpectral Regression for Dimensionality Reduction by Deng Cai , Xiaofei He , and Jiawei Han May 2007
Spectral methods have recently emerged as a powerful tool for dimensionality reduction and manifold learning. These methods use information contained in the eigenvectors of a data affinity (i.e., item-item similarity) matrix to reveal low dimensional structure in high dimensional data. The most popular manifold learning algorithms include Locally Linear Embedding, Isomap, and Laplacian Eigenmap...
متن کاملSpectral Regression for Dimensionality Reduction∗
Spectral methods have recently emerged as a powerful tool for dimensionality reduction and manifold learning. These methods use information contained in the eigenvectors of a data affinity (i.e., item-item similarity) matrix to reveal low dimensional structure in high dimensional data. The most popular manifold learning algorithms include Locally Linear Embedding, Isomap, and Laplacian Eigenmap...
متن کامل