NumPy / SciPy Recipes for Data Science: Computing Nearest Neighbors

Submitted by
christianbauckhage on 08 November 2015

In this note, we discuss efficient NumPy recipes for Euclidean nearest neighbor and k-nearest neighbor searches in data sets of moderate size. Our code snippets are basically one-liners and orders of magnitude faster than naive solutions.

Please Sign in or Register to leave a comment

  • Trademarks are property of their respective owners. Code and comments are owned by their respective posters. © 2013 All Rights Reserved