Probabilistic analysis of vantage point trees
Probabilistic properties of vantage point trees are studied. A vp-tree built from a sequence of independent identically distributed points in ${[-1,\hspace{0.1667em}1]^{d}}$ with the ${\ell _{\infty }}$-distance function is considered. The length of the leftmost path in the tree, as well as partitio...
Main Author: | Vladyslav Bohun |
---|---|
Format: | Article |
Language: | English |
Published: |
VTeX
2021-08-01
|
Series: | Modern Stochastics: Theory and Applications |
Subjects: | |
Online Access: | https://www.vmsta.org/doi/10.15559/21-VMSTA188 |
Similar Items
-
Probabilistic Nearest Neighbors Classification
by: Bruno Fava, et al.
Published: (2023-12-01) -
Parallel computing solutions for Markov chain spatial sequential simulation of categorical fields
by: Weixing Zhang, et al.
Published: (2019-05-01) -
Analysis of Program Representations Based on Abstract Syntax Trees and Higher-Order Markov Chains for Source Code Classification Task
by: Artyom V. Gorchakov, et al.
Published: (2023-09-01) -
An Innovative Approach to Estimate Chloride Diffusion Coefficient in Submerged Concrete Structures Using Soft Computing
by: Seyyed Ali Habibi, et al.
Published: (2023-08-01) -
KdO-Net: Towards Improving the Efficiency of Deep Convolutional Neural Networks Applied in the 3D Pairwise Point Feature Matching
by: Rui Zhang, et al.
Published: (2022-06-01)