• Home
  • Search
  • Laplacian embedded regression for scalable manifold regularization.
  • Cite Icon57
  • https://doi.org/10.1109/tnnls.2012.2190420Copy DOI Icon

Laplacian embedded regression for scalable manifold regularization.

  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

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 ∈-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 possess 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 large scale SSL problems. Extensive experiments on both toy and real world data sets show the effectiveness and scalability of the proposed framework.

Similar Papers
  • Research Article
  • Citations8

Semi-supervised matrixized least squares support vector machine

  • Jul 25, 2017
  • Applied Soft Computing
  • Huimin Pei +2
  • Research Article
  • Citations243

Semi-Supervised Broad Learning System Based on Manifold Regularization and Broad Network

  • Mar 01, 2020
  • IEEE Transactions on Circuits and Systems I: Regular Papers
  • Huimin Zhao +3
  • Research Article
  • Citations15

Laplacian minimax probability machine

  • Jan 12, 2013
  • Pattern Recognition Letters
  • K Yoshiyama +1
  • Conference Article
  • Citations7

Nonlinear Metric Learning for Semi-Supervised Learning via Coherent Point Drifting

  • Dec 01, 2016
  • Pin Zhang +3
  • Research Article
  • Citations50

SSC-EKE: Semi-supervised classification with extensive knowledge exploitation

  • Sep 21, 2017
  • Information sciences
  • Pengjiang Qian +6
  • Research Article
  • Citations3

User behaviour modelling by abstracting low-level window transition logs

  • Jan 01, 2015
  • International Journal of Computational Science and Engineering
  • Ryohei Saito +2
  • Research Article
  • Citations54

Semi-supervised learning and condition fusion for fault diagnosis

  • Apr 08, 2013
  • Mechanical Systems and Signal Processing
  • Jin Yuan +1
  • Research Article
  • Citations11

Semi-supervised manifold learning with affinity regularization for Alzheimer's disease identification using positron emission tomography imaging.

  • Aug 01, 2015
  • Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual International Conference
  • Shen Lu +3
  • Research Article
  • Citations37

Classification by semi-supervised discriminative regularization

  • Mar 12, 2010
  • Neurocomputing
  • Fei Wu +4
  • PDF
  • Research Article
  • Citations2

Prototype Regularized Manifold Regularization Technique for Semi-Supervised Online Extreme Learning Machine.

  • Apr 19, 2022
  • Sensors
  • Muhammad Zafran Muhammad Zaly Shah +4
  • Book Chapter
  • Citations12

Leave-One-Out Cross-Validation Based Model Selection for Manifold Regularization

  • Jan 01, 2010
  • Jin Yuan +3
  • Research Article
  • Citations4

Robust Structure-Aware Graph-based Semi-Supervised Learning: Batch and Recursive Processing

  • Jun 18, 2024
  • ACM Transactions on Intelligent Systems and Technology
  • Xu Chen
  • Research Article
  • Citations16

Time series modelling, NARX neural network and hybrid KPCA–SVR approach to forecast the foreign exchange market in Mauritius

  • Nov 20, 2020
  • African Journal of Economic and Management Studies
  • Lydie Myriam Marcelle Amelot +2
  • Research Article
  • Citations17

An ELM-Based Semi-Supervised Indoor Localization Technique With Clustering Analysis and Feature Extraction

  • Oct 05, 2020
  • IEEE Sensors Journal
  • Jun Yan +4
  • Research Article
  • Citations91

Semi-supervised classification for hyperspectral imagery based on spatial-spectral Label Propagation

  • Sep 19, 2014
  • ISPRS Journal of Photogrammetry and Remote Sensing
  • Liguo Wang +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.