---
title: Sparse binary polynomial hashing
slug: sparse-binary-polynomial-hashing
qid: 
snapshot: enwiki-001376796725
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1376796725
tags: [10363138, 23468805, 23603337, 26220375, 27179372, 28807811]
---

# Sparse binary polynomial hashing

> [!note] Provenance
> Snapshot `enwiki-001376796725` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1376796725> · Licensed CC BY-SA 4.0

Sparse binary polynomial hashing (SBPH) is a generalization of Bayesian spam filtering that can match mutating phrases as well as single words. SBPH is a way of generating a large number of features from an incoming text automatically, and then using statistics to determine the weights for each of those features in terms of their predictive values for spam/nonspam evaluation.

Sparse binary polynomial hashing (SBPH) is a generalization of Bayesian spam filtering that can match mutating phrases as well as single words. SBPH is a way of generating a large number of features from an incoming text automatically, and then using statistics to determine the weights for each of those features in terms of their predictive values for spam/nonspam evaluation.
