GitHub - abhishekvarde/K-Nearest-Algorithm: K nearest neighbors is a simple algorithm that stores all available cases and classifies new cases based on a similarity measure (e.g., distance functions).

abhishekvarde / K-Nearest-Algorithm Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

K nearest neighbors is a simple algorithm that stores all available cases and classifies new cases based on a similarity measure (e.g., distance functions).

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
Iris.csv		Iris.csv
K Nearest Neighbors.ipynb		K Nearest Neighbors.ipynb

About

K nearest neighbors is a simple algorithm that stores all available cases and classifies new cases based on a similarity measure (e.g., distance functions).