Useful Links
Computer Science
Algorithms and Data Structures
Probabilistic Programming and Data Structures
1. Foundational Concepts in Probability and Statistics
2. Probabilistic Programming Foundations
3. Inference Algorithms for Probabilistic Programming
4. Probabilistic Programming Languages and Tools
5. Model Development and Validation
6. Probabilistic Data Structures Theory
7. Membership and Set Operations
8. Cardinality Estimation
9. Frequency Estimation and Heavy Hitters
10. Similarity and Distance Estimation
11. Advanced Probabilistic Data Structures
12. Integration and System Design
13. Applications and Case Studies
Frequency Estimation and Heavy Hitters
Problem Definition
Heavy Hitters Problem
Frequency Estimation
Top-K Queries
Streaming Constraints
Count-Min Sketch
Data Structure Design
Two-Dimensional Counter Array
Hash Function Family
Operations
Update Procedure
Point Query
Range Query
Error Analysis
Overestimation Bounds
Probability Guarantees
Parameter Selection
Extensions
Count-Min-Log Sketch
Conservative Update
Merging Sketches
Count Sketch
Signed Hash Functions
Median Estimation
Frequency Recovery
Comparison with Count-Min
Misra-Gries Algorithm
Counter Management
Decrement Strategy
Frequency Guarantees
Space Complexity
Space-Saving Algorithm
Stream-Summary Structure
Counter Replacement
Error Bounds
Implementation Details
Lossy Counting
Bucket-Based Approach
Error Parameter
Support Threshold
Memory Management
Previous
8. Cardinality Estimation
Go to top
Next
10. Similarity and Distance Estimation