The previous chapter showed how nearest-neighbor search allows us to find nearby or close data points, broadening our ability to answer coffee-related questions, such as finding the closest physical location or finding items with similar attributes. In this chapter, we build on the concepts of tree-based data structures and spatial partitioning to further improve our nearest-neighbor searches.
Chapter 8 discussed how we can adapt the algorithmic concepts for finding a specific value to the more general problem of finding nearest neighbors. We also saw how operations become more difficult as we transition from a single dimension ...
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.
