Algorithm 1: B0NJE Algorithm Steps.

Input: Given the $NDS$

Output: A feature subset B

1. Initialize $B=Agent=\varnothing$, $H_{\delta }\left(D,B\right)=0$

2. While $Sig\left(C,B,D\right)\le 0$ do

3.  Let $H=0$

4.  for any $b\in \left(C-B\right)$ do

5.    Calculate $H_{\delta }\left(D,B\cup b\right)$

6.    if$H_{\delta }\left(D,B\cup b\right) >H$ then

7.      Let $Agent=B\cup b$ and $H=H_{\delta }\left(D,B\cup b\right)$

8.    end if

9.  end for

10.  Let $B=Agent$

11. end while

12. return A feature subset B