Nearest Neighbor Search (NNS) Algorithm

A Nearest Neighbor Search (NNS) Algorithm is a search algorithm that can solve a nearest neighbor search task.

• Context<:
  • It can produce a Nearest Neighbor Classifier.
  • It can be implemented in a Nearest Neighbor Search System.
  • It can range from being an Approximate Nearest Neighbor Search (NNS) Algorithm to being an Exact Nearest Neighbor Search (NNS) Algorithm.
  • ...
• Example(s):
  • k-Nearest Neighbor Search Algorithm.
  • ...
• See: Record Coreference Resolution Algorithm.

---

---

References

2003

• (Chaudhuri et al., 2003) ⇒ Surajit Chaudhuri, Kris Ganjam, Venkatesh Ganti, and Rajeev Motwani. (2003). “Robust and Efficient Fuzzy Match for Online Data Cleaning.” In: Proceedings of the 2003 [[ACM SIGMOD] Conference (SIGMOD 2003).

1967

• (Cover & Hart, 1967) ⇒ Thomas M Cover, and Peter E Hart. (1967). “Nearest Neighbor Pattern Classification.” In: IEEE Transactions on Information Theory, 13(1).

---