| Algorithm 1 KNNBP. | |
| Input: FD = | |
| F = (F FD) | |
| F = | |
| 1: | forj = 1 to n do |
| 2: | for i = 1 to m do |
| 3: | if ma = MA then |
| 4: | if | − | < V then |
| 5: | = 1 − |
| 6: | end if |
| 7: | end if |
| 8: | end for |
| 9: | = |
| 10: | end for |
| 11: | sort from largest to smallest |
| 12: | select the first K positions (,) corresponding to |
| 13: | calculate position (x, y) = |
| 14: | return (x, y) |