K-Nearest Neighbors algorithm implemented with python. This work also contains some plots to have an idea about the performance of the algorithm itself.
It will generate 1 random point for each plot, and it is going to determine the class which belongs to. The dataset is a random dataset with the only purpose to see the algorithm behavior. The dataset is declared in test.py, and you are open to change any part of the whole code to adapted for your requirements.
python3 main.py
python3 main.py --example [example folder name from examples directory]
python3 main.py -e flowers
This project is licensed under MIT license.