.png){kind=icon}
.png){kind=icon}
Return
A new feature selection algorithm based on binomial hypothesis testing for spam filtering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2011.04.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Content-based spam filtering is a binary text categorization problem. To improve the performance of the spam filtering, feature selection, as an important and indispensable means of text categorization, also plays an important role in spam filtering. We proposed a new method, named Bi-Test, which utilizes binomial hypothesis testing to estimate whether the probability of a feature belonging to the spam satisfies a given threshold or not. We have evaluated Bi-Test on six benchmark spam corpora (pu1, pu2, pu3, pua, lingspam and CSDMC2010), using two classification algorithms, Naive Bayes (NB) and Support Vector Machines (SVM), and compared it with four famous feature selection algorithms (information gain, chi(2)-statistic, improved Gini index and Poisson distribution). The experiments show that Bi-Test performs significantly better than chi(2)-statistic and Poisson distribution, and produces comparable performance with information gain and improved Gini index in terms of F1 measure when Naive Bayes classifier is used; it achieves comparable performance with the other methods when SVM classifier is used. Moreover, Bi-Test executes faster than the other four algorithms. (C) 2011 Elsevier B.V. All rights reserved.
Keywords:
Feature selection
Binomial hypothesis testing
Spam filtering
Text categorization
Binomial distribution
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.