Technologies used: Java Steps:
- Reading data from CSV File.
- Cleaning data by removing Nulls.
- Finding the K Nearest Neighbours for the given location using Euclidean Distance.
This is a Copart Coding Challenge for Internship.
-
Notifications
You must be signed in to change notification settings - Fork 0
keerthitejakonuri/K-Nearest-Neighbours
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
1. Reading data from CSV File. 2. Cleaning data by removing Nulls. 3. Finding the K Nearest Neighbours for the given location using Euclidean Distance.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published