Matrix Completion for Graph-Based Deep Semi-Supervised Learning


  • Fariborz Taherkhani West Virginia University
  • Hadi Kazemi West Virginia University
  • Nasser M. Nasrabadi West Virginia University



Convolutional Neural Networks (CNNs) have provided promising achievements for image classification problems. However, training a CNN model relies on a large number of labeled data. Considering the vast amount of unlabeled data available on the web, it is important to make use of these data in conjunction with a small set of labeled data to train a deep learning model. In this paper, we introduce a new iterative Graph-based Semi-Supervised Learning (GSSL) method to train a CNN-based classifier using a large amount of unlabeled data and a small amount of labeled data. In this method, we first construct a similarity graph in which the nodes represent the CNN features corresponding to data points (labeled and unlabeled) while the edges tend to connect the data points with the same class label. In this graph, the missing label of unsupervised nodes is predicted by using a matrix completion method based on rank minimization criterion. In the next step, we use the constructed graph to calculate triplet regularization loss which is added to the supervised loss obtained by initially labeled data to update the CNN network parameters.




How to Cite

Taherkhani, F., Kazemi, H., & Nasrabadi, N. M. (2019). Matrix Completion for Graph-Based Deep Semi-Supervised Learning. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01), 5058-5065.



AAAI Technical Track: Machine Learning