<s>
Best	B-Algorithm
bin	I-Algorithm
first	I-Algorithm
is	O
a	O
search	B-Application
algorithm	I-Application
that	O
is	O
designed	O
to	O
efficiently	O
find	O
an	O
approximate	O
solution	O
to	O
the	O
nearest	B-Algorithm
neighbor	I-Algorithm
search	I-Algorithm
problem	O
in	O
very-high-dimensional	O
spaces	O
.	O
</s>
<s>
The	O
algorithm	O
is	O
based	O
on	O
a	O
variant	O
of	O
the	O
kd-tree	B-Data_Structure
search	B-Application
algorithm	I-Application
which	O
makes	O
indexing	O
higher-dimensional	O
spaces	O
possible	O
.	O
</s>
<s>
Best	B-Algorithm
bin	I-Algorithm
first	I-Algorithm
is	O
an	O
approximate	O
algorithm	O
which	O
returns	O
the	O
nearest	O
neighbor	O
for	O
a	O
large	O
fraction	O
of	O
queries	O
and	O
a	O
very	O
close	O
neighbor	O
otherwise	O
.	O
</s>
<s>
This	O
is	O
implemented	O
with	O
priority	B-Application
queue	I-Application
.	O
</s>
