We use w ij ∈ W to denote the weight of the edge between vertices i and j. W is referred to as the weight (or affinity) matrix of G. As will be seen shortly, the input features x i effect the final classification results via W, i.e., the graph.
graph construction is crucial to the success of any graph-based SSL algorithm.