K Nearest Neighbors Search: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 7: | Line 7: | ||
Subproblem: [[k Approximate Nearest Neighbors Search]] | Subproblem: [[k Approximate Nearest Neighbors Search]] | ||
Related: [[k-ANNS for a dense 3D map of geometric points]] | |||
== Parameters == | == Parameters == | ||
n: number of points in dataset | $n$: number of points in dataset | ||
k: number of neighbors to find | $k$: number of neighbors to find | ||
== Table of Algorithms == | == Table of Algorithms == | ||
Currently no algorithms in our database for the given problem. | Currently no algorithms in our database for the given problem. | ||
Latest revision as of 07:52, 10 April 2023
Description
Within a dataset of $n$ points, find the $k$ closest points to a specified point.
Related Problems
Subproblem: k Approximate Nearest Neighbors Search
Related: k-ANNS for a dense 3D map of geometric points
Parameters
$n$: number of points in dataset
$k$: number of neighbors to find
Table of Algorithms
Currently no algorithms in our database for the given problem.