K Approximate Nearest Neighbors Search: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "{{DISPLAYTITLE:k Approximate Nearest Neighbors Search (Nearest Neighbor Search)}} == Description == Within a dataset of $n$ points, find approximately the $k$ closest points to a specified point. == Related Problems == Generalizations: k 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
 
(2 intermediate revisions by the same user not shown)
Line 7: Line 7:


Generalizations: [[k Nearest Neighbors Search]]
Generalizations: [[k Nearest Neighbors Search]]
Subproblem: [[k-ANNS for a dense 3D map of geometric points]]


== Parameters ==  
== Parameters ==  


<pre>n: number of points in dataset
$n$: number of points in dataset
k: number of neighbors to find</pre>
 
$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 08:52, 10 April 2023

Description

Within a dataset of $n$ points, find approximately the $k$ closest points to a specified point.

Related Problems

Generalizations: k Nearest Neighbors Search

Subproblem: 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.