e/Best Bin First

Information
has gloss	eng: Best Bin First is a computer algorithm which 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.
lexicalization	eng: Best Bin First
instance of	e/Search algorithm