K Nearest neighbours classification
Input data, in m x n matrix, where m is the features, n is different datasets
Target data, in 1 x n vector, where the value shall be the classes which correspond to each set of data in x
Data undertest, in m x p, where m must be the same number of features, p is any set of data to be tested.
Number of neighbours to be compare
Predicted class for xtest
Distance of the xtests to each classes
K Nearest neighbours classification