Semi-supervised dual graph regularized dictionary learning

12/11/2018 ∙ by Khanh-Hung Tran, et al. ∙ 0

In this paper, we propose a semi-supervised dictionary learning method that uses both the information in labelled and unlabelled data and jointly trains a linear classifier embedded on the sparse codes. The manifold structure of the data in the sparse code space is preserved using the same approach as the Locally Linear Embedding method (LLE). This enables one to enforce the predictive power of the unlabelled data sparse codes. We show that our approach provides significant improvements over other methods. The results can be further improved by training a simple nonlinear classifier as SVM on the sparse codes.



There are no comments yet.


page 1

page 2

page 3

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.