Boyer-Moore majority vote algorithm and Misra-Gries Summary for finding frequent elements, explained (Python code included).
-
Updated
Dec 20, 2023
#
misra-gries
Here are 6 public repositories matching this topic...
Implementation of streaming algorithms (Misra-Gries & Lossy Counting) for getting frequent items from data streams.
-
Updated
Feb 17, 2024 - Python
Misra-Gries algorithm for frequent pattern mining.
-
Updated
Dec 29, 2021 - Jupyter Notebook
A scalable and efficient real-time IP anomaly detection system leveraging Bloom Filters and the Misra-Gries Algorithm to identify malicious traffic, detect heavy hitters, and dynamically update blacklists with minimal memory usage
python algorithm big-data bloom-filter network-security heavy-hitters memory-optimization ip-address-tracker misra-gries probabilistic-datastructure
-
Updated
Jan 28, 2025 - Jupyter Notebook
Misra-Gries is a Heavy Hitters Streaming Algorithm used to Find Frequent Elements in a Massive Dataset using Very Little Memory
-
Updated
Dec 23, 2025 - Rust
Repository for implementation details for Data-Science
cms data-science greedy optimal cs count-min-sketch low-rank-approximation visualizing-data count-sketch countmin k-centers misra-gries-sketch misra-gries
-
Updated
May 14, 2021 - Jupyter Notebook
Improve this page
Add a description, image, and links to the misra-gries topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the misra-gries topic, visit your repo's landing page and select "manage topics."