Fingerprints for highly similar streams

DOI10.1016/J.IC.2015.06.001MaRDI QIDQ498399zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1947403 (Why is no real title available?)
• scientific article; zbMATH DE number 2086663 (Why is no real title available?)
• A small approximately min-wise independent family of hash functions
• Approximate sparse recovery: optimizing time and measurements
• Bottom-k and priority sampling, set similarity and subset sums with minimal independence
• Exact and Approximate Pattern Matching in the Streaming Model
• Exponential space improvement for min-wise based algorithms
• Exponential time improvement for min-wise based algorithms
• Fast moment estimation in data streams in optimal space
• Fingerprinting ratings for collaborative filtering -- theoretical and empirical analysis
• Homomorphic fingerprints under misalignments
• Improved Sketching of Hamming Distance with Error Correcting
• Min-wise independent permutations
• Pattern matching in multiple streams
• Randomized geometric algorithms and pseudorandom generators
• Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
• Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints
• Summarizing data using bottom-k sketches
• Tabulation based 4-universal hashing with applications to second moment estimation
• The frequent items problem, under polynomial decay, in the streaming model
• The space complexity of approximating the frequency moments
• Universal hashing and \(k\)-wise independent random variables via integer arithmetic without primes

Cited in

(2)

• Dimension independent similarity computation
• 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)