Algorithm 2. The prediction phase of the CC algorithm

Input: $X_{test}$, $C_j,j=1,2,\dots ,Q$ Output: predicted label sets of each instance in $X_{test}$ Steps for ${\mathit{x}}_{\mathit{i}}\in X_{test}$, $i=m+1,\dots ,m+n;$ do;   ${\mathit{y}}_{\mathit{i}}^{\prime }\leftarrow \left\{\right\}$; for $j=1toQ;$ do ${\mathit{y}}_{\mathit{i}}^{\prime }\leftarrow {\mathit{y}}_{\mathit{i}}^{\prime }U\left\{\left(l_j\leftarrow C_j:\left({\mathit{x}}_{\mathit{i}},l_1,\dots ,l_{j-1}\right)\right)\right\}$; return $\left({\mathit{x}}_{\mathit{i}},{\mathit{y}}_{\mathit{i}}^{\prime }\right)$·$i=m+1,\dots ,m+n$/*the classified test samples */.