Carlos Santos's Library tagged → View Popular
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.
-
- The running time of a nearest neighbor query is only O(log(n)) given a fixed intrinsic dimensionality. (like KR2002 and KL04)
- The space usage and query time are O(n) under no assumptions. (like the naive approach, sb(s), and ball trees)
- It's remarkably fast in practice.
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:
Selected Tags
Related Tags
Sponsored Links
Top Contributors
Groups interested in algorithms
-
Bloom Filter
Items: 4 | Visits: 26
Created by: Arrix Z
-
Algorithms
Understanding algorithms fr...
Items: 1 | Visits: 8
Created by: Ani Saraf
-
Programming - Algorithms and data structures
Items: 18 | Visits: 5
Created by: David Pěgřímek
Diigo is about better ways to research, share and collaborate on information. Learn more »
Join Diigo
