首页> 外文期刊>IEEE Transactions on Neural Networks >Support vector machines for spam categorization
【24h】

Support vector machines for spam categorization

机译:支持向量机用于垃圾邮件分类

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

We study the use of support vector machines (SVM) in classifying e-mail as spam or nonspam by comparing it to three other classification algorithms: Ripper, Rocchio, and boosting decision trees. These four algorithms were tested on two different data sets: one data set where the number of features were constrained to the 1000 best features and another data set where the dimensionality was over 7000. SVM performed best when using binary features. For both data sets, boosting trees and SVM had acceptable test performance in terms of accuracy and speed. However, SVM had significantly less training time.
机译:通过与其他三种分类算法(Ripper,Rocchio和增强决策树)进行比较,我们研究了使用支持向量机(SVM)将电子邮件分类为垃圾邮件或非垃圾邮件。这四种算法在两个不同的数据集上进行了测试:一个数据集将要素数量限制为1000个最佳特征,而另一个数据集将维数限制为7000以上。使用二进制特征时,SVM的性能最佳。对于这两个数据集,增强树和SVM在准确性和速度方面都具有可接受的测试性能。但是,SVM的培训时间明显减少。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号