Nearest neighbors for each test point selected by running the algorithm in section 2.2 on IBM’s simulator

t = 1

t = 2

t = 3

Test\Training

$x_{00}$

$x_{01}$

$x_{10}$

$x_{11}$

$x_{00}$

$x_{01}$

$x_{10}$

$x_{11}$

$x_{00}$

$x_{01}$

$x_{10}$

$x_{11}$

[0, 0, 0, 0]

1

1

0

0

1

1

0

0

1

1

1

0

[0, 0, 0, 1]

1

1

0

0

1

1

0

0

1

1

0

1

[0, 0, 1, 0]

1

0

0

0

1

1

1

0

1

1

1

1

[0, 0, 1, 1]

0

1

0

0

1

1

0

1

1

1

1

1

[0, 1, 0, 0]

0

1

0

0

1

1

1

0

1

1

1

1

[0, 1, 0, 1]

0

0

1

0

1

1

0

1

1

1

1

1

[0, 1, 1, 0]

0

0

0

1

1

0

1

1

1

1

1

1