Resultado de búsqueda
A vantage-point tree (or VP tree) is a metric tree that segregates data in a metric space by choosing a position in the space (the "vantage point") and partitioning the data points into two parts: those points that are nearer to the vantage point than a threshold, and those points that are not.
VP-Tree (Vantage Point Tree) is a data structure that enables efficient nearest neighbor search in metric spaces, with applications in machine learning, computer vision, and information retrieval.
21 de jul. de 2021 · Una de las estructuras de datos que nos facilita reducir de manera drástica el tiempo de búsqueda (concretamente, de O(n) a O(log n)) es el VP-Tree, cuyo nombre completo en inglés es Vantage-point Trees y, en español, Árboles de Punto de Ventaja.
Un VPT es un árbol binario en el que cada nodo representa un subconjunto S de individuos del conjunto inicial, utiliza un elemento especial del conjunto llamado pivote (vantage point) para dividir el conjunto S en dos subconjuntos, uno por cada hijo.
In this paper, we propose the Bregman vantage point tree (Bvp-tree) as a generalization of the metric vp-tree to Breg-man divergences. Our main theoretical contribution is to re-place the triangle inequality byan analogous criterion based on the intersection of Bregman balls, which allows one for checking pruning conditions wrt. Bregman ...
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. ACM Press.
In this blog entry, I will half-heartedly describe some data structures for spatial search. Then I will launch into a detailed explanation of VP-Trees (Vantage Point Trees), which are simple, fast, and can easily handle low or high dimensional data.
