Skip to search formSkip to main contentSkip to account menu

Vantage-point tree

Known as: MVP tree, VP tree, VP-tree 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Data structureMetric treeNearest neighbor searchNode (computer science)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The research on nearest neighbor search algorithm based on vantage point tree
The nearest neighbor search algorithm is an indispensable part of many image processing algorithms. In order to improve its… 
2017
2017
Computer simulations of association-based image search mechanisms basing on theory of active perception
We discuss an approach to development of an associative memory model from the viewpoint of the theory of active perception. The… 
2014
2014
Basic Triangle Inequality Approach Versus Metric VP-Tree and Projection in Determining Euclidean and Cosine Neighbors
The Euclidean distance and the cosine similarity are often applied for clustering or classifying objects or simply for… 
2011
2011
Empirical evaluation of excluded middle vantage point forest on biological sequences workload
We develop and evaluate a version of the excluded middle vantage point forest in support of range searches and load balancing for… 
2011
2011
A method to Improve metric index VP-tree for multimedia databases
On multimedia databases, in order to realize the fast access method, indexing methods for the multi-dimension data space are used… 
2010
2010
Data Structures for Accelerating Tanimoto Queries on Real Valued Vectors
Previous methods for accelerating Tanimoto queries have been based on using bit strings for representing molecules. No work has… 
2008
2008
Novel approach for nearest neighbor search in high dimensional space
Index structures for nearest neighbor search in high-dimensional metric space are mostly built by partitioning the data set based… 
2005
2005
Some improvements on NN based classifiers in metric spaces
The nearest neighbour (NN) and k-nearest neighbour (k-NN) classification rules have been widely used in Pattern Recognition due… 
1998
1998
Efficient proximity search in multivariate data
Proximity search is an important type of database query which is essential to many practical applications involving various types… 
1998
1998
Similarity Search for Sequences of Diierent Lengths: Matching and Indexing
Similarity match queries are common and important in many database applications with sequence data, such as text databases… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)