The cover tree is a special type of data structure in computer science that is specifically designed to facilitate the speed-up of a nearest neighbor search. It was introduced by Alina Beygelzimer, John Langford, and Sham Kakade. The tree can be thought of as a hierarchy of levels with the top level containing the root point and the bottom level containing every point in the metric space. Each level C is associated with an integer value i that decrements by one as the tree is descended.

PropertyValue
dbpprop:abstract
  • The cover tree is a special type of data structure in computer science that is specifically designed to facilitate the speed-up of a nearest neighbor search. It was introduced by Alina Beygelzimer, John Langford, and Sham Kakade. The tree can be thought of as a hierarchy of levels with the top level containing the root point and the bottom level containing every point 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: <math>C_{i} \subseteq C_{i-1}</math> Covering: For every point <math>p \in C_{i-1}</math>, there exists a point <math>q \in C_{i} </math> such that the distance from <math>p</math> to <math>q</math> is less than or equal to <math>2^{i}</math> and exactly one such <math>q</math> is a parent of <math>p</math>. Separation: For all points <math>p,q \in C_i</math>, the distance from <math>p</math> to <math>q</math> is greater than <math>2^{i}</math>.
dbpprop:hasPhotoCollection
dbpprop:reference
rdf:type
rdfs:comment
  • The cover tree is a special type of data structure in computer science that is specifically designed to facilitate the speed-up of a nearest neighbor search. It was introduced by Alina Beygelzimer, John Langford, and Sham Kakade. The tree can be thought of as a hierarchy of levels with the top level containing the root point and the bottom level containing every point in the metric space. Each level C is associated with an integer value i that decrements by one as the tree is descended.
rdfs:label
  • Cover tree
owl:sameAs
skos:subject
foaf:page
is dbpprop:redirect of
is owl:sameAs of