VP trees: A data structure for finding stuff fast

From knowledgebase
Revision as of 10:41, 25 August 2020 by Dirkjan (talk | contribs) (Created page with "=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 nod...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.

Retrieved from "https://wiki.dirkjanswagerman.nl/index.php?title=VP_trees:_A_data_structure_for_finding_stuff_fast&oldid=3951"