Binary vectors for fast distance and similarity estimation (Q2362826): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Pegasos / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SoftDoubleMaxMinOver / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10559-017-9914-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2581602397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-valued embeddings and sketches for fast distance and similarity estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Lipschitz mappings into a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On variants of the Johnson–Lindenstrauss lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sketching and Embedding are Equivalent for Norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious string embeddings and edit distance approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearest-neighbor-preserving embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Similarity estimation techniques from rounding algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Random Projections Using Marginal Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4558470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized projective methods for the construction of binary sparse vector representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of vectors similarity by their randomized binary projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quantized Johnson–Lindenstrauss Lemma: The Finding of Buffon’s Needle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Dimension Reduction and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimension reduction by random hyperplane tessellations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Small Approximately Min-Wise Independent Family of Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-plane training of structural SVMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic counting algorithms for data base applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast binary embeddings with Gaussian circulant matrices: improved bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sketch Algorithm for Estimating Two-Way and Multi-Way Associations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formation of similarity-reflecting binary vectors with random binary projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement of the Berry–Esseen inequality with applications to Poisson and mixed Poisson random sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pegasos: primal estimated sub-gradient solver for SVM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Machine Learning with Stochastic Gradient Descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality-sensitive hashing scheme based on p-stable distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propagation kernels: efficient graph kernels from propagated information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel methods in machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottom-k and priority sampling, set similarity and subset sums with minimal independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2755103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Support Vector Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy multilevel graph embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels and distances for structured data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-estimation framework with applications to transitive closure and reachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the k-Independence Required by Linear Probing and Minwise Independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximately Minwise Independence with Twisted Tabulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time of searching for similar binary vectors in associative memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2880988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A binding procedure for distributed binary data representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of numeric codes for the scheme of random subspaces RSC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some approaches to analogical mapping with structure-sensitive distributed representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time for dithering: fast and quantized random embeddings via the restricted isometry property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation and coding of signal geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Similarity search. The metric space approach. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in nearest neighbor searching with applications to lattice sieving / rank
 
Normal rank

Latest revision as of 02:47, 14 July 2024

scientific article
Language Label Description Also known as
English
Binary vectors for fast distance and similarity estimation
scientific article

    Statements

    Binary vectors for fast distance and similarity estimation (English)
    0 references
    0 references
    14 July 2017
    0 references
    distance
    0 references
    similarity
    0 references
    embedding
    0 references
    sketch
    0 references
    random projection
    0 references
    sampling
    0 references
    binarization
    0 references
    quantization
    0 references
    Johnson-Lindenstrauss lemma
    0 references
    kernel similarity
    0 references
    similarity search
    0 references
    locality-sensitive hashing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references