Friday, November 16, 2012

K Nearest Neighbour Algorithm

K Nearest Neighbour (KNN Algorithm)

A technique to Classify the nodes into clusters.

  1. Identify the nodes.
  2. Calculate the distance between the nodes. (Cartesian, Jaccard or other Similarity Measure score)
  3. Now for each node do the following
    1. Select K nearest neighbours
    2. Draw and edge between current node and each of the K nearest nodes
  4. Finally identify the connected components in the resultant graph.

Note:
Vary the value of 'K' for a different Classification.

No comments:

Post a Comment