Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,658,278 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Data structure
Metric tree
Nearest neighbor search
Node (computer science)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Revisitando VP-Trees: Estruturas de Complexidade de Busca Sub-linear em Espaços Métricos
D. L. Jasbick
2018
Corpus ID: 216995270
Similarity searching is a foundational paradigm for the handling of distance-only data. The paradigm supports a broad variety of…
Expand
2017
2017
SPATIO TEMPORAL FEATURE EXTRACTION WITH VISUAL CONTENT CLUSTER AND VP-TREE INDEXING FOR VIDEO RETRIEVAL
R. Devi
,
Dr. S. Murugappan
,
S. Kokila
2017
Corpus ID: 212588411
Video clustering and indexing is significant in order to improve performance of video retrieval. Recently, few research works has…
Expand
2014
2014
An Inclusion Rule for Vantage Point Tree Range Query Processing
Guohang Zeng
,
Qiaozhi Li
,
Huiming Jia
,
Xingliang Li
,
Y. Cai
,
Rui Mao
International Conference on Human Centered…
2014
Corpus ID: 1073244
Similarity search is a common computational task in many applications. Distance-based indexing techniques are proposed to enhance…
Expand
2011
2011
Empirical evaluation of excluded middle vantage point forest on biological sequences workload
Weijia Xu
,
L. P. Thompson
,
Daniel P. Miranker
NTSS '11
2011
Corpus ID: 12566763
We develop and evaluate a version of the excluded middle vantage point forest in support of range searches and load balancing for…
Expand
2011
2011
The rkd-Tree : An Improved kd-Tree for Fast n-Closest Point Queries in Large Point Sets
R. Tobler
2011
Corpus ID: 3905478
The kd-tree is used in various applications, such as photon simulation with photon maps, or normal estimation in point sets for…
Expand
2006
2006
Using machine learning to balance metric trees
E. Hagen
2006
Corpus ID: 60214248
The emergence of complex data objects that must to be indexed and accessed in databases has created a need for access methods…
Expand
2005
2005
Some improvements on NN based classifiers in metric spaces
F. Moreno-Seco
,
L. Micó
2005
Corpus ID: 234239
The nearest neighbour (NN) and k-nearest neighbour (k-NN) classification rules have been widely used in Pattern Recognition due…
Expand
1999
1999
Fast Retrieval of Similar Subsequencesin Long Sequence DatabasesSanghyun
Park
,
Dongwon Lee
,
W. Wesley
,
ChuDepartment
1999
Corpus ID: 12330571
Many Indexing techniques have been proposed to support the fast retrieval of similar sequences using the Euclidean distance…
Expand
1998
1998
Similarity Search for Sequences of Diierent Lengths: Matching and Indexing
N. Yazdani
,
Tolga Bozkaya
1998
Corpus ID: 14486844
Similarity match queries are common and important in many database applications with sequence data, such as text databases…
Expand
1998
1998
Efficient proximity search in multivariate data
David T. Kao
,
R. Bergeron
,
Ted M. Sparr
Proceedings. Tenth International Conference on…
1998
Corpus ID: 34861099
Proximity search is an important type of database query which is essential to many practical applications involving various types…
Expand