Algorithm 1:

Greedy query function

Input: unlabeled samples U, batch size N

Output: batch of samples B

B ← ∅

while |B| < N do

$|\begin{array}{c}k\leftarrow \arg {\max }_{i\in U}Q(B\cup i);\\ B\leftarrow \cup \left\{k\right\};\\ U\leftarrow U-\left\{k\right\};\end{array}$

end