The K Nearest Neighbors algorithm is one of the essential algoritms for machine learning. The algorithm finds all of the neighbors close to a specific point, but in a predefined and mathematical way. This algorithm is available to users of the Python package SciKitLearn.
The algorithm begins by defining the number of neighbors of interest. K-Nearest neighbors looks for numbers which are closest to the number of interest. All data points are classified in some way according to category. The algorithm counts the number of neighboring points which are closest to the point in question, and by a simple majority determines what category the point belongs to.