Distance-based index structures for fast similarity search
From MaRDI portal
Publication:1709472
DOI10.1007/s10559-017-9966-yzbMath1392.68175OpenAlexW2739676512MaRDI QIDQ1709472
Publication date: 5 April 2018
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-017-9966-y
neighborhood graphbranch-and-bound methodmetric treesimilarity searchnearest neighbor searchmetric distanceindex structuredistance-based indexingnonmetric distance
Related Items (5)
Fast similarity search for graphs by edit distance ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ Index structures for fast similarity search for binary vectors ⋮ Index structures for fast similarity search for real vectors. II ⋮ Index structures for fast similarity search for symbol strings
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Succinct representations of permutations and functions
- Indexability, concentration, and VC theory
- Real-valued embeddings and sketches for fast distance and similarity estimation
- On certain exact solutions of a generalized KdV-Burgers type equation via symmetry approach. II
- Investigation of accelerated search for close text sequences with the help of vector representations
- Approximate similarity search: a multi-faceted problem
- Universal augmentation schemes for network navigability
- Clustering to minimize the maximum intercluster distance
- Satisfying general proximity/similarity queries with metric trees
- Data dimensionality estimation methods: A survey.
- Binary vectors for fast distance and similarity estimation
- Vector representations for efficient comparison and search for similar strings
- Foundations of multidimensional and metric data structures.
- Similarity search. The metric space approach.
- Approximate bregman near neighbors in sublinear time
- On nonmetric similarity search problems in complex domains
- On the searchability of small-world networks with arbitrary underlying structure
- A Lower Bound for Network Navigability
- The small-world phenomenon
- Navigability is a Robust Property
- Introduction to Information Retrieval
- Similarity estimation techniques from rounding algorithms
- A Data Structure and an Algorithm for the Nearest Point Problem
- A Branch and Bound Algorithm for Computing k-Nearest Neighbors
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Pivot selection techniques for proximity searching in metric spaces
- New directions in nearest neighbor searching with applications to lattice sieving
- Dynamic spatial approximation trees
- Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
- Collective dynamics of ‘small-world’ networks
- Speeding up spatial approximation search in metric spaces
This page was built for publication: Distance-based index structures for fast similarity search
