Classifies a set of test data based on the k Nearest Neighbor algorithm using the training data.
Note that for the Euclidean distance on numeric columns the other K Nearest Neighbor node performs better as it uses an efficient index structure. The implementation of this node performs an exhaustive search of all points to all potential neighbors and is therefore suited for small to medium data sets only.