Ball tree
In computer science, a ball tree, balltree or metric tree, is a space partitioning data structure for organizing points in a multi-dimensional space. The ball tree gets its name from the fact that it partitions data points into a nested set of hyperspheres known as "balls". The resulting data structure has characteristics that make it useful for a number of applications, most notably nearest neighbor search.
Link from a Wikipage to another Wikipage
primaryTopic
Ball tree
In computer science, a ball tree, balltree or metric tree, is a space partitioning data structure for organizing points in a multi-dimensional space. The ball tree gets its name from the fact that it partitions data points into a nested set of hyperspheres known as "balls". The resulting data structure has characteristics that make it useful for a number of applications, most notably nearest neighbor search.
has abstract
In computer science, a ball tr ...... tably nearest neighbor search.
@en
Wikipage page ID
31,877,832
page length (characters) of wiki page
Wikipage revision ID
1,021,821,108
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
In computer science, a ball tr ...... tably nearest neighbor search.
@en
label
Ball tree
@en