Resultado de búsqueda
The main steps of a VP-tree construction are presented as below [46], [51][52] [53] [54][55]; 1) choose a vantage-point, 2) calculate the distances between the vantage-point and the others, 3 ...
A basic Vantage Point Tree (VPT) algorithm [20] builds a binary tree, where every internal node of the tree divides the indexed data into two partitions and objects are stored in leaves -see ...
SIMILARITY SEARCH The Metric Space Approach Pavel Zezula, Giuseppe Amato, Vlastislav Dohnal, Michal Batko
5 de jun. de 1994 · Vantage-Point Tree (VPT) [114,115,122] is designed for continuous distance functions, and it has also been extended to a dynamic structure DVPT [58] and generalized to m-ary trees yielding MVPT ...
i) Vantage Point Tree The Vantage Point Tree[6] (VPT) is based on the ball partition. It choose a object p called vantage point as the center of a circle, and the median distance M from p to the objects in dataset as radius, then divides dataset S into subsets
dm2} El conjunto externo d(p, x) > dm2 dm1 p VPT. Vantage Point Tree [Yianilos, 1993] Yianilos, P. N. (1993). Data structures and algorithms for nearest neighbor search in general metric spaces. In Proceedings of the 4th Annual ACM Symposium on Discrete Algorithms (SODA 1993), Austin, Texas, USA, January 25-27, 1993, pages 311- 321.
SIMILARITY SEARCH The Metric Space Approach Pavel Zezula, Giuseppe Amato, Vlastislav Dohnal, Michal Batko
