Semi-Supervised Classification Based on Low Rank Representation
AbstractGraph-based semi-supervised classification uses a graph to capture the relationship between samples and exploits label propagation techniques on the graph to predict the labels of unlabeled samples. However, it is difficult to construct a graph that faithfully describes the relationship between high-dimensional samples. Recently, low-rank representation has been introduced to construct a graph, which can preserve the global structure of high-dimensional samples and help to train accurate transductive classifiers. In this paper, we take advantage of low-rank representation for graph construction and propose an inductive semi-supervised classifier called Semi-Supervised Classification based on Low-Rank Representation (SSC-LRR). SSC-LRR first utilizes a linearized alternating direction method with adaptive penalty to compute the coefficient matrix of low-rank representation of samples. Then, the coefficient matrix is adopted to define a graph. Finally, SSC-LRR incorporates this graph into a graph-based semi-supervised linear classifier to classify unlabeled samples. Experiments are conducted on four widely used facial datasets to validate the effectiveness of the proposed SSC-LRR and the results demonstrate that SSC-LRR achieves higher accuracy than other related methods. View Full-Text
Share & Cite This Article
Hou, X.; Yao, G.; Wang, J. Semi-Supervised Classification Based on Low Rank Representation. Algorithms 2016, 9, 48.
Hou X, Yao G, Wang J. Semi-Supervised Classification Based on Low Rank Representation. Algorithms. 2016; 9(3):48.Chicago/Turabian Style
Hou, Xuan; Yao, Guangjun; Wang, Jun. 2016. "Semi-Supervised Classification Based on Low Rank Representation." Algorithms 9, no. 3: 48.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.