Nearest Neighbours (Supervised Learning)

The K-Nearest-Neighbour algorithm estimates how likely a data point is to be a member of one group or another. It essentially looks at the data points around a single data point to determine what group it is actually in. For example, if one point is on a grid and the algorithm is trying to determine what group that data point is in (Group A or Group B, for example) it would look at the data points near it to see what group the majority of the points are in.

Clearly, there are a lot of things to consider when it comes to choosing the right machine learning algorithms for your business’ analytics. 
Posted on by