11 Applications of nearest neighbor search

This chapter covers

  • Adapting abstract algorithms to the complexity of real systems
  • Designing a solution for the “closest hub” problem using NN search
  • Adding filtering to NN search to support business logic and dynamic supply
  • Dealing with faulty networks and failure, and deploying to the real world
  • Applying NN search to other domains, such as physics and computer graphics

It’s time to harvest what we’ve sown and to start solving the problems we have discussed in the last few chapters. As always, after a deep dive into theory, we try to give you a “real-life” angle, and in this chapter, we will incrementally build a solution for the “closest hub” problem, one that takes into account many of the issues ...

Get Advanced Algorithms and Data Structures now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.