Skip to Content
Grokking Algorithms
book

Grokking Algorithms

by Aditya Bhargava
May 2016
Intermediate to advanced
256 pages
5h 53m
English
Manning Publications
Content preview from Grokking Algorithms

Chapter 10. K-nearest neighbors

In this chapter

  • You learn to build a classification system using the k-nearest neighbors algorithm.
  • You learn about feature extraction.
  • You learn about regression: predicting a number, like the value of a stock tomorrow, or how much a user will enjoy a movie.
  • You learn about the use cases and limitations of k-nearest neighbors.

Classifying oranges vs. grapefruit

Look at this fruit. Is it an orange or a grapefruit? Well, I know that grapefruits are generally bigger and redder.

My thought process is something like ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Grokking Algorithms, Second Edition

Grokking Algorithms, Second Edition

Aditya Bhargava
Algorithms: 24-part Lecture Series

Algorithms: 24-part Lecture Series

Robert Sedgewick, Kevin Wayne

Publisher Resources

ISBN: 9781617292231Publisher SupportOtherPublisher WebsiteSupplemental ContentErrata PagePurchase Link