đź’»
Grokking Algorithm
  • Chapter 1: Big O notation & Binary Search
  • Chapter 2: Selection Sort
  • Chapter 3: Recursion
  • Chapter 4: QuickSort
  • Chapter 5: Hash Tables
  • Chapter 6: Breadth-first Search
  • Chapter 7: Dijkstra's Algorithm
  • Chapter 8: Greedy Algorithm
  • Chapter 9: Dynamic Programming
  • Chapter 10: K-nearest neighbors
  • Chapter 11: Next?
Powered by GitBook
On this page

Was this helpful?

Chapter 10: K-nearest neighbors

KNN—classification and regression:

  • Classification = categorization into a group

  • Regression = predicting a response (like a number)

Cosine similarity

  • Cosine similarity doesn’t measure the distance between two vectors.

  • Instead, it compares the angles of the two vectors.

PreviousChapter 9: Dynamic ProgrammingNextChapter 11: Next?

Last updated 5 years ago

Was this helpful?