Self-Taught Semisupervised Dictionary Learning With Nonnegative Constraint

doi:10.1109/TII.2019.2926778

Self-Taught Semisupervised Dictionary Learning With Nonnegative Constraint

2020-01-01

26

OA

AI

DOI：10.1109/TII.2019.2926778

Original

Save

View PDF

Abstract

En 中文

This paper investigates classification by dictionary learning. A novel unified framework termed self-taught semisupervised dictionary learning with nonnegative constraint is proposed for simultaneously optimizing the components of a dictionary and a graph Laplacian. Specifically, an atom graph Laplacian regularization is built by using sparse coefficients to effectively capture the underlying manifold structure. It is more robust to noisy samples and outliers because atoms are more concise and representative than training samples. A nonnegative constraint imposed on the sparse coefficients guarantees that each sample is in the middle of its related atoms. In this way, the dependency between samples and atoms is made explicit. Furthermore, a self-taught mechanism is introduced to effectively feed back the manifold structure induced by atom graph Laplacian regularization and the supervised information hidden in unlabeled samples in order to learn a better dictionary. An efficient algorithm, combining a block coordinate descent method with the alternating direction method of multipliers, is derived to optimize the unified framework. Experimental results on several benchmark datasets show the effectiveness of the proposed model.

Keywords:

Training

Machine learning

Manifolds

Dictionaries

Laplace equations

Sparse matrices

Task analysis

Atom graph regularization

nonnegative constraint

self-taught

semisupervised dictionary learning (SSDL)

Self-Taught Semisupervised Dictionary Learning With Nonnegative Constraint

Abstract

AI Summary

Journal

Organization