.png){kind=icon}
返回
Using evolutionary computation for discovering spam patterns from e-mail samples
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ipm.2017.12.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
One of the most relevant problems affecting the efficient use of e-mail to communicate worldwide is the spam phenomenon. Spamming involves flooding Internet with undesired messages aimed to promote illegal or low value products and services. Beyond the existence of different well-known machine learning techniques, collaborative schemes and other complementary approaches, some popular anti-spam frameworks such as SpamAssassin or Wirebrush4SPAM enabled the possibility of using regular expressions to effectively improve filter performance. In this work, we provide a review of existing proposals to automatically generate fully functional regular expressions from any input dataset combining spam and ham messages. Due to configuration difficulties and the low performance achieved by analysed schemes, in this work we introduce DiscoverRegex, a novel automatic spam pattern-finding tool. Patterns generated DiscoverRegex outperform those created by existing approaches (able to avoid FP errors) whilst minimising the computational resources required for its proper operation. DiscoverRegex source code is publicly available at https://github.com/sing-group/DiscoverRegex.
Keyword:
Genetic programing
Regular expressions
Automatic generation
E-mail
Spam filtering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
6.9
论文数:
5.2K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
分享收藏
Rough sets for spam filtering: Selecting appropriate decision rules for boundary e-mail classification垃圾邮件过滤的粗糙集: 为边界电子邮件分类选择适当的决策规则
PREAI
分享收藏分享收藏
查看更多内容