Skip to main content

Carlos Santos's Library tagged algorithms   View Popular

14 Apr 09

Cover Tree

A Cover Tree is a datastructure helpful in calculating the nearest neighbor of points given only a metric. A cover tree is particularly motivating for a confluence of reasons:

1. The running time of a nearest neighbor query is only O(log(n)) given a fixed intrinsic dimensionality. (like KR2002 and KL04)
2. The space usage and query time are O(n) under no assumptions. (like the naive approach, sb(s), and ball trees)
3. It's remarkably fast in practice.

hunch.net/...cover_tree.html - Preview

algorithms MachineLearning nearestneighbor



    • A Cover Tree is a datastructure helpful in calculating the nearest
      neighbor of points given only a metric. A cover tree is particularly
      motivating for a confluence of reasons:


      1. The running time of a nearest neighbor query is only O(log(n)) given a fixed intrinsic dimensionality. (like KR2002 and KL04)
      2. The space usage and query time are O(n) under no assumptions. (like the naive approach, sb(s), and ball trees)
      3. It's remarkably fast in practice.
1 - 20 of 190 Next › Last »
Showing 20 items per page

Highlighter, Sticky notes, Tagging, Groups and Network: integrated suite dramatically boosting research productivity. Learn more »

Join Diigo