Learn about sketch algorithms in data mining through a comprehensive lecture that covers essential topics including Misra-Gries examples, sketch algorithm intuition and analysis, and the Count-min sketch algorithm. Explore detailed explanations and demonstrations of these fundamental data mining concepts, with particular emphasis on practical applications and theoretical foundations. Gain insights into how these algorithms efficiently process and analyze large datasets while maintaining accuracy and performance.
Data Mining: Sketch Algorithms and Count-Min Sketch Analysis - Spring 2023
Overview
Syllabus
Recording starts
Mid-term exam announcements
Misra-Gries example
A sketch algorithm intuition
A sketch algorithm analysis
Count-min sketch algorithm intro, analysis
Count-min sketch algorithm final
Lecture end
Taught by
UofU Data Science
Related Courses
-
Data Mining: Count-Min Sketch and Count Sketch Algorithms - 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
-
Sketching Algorithms: Making Sense of Big Data in a Single Stroke
-
Distance Metric Learning and Outlier Detection in Data Mining - Spring 2023
