Probabilistic analysis of vantage point trees

DOI10.15559/21-VMSTA188zbMath1482.60033OpenAlexW3190128348MaRDI QIDQ2068978

Vladyslav Bohun

Publication date: 20 January 2022

Published in: Modern Stochastics. Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15559/21-vmsta188

zbMATH Keywords

probabilistic analysisMarkov chainfixed-point equationmachine learningrandom treesimilarity searchnearest neighbor searchvantage point treevp-tree

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Central limit and other weak theorems (60F05) Discrete-time Markov processes on general state spaces (60J05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• The diminishing segment process
• On the diminishing process of Bálint Tóth
• Adjoint Transform, Overconvexity and Sets of Constant Width
• Multidimensional binary search trees used for associative searching
• The uniform convergence of nearest neighbor regression function estimators and their application in optimization
• Nearest neighbor pattern classification
• Estimation by the nearest neighbor rule
• Probability

This page was built for publication: Probabilistic analysis of vantage point trees