A k-nearest neighbor (k-NN) graph is a type of graph where each node represents a data point, and edges are drawn between each node and its k nearest neighbors based on some distance metric, such as Euclidean distance. The idea is to capture the local relationships between data points in a dataset by connecting each point to the k points that are closest to it in the feature space.
tags: graph-theory