Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it Learn about Count-Min Sketch and Count Sketch algorithms in this university lecture from the University of Utah's Data Science program. Explore a detailed example of Count-Min Sketch implementation, understand space complexity considerations, and compare it with the Misra-Gries algorithm. Discover practical guidance on algorithm selection for different use cases, with the lecture concluding with an in-depth examination of the Count Sketch algorithm and its applications in data mining.