Fingerprints for highly similar streams

DOI10.1016/J.IC.2015.06.001zbMATH Open1329.68101OpenAlexW2221439497MaRDI QIDQ498399FDOQ498399

Authors: Yoram Bachrach, Ely Porat 

Publication date: 28 September 2015

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2015.06.001

Recommendations

• scientific article; zbMATH DE number 1947403
• scientific article; zbMATH DE number 1615265
• Dimension independent similarity computation
• Set similarity search beyond MinHash
• d-k-min-wise independent family of hash functions

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• The space complexity of approximating the frequency moments
• Universal hashing and k-wise independent random variables via integer arithmetic without primes
• Fast moment estimation in data streams in optimal space
• Bottom-k and priority sampling, set similarity and subset sums with minimal independence
• A small approximately min-wise independent family of hash functions
• Exponential Space Improvement for minwise Based Algorithms
• Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
• Title not available (Why is that?)
• Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints
• Title not available (Why is that?)
• Summarizing data using bottom-k sketches
• Improved Sketching of Hamming Distance with Error Correcting
• Exact and Approximate Pattern Matching in the Streaming Model
• Approximate sparse recovery: optimizing time and measurements
• Title not available (Why is that?)
• Min-wise independent permutations
• Randomized geometric algorithms and pseudorandom generators
• Pattern Matching in Multiple Streams
• Fingerprinting ratings for collaborative filtering -- theoretical and empirical analysis
• Title not available (Why is that?)
• Homomorphic fingerprints under misalignments
• The frequent items problem, under polynomial decay, in the streaming model

Cited In (1)

• d-k-min-wise independent family of hash functions

This page was built for publication: Fingerprints for highly similar streams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498399)