Binary vectors for fast distance and similarity estimation
From MaRDI portal
Publication:2362826
DOI10.1007/s10559-017-9914-xzbMath1366.93641OpenAlexW2581602397MaRDI QIDQ2362826
Publication date: 14 July 2017
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-017-9914-x
samplingsketchembeddingdistancesimilarityquantizationrandom projectionbinarizationsimilarity searchJohnson-Lindenstrauss lemmakernel similaritylocality-sensitive hashing
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Estimation and detection in stochastic control theory (93E10) Stochastic systems in control theory (general) (93E03)
Related Items (9)
Fast similarity search for graphs by edit distance ⋮ Technology of autonomous take-off and landing for the modern flight and navigation complex of an unmanned aerial vehicle ⋮ Distance-based index structures for fast similarity search ⋮ Index structures for fast similarity search for real-valued vectors. I ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ 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 ⋮ A linear system output transformation for sparse approximation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Propagation kernels: efficient graph kernels from propagated information
- Randomized projective methods for the construction of binary sparse vector representations
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Pegasos: primal estimated sub-gradient solver for SVM
- Kernels and distances for structured data
- Estimation of vectors similarity by their randomized binary projections
- Kernel methods in machine learning
- Probabilistic counting algorithms for data base applications
- Size-estimation framework with applications to transitive closure and reachability
- Fuzzy multilevel graph embedding
- Cutting-plane training of structural SVMs
- Fast binary embeddings with Gaussian circulant matrices: improved bounds
- Dimension reduction by random hyperplane tessellations
- Time of searching for similar binary vectors in associative memory
- A binding procedure for distributed binary data representations
- Properties of numeric codes for the scheme of random subspaces RSC
- Formation of similarity-reflecting binary vectors with random binary projections
- Similarity search. The metric space approach.
- A Small Approximately Min-Wise Independent Family of Hash Functions
- An improvement of the Berry–Esseen inequality with applications to Poisson and mixed Poisson random sums
- Explicit Dimension Reduction and Its Applications
- Sketching and Embedding are Equivalent for Norms
- A Quantized Johnson–Lindenstrauss Lemma: The Finding of Buffon’s Needle
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- Approximately Minwise Independence with Twisted Tabulation
- A Sketch Algorithm for Estimating Two-Way and Multi-Way Associations
- Large-Scale Machine Learning with Stochastic Gradient Descent
- Extensions of Lipschitz mappings into a Hilbert space
- Support Vector Machines
- On variants of the Johnson–Lindenstrauss lemma
- Similarity estimation techniques from rounding algorithms
- Nearest-neighbor-preserving embeddings
- Oblivious string embeddings and edit distance approximations
- On the k-Independence Required by Linear Probing and Minwise Independence
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- New directions in nearest neighbor searching with applications to lattice sieving
- The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction
- Representation and coding of signal geometry
- Time for dithering: fast and quantized random embeddings via the restricted isometry property
- Some approaches to analogical mapping with structure-sensitive distributed representations
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
- Improving Random Projections Using Marginal Information
- Locality-sensitive hashing scheme based on p-stable distributions
- Bottom-k and priority sampling, set similarity and subset sums with minimal independence
- Encyclopedia of Distances
This page was built for publication: Binary vectors for fast distance and similarity estimation
