Sparse binary polynomial hashing: Difference between revisions

Content deleted Content added

Inline

Revision as of 15:21, 20 July 2021

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.

External links

A paper on the subject as it relates to spam (some article text comes from this document, which is under the GFDL)

This statistics-related article is a stub. You can help Wikipedia by expanding it.

@@ Line 1: / Line 1: @@
+'''Sparse binary polynomial hashing''' (SBPH) is a generalization of [[Bayesian spam filtering]] that can match mutating phrases as well as single words.
-{{Underlinked|date=February 2019}}
-'''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 [[spamming|spam]]/nonspam evaluation.
+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 ==