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.
Data Mining: Count-Min Sketch and Count Sketch Algorithms - Spring 2023
Overview
Syllabus
Recording starts
Count-Min Sketch example
References: Which algorithm to use?
Count-Min Sketch space
Misra-Gries vs. Count-Min Sketch
Count Sketch
Lecture ends
Taught by
UofU Data Science
Related Courses
-
Data Mining: Sketch Algorithms and Count-Min Sketch Analysis - Spring 2023
-
Data Mining: Streaming Algorithms and the Misra-Gries Algorithm - Spring 2023
-
Data Mining: Frequent Directions and Random Projections - Spring 2023
-
Count-min Sketch to Infinity - Using Probabilistic Data Structures to Solve Counting Problems in .NET
-
Data Mining: Choosing k for MinHashing - Spring 2023
-
Min Hashing in Data Mining - Spring 2023
