Graph-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,...

The Universum data, defined as a collection of ”nonexamples” that do not belong to any class of interest, have been shown to encode some prior knowledge by representing meaningful concepts in the same domain as the problem at hand. In this paper, we address a novel semi-supervised classification problem, called semi-supervised Universum, that can simultaneously utilize the labeled data, unlabel...

An even 2-factor is one such that each cycle of length. A 4- regular graph G 4-edge-colorable if and only has two edge-disjoint 2- factors whose union contains all edges in G. It known the line a cubic without 3-edge-coloring not 4-edge-colorable. Hence, we are interested whether those graphs have an 2-factor. Bonisoli Bonvicini proved connected with number 2-factor, perfect matching [Even cycl...