Satisfying general proximity/similarity queries with metric trees
From MaRDI portal
Publication:1183466
DOI10.1016/0020-0190(91)90074-RzbMath0748.68088OpenAlexW2049644877WikidataQ29543023 ScholiaQ29543023MaRDI QIDQ1183466
Publication date: 28 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(91)90074-r
Related Items
Modeling a dynamic environment using a Bayesian multiple hypothesis approach ⋮ On the geometry of similarity search: dimensionality curse and concentration of measure ⋮ Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results ⋮ A Sorting Approach to Indexing Spatial Data ⋮ Probabilistic proximity searching algorithms based on compact partitions ⋮ Determining Tanimoto similarity neighborhoods of real-valued vectors by means of the triangle inequality and bounds on lengths ⋮ An optimal-transport finite-particle method for mass diffusion ⋮ A scalable re-ranking method for content-based image retrieval ⋮ Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions ⋮ Distance-based index structures for fast similarity search ⋮ A parallel computing framework for big data ⋮ Pivot selection: dimension reduction for distance-based indexing ⋮ Counts-of-counts similarity for prediction and search in relational data ⋮ Efficient data structures for model-free data-driven computational mechanics ⋮ Learning Binary Hash Codes for Large-Scale Image Search ⋮ Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances ⋮ Adaptive sampling in hierarchical simulation ⋮ Fast filtering false active subspaces for efficient high dimensional similarity processing ⋮ Efficient image retrieval through vantage objects ⋮ Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers ⋮ Parallel query processing on distributed clustering indexes ⋮ Solving similarity joins and range queries in metric spaces with the list of twin clusters ⋮ Counting distance permutations ⋮ Dual‐tree fast exact max‐kernel search ⋮ Random projection-based auxiliary information can improve tree-based nearest neighbor search ⋮ Parallel Algorithms for Nearest Neighbor Search Problems in High Dimensions ⋮ Exploiting distance coherence to speed up range queries in metric indexes
Cites Work
