Editing Sparse binary polynomial hashing

'''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 messaging|text]] automatically, and then using [[statistics]] to determine the weights for each of those features in terms of their predictive values for [[spamming|spam]]/nonspam evaluation.

== External links ==
* [http://crm114.sourceforge.net/docs/CRM114_paper.html A paper on the subject as it relates to spam] (some article text comes from this document, which is under the GFDL)
* {{cite book|url=https://books.google.com/books?id=kqwn8KEKYOwC&dq=%22Sparse+binary+polynomial+hashing%22&pg=PA108|page=108|isbn=978-1-59327-052-0 |title=Ending Spam: Bayesian Content Filtering and the Art of Statistical Language Classification |date=2005 |publisher=No Starch Press }}

[[Category:Bayesian statistics]]
[[Category:Anti-spam]]


{{Statistics-stub}}