Sparse binary polynomial hashing: Difference between revisions
Content deleted Content added
Added links |
Cite |
||
| Line 5: | Line 5: | ||
== External links == |
== 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) |
* [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://www.google.com/books/edition/Ending_Spam/kqwn8KEKYOwC?hl=en&gbpv=1&dq=%22Sparse+binary+polynomial+hashing%22&pg=PA108&printsec=frontcover|page=108}} |
|||
[[Category:Bayesian statistics]] |
[[Category:Bayesian statistics]] |
||
Revision as of 23:56, 2 May 2024
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)
- . p. 108 https://www.google.com/books/edition/Ending_Spam/kqwn8KEKYOwC?hl=en&gbpv=1&dq=%22Sparse+binary+polynomial+hashing%22&pg=PA108&printsec=frontcover.
{{cite book}}: Missing or empty|title=(help)
 | This statistics-related article is a stub. You can help Wikipedia by expanding it. |