K-nearest neighbours algorithm in C

Google+ Pinterest LinkedIn Tumblr +

In a previous post we saw the differences between K-means and K-NN. Here is step by step on how to compute K-nearest neighbors KNN algorithm.

  1. Determine parameter K = number of nearest neighbors
  2. Calculate the distance between the query-instance and all the training samples
  3. Sort the distance and determine nearest neighbors based on the K-th minimum distance
  4. Gather the category of the nearest neighbors
  5. Use simple majority of the category of nearest neighbors as the prediction value of the query instance

GitLab Repository : https://gitlab.com/robotomy/k-nearest-neighbours

Training Samples

New Samples to categorize

 

Share.

Leave A Reply