Tim Head - When Close Enough is Good Enough - SPS25
Автор: Swiss Python Summit
Загружено: 2025-11-20
Просмотров: 5
Talk recorded at the Swiss Python Summit on October 16th, 2025.
Licensed as Creative Commons Attribution 4.0 International.
---------
Abstract:
Sometimes getting an approximate answer is super good enough. How do you check for duplicates, count unique users, or track item popularity when your dataset won’t fit in memory? Enter probabilistic data structures like Bloom filters, Count-Min Sketches, and HyperLogLog! This talk introduces these powerful tools, demonstrates simple implementations in Python, and gives you ideas on when to use them.
Walk away ready to apply these techniques in your own projects - no advanced math required.
---------------------
About the speaker(s):
I am a maintainer of the scikit-learn machine-learning library. In the past I've worked on building and running mybinder.org and JupyterHub.
I am employed by NVIDIA.
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
