- Step 1: Select the number K of the neighbors
- Step 2:Calculate the Euclidean distance of K number of neighbors
- step-3:Take the K nearest neighbors as per the calculated Euclidean distance
-step-4:Among these k neighbors, count the number of the data points in each category.
-
Notifications
You must be signed in to change notification settings - Fork 0
K-nearest neighbors (KNN) classification is a non-parametric supervised machine learning algorithm. It is a simple yet powerful algorithm that can be used for a variety of classification problems
EmamulHossen/KNN_for_Classification-7.2
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
K-nearest neighbors (KNN) classification is a non-parametric supervised machine learning algorithm. It is a simple yet powerful algorithm that can be used for a variety of classification problems
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published