Nearest neighbors are points (or other objects) in close proximity to a given location in some multi-dimensional space, e.g. a plane. Finding such neighbors lies at the core of several algorithms for various applications.
Nearest neighbors are points (or other objects) in close proximity to a given location in some multi-dimensional space, e.g. a plane. Finding such neighbors lies at the core of several algorithms for various applications.
Known applications of nearest-neighbor approaches
- One of the first algorithms used to determine an approximate solution to the travelling salesman problem works like this: The salesman starts at a random city and repeatedly visits the nearest city until all have been visited.
This tag should be about questions related to
- How to find nearest neighbors in a given setup
- How to adjust nearest-neighbor approaches to taiolor them for specific needs
- Algorithms which make use of nearest neighbors at some point
