Algorithm 2 Fold generation of DOB-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
			while $count\left(C_i\right)>0$ do
			$x_1\leftarrow$ randomly select sample from $C_i$
			$F_1\leftarrow F_1\cup \left\{x_1\right\}$
			$C_i\leftarrow C_i$ \ $\left\{x_1\right\}$
			for $j:=2$ to k do
			$x_2\leftarrow$ select the nearest neighbour of $x_1$ from $C_i$
			$F_j\leftarrow F_j\cup \left\{x_2\right\}$
			$C_i\leftarrow C_i$ \ $\left\{x_2\right\}$
			if $count\left(C_i\right)=0$ then
			$j\leftarrow k$                         // end for j
			end if
			end for
			end while
			end for