Sparse binary polynomial hashing - Revision history

JJMC89 bot III: Merging :Category:Spam filtering to :Category:Anti-spam per Wikipedia:Categories for discussion/Log/2024 May 3#Category:Spam filtering

2024-05-18T06:57:13Z

Merging Category:Spam filtering to Category:Anti-spam per Wikipedia:Categories for discussion/Log/2024 May 3#Category:Spam filtering

← Previous revision		Revision as of 06:57, 18 May 2024
Line 8:		Line 8:

	[[Category:Bayesian statistics]]		[[Category:Bayesian statistics]]
	[[Category:~~Spam filtering~~]]		[[Category:Anti-spam]]

Citation bot: Altered url. URLs might have been anonymized. Add: publisher, date, title, isbn. | Use this bot. Report bugs. | Suggested by Pppery | #UCB_webform

2024-05-02T23:57:00Z

Altered url. URLs might have been anonymized. Add: publisher, date, title, isbn. | Use this bot. Report bugs. | Suggested by Pppery | #UCB_webform

← Previous revision		Revision as of 23:57, 2 May 2024
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}}		* {{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 }}

	[[Category:Bayesian statistics]]		[[Category:Bayesian statistics]]

Pppery: Cite

2024-05-02T23:56:49Z

Cite

← Previous revision		Revision as of 23:56, 2 May 2024
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]]

Rogermx: Added links

2021-07-20T15:21:47Z

Added links

← Previous revision		Revision as of 15:21, 20 July 2021
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 ==		== External links ==

Elinruby: Wl

2021-03-01T03:45:46Z

← Previous revision		Revision as of 03:45, 1 March 2021
Line 1:		Line 1:
	{{Underlinked\|date=February 2019}}		{{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 [[spamming\|spam]]/nonspam evaluation.

	== External links ==		== External links ==

Wikiacc: unwarranted removal of maintenance template

2021-01-20T01:27:21Z

unwarranted removal of maintenance template

← Previous revision		Revision as of 01:27, 20 January 2021
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.

!matt5454!matt at 01:29, 16 November 2020

2020-11-16T01:29:18Z

← Previous revision		Revision as of 01:29, 16 November 2020
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.

I dream of horses: standard AWB cleanup, added underlinked tag

2019-02-04T04:19:56Z

standard AWB cleanup, added underlinked tag

← Previous revision		Revision as of 04:19, 4 February 2019
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}}

Bryanrutherford0: Disambiguating wikilink

2015-12-18T15:12:19Z

Disambiguating wikilink

← Previous revision		Revision as of 15:12, 18 December 2015
Line 1:		Line 1:
	'''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.		'''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 ==		== External links ==

Sdaug: corrected link

2009-11-16T21:37:08Z

corrected link

← Previous revision		Revision as of 21:37, 16 November 2009
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]]