Understanding Probabilistic Data Structures with 112,092 UFO Sightings
summary
112,092 UFO reports become a concrete data set for explaining what probabilistic structures actually do: a Bloom Filter that checks membership (one-sided false positives), a MinHash pipeline that converts shingled trigrams into compact similarity signatures, and a Top-K heavy keeper + min-heap fed from a Python CSV pipeline and a small Flask GUI to surface the most common words. Implementation uses Redis/RedisBloom; demo runs, finds “light(s)” as top terms, and shows trade-offs: tiny memory, fast ops, and controllable false-positive or erosive-count behavior.
AI-written summary · about
chapters (8)
- 0:00Introduction and context
- 3:17UFO data and analysis
- 7:59Hash tables and foundations
- 15:44The accuracy trade-off
- 20:46Probabilistic data types
- 27:40Bloom filter mechanics
- 38:15Document similarity (MinHash)
- 43:23Top K and conclusion
related talks
59mUnderstanding Probabilistic Data Structures with 112,092 UFO Sightings
55mUnderstanding Probabilistic Data Structures with 112,092 UFO Sightings
47mUnderstanding Probabilistic Data Structures with 112,092 UFO Sightings
52mUnderstanding Probabilistic Data Structures with 112,092 UFO Sightings
26mNo, Maybe and Close Enough: Using Probabilistic Data Structures in Python
48mProbabilistic data structures
39mAcceptably Inaccurate: Probabilistic Data Structures #bbuzz
26mNo, Maybe and Close Enough! Probabilistic Data Structures with Python and Redis