CountMin sketch, part 3

We discuss how CountMin sketches can be merged. Then we discuss the conservative update strategy and its properties. Finally, we discuss how the creation of the CountMin sketch can be seen as a matrix-vector multiplication.
These materials are also openly available on figshare. Please cite this work; this ensures that funding agencies see the impact and importance of these open learning materials.
Langmead, Ben (2024). Sketching & randomized data structures: learning materials. figshare. Collection. doi.org/10.608...
Channel: ‪@BenLangmead‬
Playlist: • Sketching and randomiz...
More materials: www.langmead-la...

[@rohandvivedi]

I loved all your videos on probabilistic data structures.

[@brucezu574]

These 3 parts video introducing the CountMin sketch is the best I can find by far. Thank you so much for the time to make the video and share it.!!!!!!!!!!!!!!!!!!!