Algorithm 1 Fold generation of SCV (based on Ref. [20])
Require: k            // number of folds
Require: $C=\{C_1,C_2,\dots ,C_n\}$   // classes
Ensure: $F_1,F_2,\dots ,F_k$                         // generated folds
			$F_1\leftarrow \varnothing ,F_2\leftarrow \varnothing ,\dots ,F_k\leftarrow \varnothing$
			for $i:=1$ to n do
			$n\leftarrow \lfloor count\left(C_i\right)/k\rfloor$
			if $i\le (count\left(C_i\right)$ mod k) then
			$n\leftarrow n+1$
			end if
			for $j:=1$ to k do
			$S\leftarrow$ randomly select n samples from $C_i$
			$F_j\leftarrow F_j\cup S$
			$C_i\leftarrow C_i$ \S
			end for
			end for