Premium
NearTree , a data structure and a software toolkit for the nearest‐neighbor problem
Author(s) -
Andrews Lawrence C.,
Bernstein Herbert J.
Publication year - 2016
Publication title -
journal of applied crystallography
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.429
H-Index - 162
ISSN - 1600-5767
DOI - 10.1107/s1600576716004039
Subject(s) - k nearest neighbors algorithm , computer science , software , nearest neighbor search , metric (unit) , data mining , data structure , best bin first , theoretical computer science , information retrieval , algorithm , artificial intelligence , programming language , engineering , operations management
Many problems in crystallography and other fields can be treated as nearest‐neighbor problems. The neartree data structure provides a flexible way to organize and retrieve metric data. In some cases, it can provide near‐optimal performance. NearTree is a software tool that constructs neartrees and provides a number of different query tools.