Jump to content

Cover trees

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Ramsta3 (talk | contribs) at 16:35, 26 April 2007 (←Created page with 'The Cover Tree is a special type of data structure in computer science that is specifically designed to facilitate the speed-up of nearest neighbor searches...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The Cover Tree is a special type of data structure in computer science that is specifically designed to facilitate the speed-up of nearest neighbor searches. The tree can be thought of as a hierarchy of levels with the top level containing the root tuple and the bottom level containing every tuple in the metric space. Each level C is associated with an integer value i that decrements by one as the tree is descended. Each level C in the cover tree has three important properties:

Nesting: Covering: Separation:

Retrieved from "https://en.wikipedia.org/w/index.php?title=Cover_trees&oldid=126171469"