Ball tree
Encyclopedia
A ball tree is a data structure
designed to enable fast nearest neighbor search
ing in high-dimensional spaces, by covering the points in a dataset with a system of ball
s arranged in a tree
.
Data structure
In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks...
designed to enable fast nearest neighbor search
Nearest neighbor search
Nearest neighbor search , also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric spaces. The problem is: given a set S of points in a metric space M and a query point q ∈ M, find the closest point in S to q...
ing in high-dimensional spaces, by covering the points in a dataset with a system of ball
Ball (mathematics)
In mathematics, a ball is the space inside a sphere. It may be a closed ball or an open ball ....
s arranged in a tree
Tree (data structure)
In computer science, a tree is a widely-used data structure that emulates a hierarchical tree structure with a set of linked nodes.Mathematically, it is an ordered directed tree, more specifically an arborescence: an acyclic connected graph where each node has zero or more children nodes and at...
.
External links
- PDF paper Stephen M. Omohundro, "Five Balltree Construction Algorithms", November 1989.