View source for VP trees: A data structure for finding stuff fast

=URL=
http://stevehanov.ca/blog/index.php?id=130

=Description=
The authors of Data Mining: Practical machine Learning Tools and Techniques suggests using Ball Trees. Each node of a Ball tree describes a bounding sphere, using a centre and a radius. To make the search efficient, the nodes should use the minimal sphere that completely contains all of its children, and overlaps the least with other sibling spheres in the tree.
[[Category:software]]

[[Category:bookmark]]

[[Category:data structures]]

[[Category:multimodal]]

[[Category:software]]