Sparse binary polynomial hashing: Difference between revisions
Content deleted Content added
revised cats |
corrected link |
||
| Line 2: | Line 2: | ||
== External links == |
== External links == |
||
* [http://crm114.sourceforge.net/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) |
||
[[Category:Bayesian statistics]] |
[[Category:Bayesian statistics]] |
||
Revision as of 21:37, 16 November 2009
Sparse binary polynomial hashing (SBPH) is a generalization of Bayesian 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. |