Multi-view Sparse Laplacian Eigenmaps for nonlinear Spectral Feature Selection

by   Gaurav Srivastava, et al.

The complexity of high-dimensional datasets presents significant challenges for machine learning models, including overfitting, computational complexity, and difficulties in interpreting results. To address these challenges, it is essential to identify an informative subset of features that captures the essential structure of the data. In this study, the authors propose Multi-view Sparse Laplacian Eigenmaps (MSLE) for feature selection, which effectively combines multiple views of the data, enforces sparsity constraints, and employs a scalable optimization algorithm to identify a subset of features that capture the fundamental data structure. MSLE is a graph-based approach that leverages multiple views of the data to construct a more robust and informative representation of high-dimensional data. The method applies sparse eigendecomposition to reduce the dimensionality of the data, yielding a reduced feature set. The optimization problem is solved using an iterative algorithm alternating between updating the sparse coefficients and the Laplacian graph matrix. The sparse coefficients are updated using a soft-thresholding operator, while the graph Laplacian matrix is updated using the normalized graph Laplacian. To evaluate the performance of the MSLE technique, the authors conducted experiments on the UCI-HAR dataset, which comprises 561 features, and reduced the feature space by 10 to 90 reducing the feature space by 90 an error rate of 2.72 accuracy of 96.69


Auto-weighted Multi-view Feature Selection with Graph Optimization

In this paper, we focus on the unsupervised multi-view feature selection...

Graph Autoencoder-Based Unsupervised Feature Selection with Broad and Local Data Structure Preservation

Feature selection is a dimensionality reduction technique that selects a...

Incremental Unsupervised Feature Selection for Dynamic Incomplete Multi-view Data

Multi-view unsupervised feature selection has been proven to be efficien...

Joint Multi-view Unsupervised Feature Selection and Graph Learning

Despite the recent progress, the existing multi-view unsupervised featur...

Weighted Sparse Partial Least Squares for Joint Sample and Feature Selection

Sparse Partial Least Squares (sPLS) is a common dimensionality reduction...

Feature Selection in High-dimensional Space Using Graph-Based Methods

High-dimensional feature selection is a central problem in a variety of ...

Robust Matrix Elastic Net based Canonical Correlation Analysis: An Effective Algorithm for Multi-View Unsupervised Learning

This paper presents a robust matrix elastic net based canonical correlat...

Please sign up or login with your details

Forgot password? Click here to reset