Therefore, we propose an iterative graph-based algorithm, namely course concept propagation (CCP), which first assigns each vertex of CCG an initial confidence score, and iteratively updates the score for each vertex through propagation.
the initial confidence score of each candidate course concept is determined by a seed set S, which contains a list of known course concepts in D. let us denote the confidence score of the vertex c in the k-th iteration as conf k (c), and the initial confidence score of c as conf 0 (c).