Best bin first
id:
best-bin-first-270-1968993
title:
Best bin first
text:
Best bin first is a search algorithm that is designed to efficiently find an approximate solution to the nearest neighbor search problem in very-high-dimensional spaces. The algorithm is based on a variant of the kd-tree search algorithm which makes indexing higher-dimensional spaces possible. Best bin first is an approximate algorithm which returns the nearest neighbor for a large fraction of queries and a very close neighbor otherwise.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Best_bin_first
date created:
date modified:
2023-01-22T18:51:29Z
main entity:
{"identifier":"Q4896845","url":"https://www.wikidata.org/entity/Q4896845"}
image:
fields total:
13
integrity:
13