k-Nearest Neighbors Relation
Jump to navigation
Jump to search
A k-Nearest Neighbors Relation is a Set Relation between k Points and a Query Point (from a Point Space) where no other Point is closer according to some Distance Function to the Query Point.
- Context:
- It can require a Tie Breaking Rule.
- It can be a 1-Nearest Neighbor Relation, for the 1-Nearest Neighbor, if k=1.
- See: kth-Nearest Neighbor Relation, Nearest Neighbor Relation, Nearest Neighbor Task.