Bloom Filter Encoding for Machine Learning
Not on the map. Why?
Abstract (arXiv)
We present a method that uses a Bloom filter transform to preprocess data for machine learning. Each sample is encoded into a compact bit-array representation using hash-based encoding, producing a fixed-length feature space that reduces memory usage and obfuscates original feature values. The encoding does not rely on keyed hashing; however, a key can optionally be used to control the mapping and would be required to reproduce the representation. We evaluate the approach on six datasets spanning text, time-series, tabular, and image domains: SMS Spam Collection, ECG200, Adult 50K, CDC Diabetes, MNIST, and Fashion MNIST. Four classifiers are considered: Extreme Gradient Boosting, Deep Neural Networks, Convolutional Neural Networks, and Logistic Regression. Results show that models trained on Bloom filter encodings achieve performance comparable to models trained on raw data or standard dimensionality reduction techniques across several datasets, while providing consistent memory savings. These findings suggest that Bloom filter encodings can serve as an efficient, general-purpose pre-processing representation that preserves useful similarity structure for learning tasks while providing a degree of data obfuscation.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 5 of its 27 references that are in the map. First posted on arXiv 23 Dec 2025.
Builds on
5 of 27 references.
References · 5
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2017Sampling and Reconstruction Using Bloom Filterscited by 2
- 2021RobustBF: A High Accuracy and Memory Efficient 2D Bloom Filtercited by 1
- 2023Invertible Bloom Lookup Tables with Less Memory and Randomnesscited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.