Laplacian Embedded Regression for Scalable Manifold Regularization


Semi-supervised learning (SSL), as a powerful tool to learn from a limited number of labeled data and a large number of unlabeled data, has been attracting increasing attention in the machine learning community. In particular, the manifold regularization framework has laid solid theoretical foundations for a large family of SSL algorithms, such as Laplacian support vector machine (LapSVM) and Laplacian regularized least squares (LapRLS). However, most of these algorithms are limited to small scale problems due to the high computational cost of the matrix inversion operation involved in the optimization problem. In this paper, we propose a novel framework called Laplacian embedded regression by introducing an intermediate decision variable into the manifold regularization framework. By using $epsilon$-insensitive loss, we obtain the Laplacian embedded support vector regression (LapESVR) algorithm, which inherits the sparse solution from SVR. Also, we derive Laplacian embedded RLS (LapERLS) corresponding to RLS under the proposed framework. Both LapESVR and LapERLS posses a simpler form of a transformed kernel, which is the summation of the original kernel and a graph kernel that captures the manifold structure. The benefits of the transformed kernel are two-fold: 1) we can deal with the original kernel matrix and the graph Laplacian matrix in the graph kernel separately and 2) if the graph Laplacian matrix is sparse, we only need to perform the inverse operation for a sparse matrix, which is much more efficient when compared with that for a dense one. Inspired by kernel principal component analysis, we further propose to project the introduced decision variable into a subspace spanned by a few eigenvectors of the graph Laplacian matrix in order to better reflect the data manifold, as well as accelerate the calculation of the graph kernel, allowing our methods to efficiently and effectively cope with - arge scale SSL problems. Extensive experiments on both toy and real world data sets show the effectiveness and scalability of the proposed framework.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Progressive Image Denoising Through Hybrid Graph Laplacian Regularization A Unified Framework - 2014 ABSTRACT: Recovering images from corrupted observations is critical for many real-world applications. In this
PROJECT TITLE :Template-Based Monocular 3D Shape Recovery Using Laplacian MeshesABSTRACT:We tend to show that by extending the Laplacian formalism, which was 1st introduced within the Graphics community to regularize 3D meshes,
PROJECT TITLE :Sparse EEG Source Localization Using Bernoulli Laplacian PriorsABSTRACT:Supply localization in electroencephalography has received an increasing amount of interest in the last decade. Solving the underlying ill-posed
PROJECT TITLE : Multi-Core Embedded Wireless Sensor Networks Architecture and Applications - 2014 ABSTRACT: Technological advancements in the silicon industry, as predicted by Moore's law, have enabled integration of billions
PROJECT TITLE : Hop-by-Hop Message Authenticationand Source Privacy in WirelessSensor Networks - 2014 ABSTRACT: Message authentication is one of the most effective ways to thwart unauthorized and corrupted messages from being

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry