Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This talk introduces probabilistic data structures that use hashes to reduce memory use and processing time in exchange for some precision. It examines Bloom Filter, MinHash, and Top-K, then demonstrates Top-K by analyzing words in a collection of UFO sighting reports.
