K Nearest Neighbors

Linear Digressions

• Episode: K Nearest Neighbors
• Website: Linear Digressions
• Feed URL: http://feeds.feedburner.com/udacity-linear-digressions?format=xml
• Duration: 00:16:25
• Published: 2019-02-18 00:57

K Nearest Neighbors is an algorithm with secrets. On one hand, the algorithm itself is as straightforward as possible: find the labeled points nearest the point that you need to predict, and make a prediction that’s the average of their answers. On the other hand, what does “nearest” mean when you’re dealing with complex data? How do you decide whether a man and a woman of the same age are “nearer” to each other than two women several years apart? What if you convert all your monetary columns from dollars to cents, your distances from miles to nanometers, your weights from pounds to kilograms? Can your definition of “nearest” hold up under these types of transformations? We’re discussing all this, and more, in this week’s episode.