k-nearest neighbors

k-nearest neighbors search is finding the k stored vectors closest to a query vector. Done exactly, it compares the query with every vector, which becomes slow for large collections.

k-nearest neighbors sits in the Retrieval & memory part of the Agentik {OS} glossary, which defines the words used to build and run AI agent systems.

Also called kNN, nearest neighbor search, exact nearest neighbor search.