Skip to content

melisekm/2D-Point-Classification

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Description

Runs k-nn algorithm on 40 000 random generated 2d points with 4 different colors(classes).
Visualizes results to "vysledky/{k}.png"
Uses multiprocessing to run knn for 1,3,7,15 nearest neighbors concurrently.
Read more in the Slovak documentation.

Usage

  1. activate your virtualenv
  2. cd to the directory where requirements.txt is located
  3. run: pip install -r requirements.txt in your shell
  4. start with python main.py

About

k-nearest neighbors K-D Tree implementation

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages