Sparse binary polynomial hashing: Difference between revisions
Jump to navigation
Jump to search
imported>JJMC89 bot III m Merging Category:Spam filtering to Category:Anti-spam per Wikipedia:Categories for discussion/Log/2024 May 3#Category:Spam filtering |
imported>Bender the Bot m →External links: HTTP to HTTPS for SourceForge |
||
| Line 4: | Line 4: | ||
== External links == | == External links == | ||
* [ | * [https://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 }} | * {{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 }} | ||
Latest revision as of 03:30, 11 August 2025
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)
- Script error: No such module "citation/CS1".