Distance-based index structures for fast similarity search
From MaRDI portal
Recommendations
- Index structures for fast similarity search for real vectors. II
- 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 symbol strings
- Similarity search. The metric space approach.
Cites work
- scientific article; zbMATH DE number 437552 (Why is no real title available?)
- scientific article; zbMATH DE number 437556 (Why is no real title available?)
- scientific article; zbMATH DE number 4137792 (Why is no real title available?)
- scientific article; zbMATH DE number 3653523 (Why is no real title available?)
- scientific article; zbMATH DE number 7051199 (Why is no real title available?)
- A Branch and Bound Algorithm for Computing k-Nearest Neighbors
- A Data Structure and an Algorithm for the Nearest Point Problem
- A lower bound for network navigability
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality
- Approximate similarity search: a multi-faceted problem
- Binary vectors for fast distance and similarity estimation
- Clustering to minimize the maximum intercluster distance
- Collective dynamics of `small-world' networks
- Data dimensionality estimation methods: A survey.
- Dynamic spatial approximation trees
- Foundations of multidimensional and metric data structures.
- Indexability, concentration, and VC theory
- Introduction to Information Retrieval
- Investigation of accelerated search for close text sequences with the help of vector representations
- Navigability is a robust property
- New directions in nearest neighbor searching with applications to lattice sieving
- On certain exact solutions of a generalized KdV-Burgers type equation via symmetry approach. II
- On nonmetric similarity search problems in complex domains
- On the searchability of small-world networks with arbitrary underlying structure
- Pattern classification.
- Pivot selection techniques for proximity searching in metric spaces
- Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
- Ptolemaic indexing
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Satisfying general proximity/similarity queries with metric trees
- Similarity estimation techniques from rounding algorithms
- Similarity search. The metric space approach.
- Speeding up spatial approximation search in metric spaces
- Succinct representations of permutations and functions
- The small-world phenomenon: an algorithmic perspective
- Universal augmentation schemes for network navigability
- Vector representations for efficient comparison and search for similar strings
Cited in
(24)- Indexing dense nested metric spaces for efficient similarity search
- Varying similarity metrics in visual information retrieval
- Index structures for fast similarity search for symbol strings
- Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances
- Index structures for fast similarity search for real-valued vectors. I
- Minkowski-type distances in approximate query searches
- scientific article; zbMATH DE number 2080538 (Why is no real title available?)
- On nonmetric similarity search problems in complex domains
- Index structures for fast similarity search for real vectors. II
- Selecting Sketches for Similarity Search
- Computer Aided Systems Theory – EUROCAST 2005
- Index structures for fast similarity search for binary vectors
- MICAI 2004: Advances in Artificial Intelligence
- Fast similarity search for graphs by edit distance
- scientific article; zbMATH DE number 1756675 (Why is no real title available?)
- Indexing schemes for similarity search: an illustrated paradigm
- A Bottom-Up Distance-Based Index Tree for Metric Space
- Approximate similarity search: a multi-faceted problem
- Counting distance permutations
- scientific article; zbMATH DE number 1975047 (Why is no real title available?)
- Ptolemaic indexing
- scientific article; zbMATH DE number 1983224 (Why is no real title available?)
- Similarity search. The metric space approach.
- X-FIST: extended flood index for efficient similarity search in massive trajectory dataset
This page was built for publication: Distance-based index structures for fast similarity search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709472)
