K Nearest Neighbors Search: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:k Nearest Neighbors Search (Nearest Neighbor Search)}} == Description == Within a dataset of $n$ points, find the $k$ closest points to a specified point. == Related Problems == Subproblem: k Approximate Nearest Neighbors Search == Parameters == <pre>n: number of points in dataset k: number of neighbors to find</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem.") |
No edit summary |
||
Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
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. |
Revision as of 12:02, 15 February 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
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.