Implementation of K nearest neighbour algorithm for classification. K is
chosen on the basis of leave-one-out cross-validation on the training
set. K can be chosen on bases of zero-one or squared
probability loss. It produces
guesses for the most likely category as well as a probability
distribution. More details are available in the on-line documentation .
Software
Source code for an implementation in C is available as a compressed tar file.
Results
Directory listing of the results available for the
knn-class-1 method. Put the desired files in the appropriate methods
directory in your delve hierarchy and uncompress them with using the
"gunzip *.gz" command and untar them using "tar -xvf
knn-class-1.tar".