Feature selection and multi-kernel learning for sparse representation on a manifold

Authors:
Jim Jing-Yan Wang;Halima Bensmail;Xin Gao
Affiliations:
-;-;-
Venue:
Neural Networks
Year:
2014

Citing 17
Cited 0

An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints

SIAM Journal on Optimization
Function approximation on non-Euclidean spaces

Neural Networks
2005 Special Issue: Bayesian approach to feature selection and parameter tuning for support vector machine classifiers

Neural Networks - 2005 Special issue: IJCNN 2005
A composite neural network model for perseveration and distractibility in the Wisconsin card sorting test

Neural Networks
A survey of kernel and spectral methods for clustering

Pattern Recognition
Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis

Bioinformatics
Robust Face Recognition via Sparse Representation

IEEE Transactions on Pattern Analysis and Machine Intelligence
A novel neural dynamical approach to convex quadratic program and its efficient applications

Neural Networks
Design of a multiple kernel learning algorithm for LS-SVM by convex programming

Neural Networks
Feature Selection and Kernel Learning for Local Learning-Based Clustering

IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Regularized Nonnegative Matrix Factorization for Data Representation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Distributed static linear Gaussian models using consensus

Neural Networks
Laplacian twin support vector machine for semi-supervised classification

Neural Networks
Hierarchical kernel spectral clustering

Neural Networks
Weighted Twin Support Vector Machines with Local Information and its application

Neural Networks
Laplacian Sparse Coding, Hypergraph Laplacian Sparse Coding, and Applications

IEEE Transactions on Pattern Analysis and Machine Intelligence
Discriminative sparse coding on multi-manifolds

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sparse representation has been widely studied as a part-based data representation method and applied in many scientific and engineering fields, such as bioinformatics and medical imaging. It seeks to represent a data sample as a sparse linear combination of some basic items in a dictionary. Gao et al. (2013) recently proposed Laplacian sparse coding by regularizing the sparse codes with an affinity graph. However, due to the noisy features and nonlinear distribution of the data samples, the affinity graph constructed directly from the original feature space is not necessarily a reliable reflection of the intrinsic manifold of the data samples. To overcome this problem, we integrate feature selection and multiple kernel learning into the sparse coding on the manifold. To this end, unified objectives are defined for feature selection, multiple kernel learning, sparse coding, and graph regularization. By optimizing the objective functions iteratively, we develop novel data representation algorithms with feature selection and multiple kernel learning respectively. Experimental results on two challenging tasks, N-linked glycosylation prediction and mammogram retrieval, demonstrate that the proposed algorithms outperform the traditional sparse coding methods.