This HTML5 document contains 24 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n5https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
n16http://crm114.sourceforge.net/docs/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:List_of_statistics_articles
dbo:wikiPageWikiLink
dbr:Sparse_binary_polynomial_hashing
Subject Item
dbr:Sparse_binary_polynomial_hashing
rdfs:label
Sparse binary polynomial hashing
rdfs:comment
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.
dcterms:subject
dbc:Bayesian_statistics dbc:Spam_filtering
dbo:wikiPageID
1075915
dbo:wikiPageRevisionID
1034558348
dbo:wikiPageWikiLink
dbr:Bayesian_spam_filtering dbc:Bayesian_statistics dbc:Spam_filtering dbr:Spamming dbr:Text_messaging dbr:Statistics
dbo:wikiPageExternalLink
n16:CRM114_paper.html
owl:sameAs
n5:4vs7b freebase:m.043tk1 wikidata:Q7573788
dbp:wikiPageUsesTemplate
dbt:Statistics-stub
dbo:abstract
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.
gold:hypernym
dbr:Generalization
prov:wasDerivedFrom
wikipedia-en:Sparse_binary_polynomial_hashing?oldid=1034558348&ns=0
dbo:wikiPageLength
704
foaf:isPrimaryTopicOf
wikipedia-en:Sparse_binary_polynomial_hashing
Subject Item
wikipedia-en:Sparse_binary_polynomial_hashing
foaf:primaryTopic
dbr:Sparse_binary_polynomial_hashing