Random Forest Classifier to find items for sale on instagram
Data Pipelines and Sketchy Data Structures for Sub-Linear Retrievals
Rock Paper Scissors game but the machine can learn, hence, it is about machine learning
PDI Project
BloomFilter is a space efficient storage of sets at the cost of a small overall error probability while maintaining scalability.
An abstraction layer around implementations of probabilistic membership testing
This project aims to provide an unsupervised lightweight solution to estimate the count of various different category of Vehicles. By implementing a novel Locality Sensitive Hashing based sketch.
Bloom filter library written in Python
This is an ensemble based spam detection web-application that uses probablistic data-structures based on the paper: A. Singh, S. Batra, Ensemble based spam detection in social IoT using probabilistic data structures, Future Generation Computer Systems (2017), https://doi.org/10.1016/j.future.2017.09.072.
Approximate Privacy-Preserving Neighbourhood Estimations
Bloom Filter in Python using Murmurhash3
Attempt to build a Bloom Filter implementation using a Pimoroni Unicorn Hat on a Raspberry Pi that talks the RESP protocol.
Visual Bloom Filter Project, High Definition! Unicorn Hat HD, Raspberry Pi, Python 3, Flask, Bulma.
Vanilla python implementation of the K- Heavy Hitters algorithm (data-structure)
UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting
Exploring Probabilistic Data Structures in Python - my 2021 Pycon USA and Australia and Pycon MEA 2022 talk.
Probabilistic Data Structures and Algorithms in Python
Add a description, image, and links to the probabilistic-data-structures topic page so that developers can more easily learn about it.
To associate your repository with the probabilistic-data-structures topic, visit your repo's landing page and select "manage topics."