Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/Sparse_binary_polynomial_hashing> ?p ?o }
Showing triples 1 to 14 of
14
with 100 triples per page.
- Sparse_binary_polynomial_hashing abstract "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 wikiPageExternalLink CRM114_paper.html.
- Sparse_binary_polynomial_hashing wikiPageID "1075915".
- Sparse_binary_polynomial_hashing wikiPageRevisionID "326228657".
- Sparse_binary_polynomial_hashing hasPhotoCollection Sparse_binary_polynomial_hashing.
- Sparse_binary_polynomial_hashing subject Category:Bayesian_statistics.
- Sparse_binary_polynomial_hashing subject Category:Spam_filtering.
- Sparse_binary_polynomial_hashing comment "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 label "Sparse binary polynomial hashing".
- Sparse_binary_polynomial_hashing sameAs m.043tk1.
- Sparse_binary_polynomial_hashing sameAs Q7573788.
- Sparse_binary_polynomial_hashing sameAs Q7573788.
- Sparse_binary_polynomial_hashing wasDerivedFrom Sparse_binary_polynomial_hashing?oldid=326228657.
- Sparse_binary_polynomial_hashing isPrimaryTopicOf Sparse_binary_polynomial_hashing.