Probabilistic analysis of vantage point trees (Q2068978)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Probabilistic analysis of vantage point trees |
scientific article; zbMATH DE number 7460405
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic analysis of vantage point trees |
scientific article; zbMATH DE number 7460405 |
Statements
Probabilistic analysis of vantage point trees (English)
0 references
20 January 2022
0 references
Consider a vantage-point tree constructed on the \(d\)-dimensional space \([-1,1]^d\) with the \(\ell_\infty\) distance and an exponential choice of thresholds. The author studies properties of the length of the leftmost path in such a tree, as well as partitions over this \(d\)-dimensional space induced by the tree. These results include limit theorems for the length of this leftmost path.
0 references
fixed-point equation
0 references
machine learning
0 references
Markov chain
0 references
nearest neighbor search
0 references
probabilistic analysis
0 references
random tree
0 references
similarity search
0 references
vantage point tree
0 references
vp-tree
0 references
0 references
0.86228955
0 references
0.8613624
0 references
0.8419964
0 references
0.8419964
0 references
0.84013516
0 references
0.8391861
0 references
