FAQ: K-Nearest Neighbors - Graph of K

This community-built FAQ covers the “Graph of K” exercise from the lesson “K-Nearest Neighbors”.

Paths and Courses
This exercise can be found in the following Codecademy content:

Data Science

Machine Learning

FAQs on the exercise Graph of K

Join the Discussion. Help a fellow learner on their journey.

Ask or answer a question about this exercise by clicking reply (reply) below!

Agree with a comment or answer? Like (like) to up-vote the contribution!

Need broader help or resources? Head here.

Looking for motivation to keep learning? Join our wider discussions.

Learn more about how to use this guide.

Found a bug? Report it!

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

Will k with the highest accuracy remain the same if we make our training set bigger?

1 Like

What is the algorithm to plot a graph visualizing the variation of the Validation Accuracy vs. K?

1 Like

Good questions, unfortunately, I’m not seeing much answers being given here. I also have a question: I have written the first complete classifier and I’m amazed that it doesn’t give weight to points that are closer to the new point being classified. Why is this? Are there any algorithms that do give the point extra weight based on their distance?