Sparse binary polynomial hashing: Difference between revisions
Content deleted Content added
m Disambiguating wikilink |
m standard AWB cleanup, added underlinked tag |
||
| Line 1: | Line 1: | ||
{{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 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. |
||
| Line 6: | Line 8: | ||
[[Category:Bayesian statistics]] |
[[Category:Bayesian statistics]] |
||
[[Category:Spam filtering]] |
[[Category:Spam filtering]] |
||
{{Statistics-stub}} |
{{Statistics-stub}} |
||
Revision as of 04:19, 4 February 2019
 | This article needs more links to other articles to help integrate it into the encyclopedia. (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 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. |