In this paper, we present a novel semi-supervised learning framework based on 1 graph. The 1 graph is motivated by that each datum can be reconstructed by the sparse linear superposition of the training data. The sparse reconstruction coefficients, used to deduce the weights of the directed 1 graph, are derived by solving an 1 optimization problem on sparse representation. Different from conventional graph construction processes which are generally divided into two independent steps, i.e., adjacency searching and weight selection, the graph adjacency structure as well as the graph weights of the 1 graph is derived simultaneously and in a parameter-free manner. Illuminated by the validated discriminating power of sparse representation in [16], we propose a semi-supervised learning framework based on 1 graph to utilize both labeled and unlabeled data for inference on a graph. Extensive experiments on semi-supervised face recognition and image classification demonstrate the superiority of our proposed semi-supervised learning framework based on 1 graph over the counterparts based on traditional graphs.
REF proposed a novel graph called 1 -graph via sparse representation by L 1 optimization.
Semi-supervised learning by sparse representation
SIAM International Conference on Data Mining, SDM
Computer Science