Real-valued embeddings and sketches for fast distance and similarity estimation
From MaRDI portal
Publication:508585
Recommendations
- Binary vectors for fast distance and similarity estimation
- Estimation of vectors similarity by their randomized binary projections
- Index structures for fast similarity search for real-valued vectors. I
- Selecting Sketches for Similarity Search
- Index structures for fast similarity search for real vectors. II
Cites work
- scientific article; zbMATH DE number 5764869 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 6999914 (Why is no real title available?)
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- scientific article; zbMATH DE number 2109363 (Why is no real title available?)
- scientific article; zbMATH DE number 2119731 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- A comparison of explicit and implicit graph embedding methods for pattern recognition
- A simple proof of the restricted isometry property for random matrices
- A sparse Johnson-Lindenstrauss transform
- A unified framework for linear dimensionality reduction in L1
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices
- Algorithmic derandomization via complexity theory
- Almost Optimal Explicit Johnson-Lindenstrauss Families
- An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
- An algorithmic theory of learning: Robust concepts and random projection
- An information statistics approach to data stream and communication complexity
- An introduction to matrix concentration inequalities
- Approximating edit distance in near-linear time
- Binary vectors for fast distance and similarity estimation
- Bottom-k and priority sampling, set similarity and subset sums with minimal independence
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Dense fast random projections and Lean Walsh transforms
- Dimension reduction by random hyperplane tessellations
- Dimension reduction techniques for \(\ell_p\) \((1<p<2)\), with applications
- Dimensionality reductions in \(\ell_{2}\) that preserve volumes and distance to affine spaces
- Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
- Embedding \(l_ p^ m\) into \(l_ 1^ n\)
- Embedding the diamond graph in \(L_p\) and dimension reduction in \(L_1\)
- Empirical processes and random projections
- Encyclopedia of distances
- Estimation for monotone sampling
- Explicit dimension reduction and its applications
- Extensions of Lipschitz mappings into a Hilbert space
- Fast and RIP-optimal transforms
- Fast dimension reduction using Rademacher series on dual BCH codes
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Formation of similarity-reflecting binary vectors with random binary projections
- Foundations of multidimensional and metric data structures.
- Graph Embedding in Vector Spaces by Means of Prototype Selection
- Graph kernels
- Homomorphic fingerprints under misalignments
- Improved lower bounds for embeddings into L1
- Isometric sketching of any set via the restricted isometry property
- Johnson-Lindenstrauss lemma for circulant matrices
- Learning a priori constrained weighted majority votes
- Linear dimensionality reduction: survey, insights, and generalizations
- Low distortion embeddings for edit distance
- Metric learning: a survey
- Metric structures in \(L_1\): dimension, snowflakes, and average distortion
- Near Linear Lower Bound for Dimension Reduction in L1
- Nearest-neighbor-preserving embeddings
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- New bounds for circulant Johnson-Lindenstrauss embeddings
- New constructions of RIP matrices with fast multiplication and fewer rows
- Oblivious string embeddings and edit distance approximations
- On the impossibility of dimension reduction in l 1
- On variants of the Johnson–Lindenstrauss lemma
- One-bit compressed sensing by linear programming
- Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with subconstant error
- Polylogarithmic approximation for edit distance and the asymmetric query complexity
- Priority sampling for estimation of arbitrary subset sums
- Quasi-Monte Carlo feature maps for shift-invariant kernels
- Randomized projective methods for the construction of binary sparse vector representations
- Restricted isometries for partial random circulant matrices
- Restricted isometry property for general \(p\)-norms
- Revisiting the Nyström method for improved large-scale machine learning
- SPSD matrix approximation vis column selection: theories, algorithms, and extensions
- Similarity estimation techniques from rounding algorithms
- Similarity search. The metric space approach.
- Sketching Information Divergences
- Sketching and embedding are equivalent for norms
- Sparser Johnson-Lindenstrauss transforms
- Sparsity lower bounds for dimensionality reducing maps
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- Suprema of chaos processes and the restricted isometry property
- Synopses for massive data: samples, histograms, wavelets, sketches
- The Dissimilarity Representation for Pattern Recognition
- The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
- The Mailman algorithm: a note on matrix-vector multiplication
- The dimension of almost spherical sections of convex bodies
- The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
- The string edit distance matching problem with moves
- The sub-Gaussian norm of a binary random variable
- Two observations regarding embedding subsets of Euclidean spaces in normed spaces
- Uniform sampling for matrix approximation
- Vector data transformation using random binary matrices
- Vector representations for efficient comparison and search for similar strings
Cited in
(14)- Distance-based index structures for fast similarity search
- Index structures for fast similarity search for symbol strings
- Index structures for fast similarity search for real-valued vectors. I
- Technology of autonomous take-off and landing for the modern flight and navigation complex of an unmanned aerial vehicle
- Estimation of vectors similarity by their randomized binary projections
- Efficient binary embedding of categorical data using BinSketch
- Index structures for fast similarity search for real vectors. II
- Selecting Sketches for Similarity Search
- Index structures for fast similarity search for binary vectors
- Fast similarity search for graphs by edit distance
- A linear system output transformation for sparse approximation
- Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance
- Binary vectors for fast distance and similarity estimation
- scientific article; zbMATH DE number 1897896 (Why is no real title available?)
This page was built for publication: Real-valued embeddings and sketches for fast distance and similarity estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q508585)
