Semi-Supervised Graph Based Embedding With Non-Convex Sparse Coding Techniques

Qi Zhang

doi:10.1109/TKDE.2019.2953668

Return

Semi-Supervised Graph Based Embedding With Non-Convex Sparse Coding Techniques

2020-01-01

PRE

Qi Zhang

楚

楚天广 (Tianguang Chu) *

Cishen Zhang

DOI：10.1109/TKDE.2019.2953668

Original

Original request for help

Save

Abstract

En 中文

We consider the problem of semi-supervised graph-based learning upon multimodal and mixmodal data. Since in semi-supervised settings, the labeled information is very limited, we first propose a non-convex sparse-coding based label propagation (alpha-SLP) method to estimate the soft labels, and thereby to enrich the supervised information. By considering the structural properties of multimodal and mixmodal data, we present a semi-supervised graph-based embedding (SGE) approach that incorporates the soft label information with the hierarchical local geometric information of within-class, between-class, and overall-class data. Based on this, subspaces characterizing the multimodal and mixmodal data structure can be derived by maximizing the weighted between-class separability and minimizing the locality-preserved within-class as well as overall-class distances of the training samples. We further extend SGE into semi-supervised sparse subspace learning scenarios and present an alpha-structural-regularization-induced SGE (alpha-SSGE) model, which can give better results in extracting discriminative groups of features by utilizing the non-convex structural regularization techniques. Experiments for multimodal and mixmodal digit as well as face recognition verify the validity and effectiveness of the proposed models.

Keywords:

Semi-supervised learning

multimodal and mixmodal data

sparse coding

face recognition

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.