Spam Mail Filtering Method Based on Suffix Tree

被引:0
作者
Hu, Runqiu [1 ]
Yang, Yitao [2 ]
机构
[1] Nanjing Univ Posts & Telecommun, Sch Comp, 9 Wenyuan Rd, Nanjing, Jiangsu, Peoples R China
[2] Nanjing Forest Police Coll, Informat Technol Dept, 28 Wenlan Rd, Nanjing, Jiangsu, Peoples R China
来源
ADVANCES IN INTERNETWORKING, DATA & WEB TECHNOLOGIES, EIDWT-2017 | 2018年 / 6卷
关键词
Spam mail filtering; Suffix tree; Natural language processing; Machine learning; CONSTRUCTION;
D O I
10.1007/978-3-319-59463-7_43
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In recent years, e-mail technology is prospering, bringing efficiency to people from all over the world. It is not limited to time and space, making the transmission of information more convenient. However, the emergence of spam has also brought people a lot of trouble. Thus, spam filtering research is necessary. Traditional spam filtering is mainly based on black and white list technology. Over the past decade, with the development of machine learning, Bayesian classifier has also come into use. However, support for Chinese mail has always been unsatisfactory. This paper proposes a Chinese spam filtering method based on suffix tree, which solves the problem of Chinese character processing and compares it with traditional methods from the aspects of time and space complexity and accuracy.
引用
收藏
页码:436 / 447
页数:12
相关论文
共 9 条
[1]  
Clark J, 2003, IEEE/WIC INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE, PROCEEDINGS, P702
[2]  
Firte Loredana, 2010, Proceedings of the 2010 IEEE 6th International Conference on Intelligent Computer Communication and Processing (ICCP 2010), P27, DOI 10.1109/ICCP.2010.5606466
[3]   Spam filtering with dynamically updated URL statistics [J].
Kim, Jangbok ;
Chung, Kihyun ;
Choi, Kyunghee .
IEEE SECURITY & PRIVACY, 2007, 5 (04) :33-39
[4]   SPACE-ECONOMICAL SUFFIX TREE CONSTRUCTION ALGORITHM [J].
MCCREIGHT, EM .
JOURNAL OF THE ACM, 1976, 23 (02) :262-272
[5]   A suffix tree approach to anti-spam email filtering [J].
Pampapathi, Rajesh ;
Mirkin, Boris ;
Levene, Mark .
MACHINE LEARNING, 2006, 65 (01) :309-338
[6]  
Schneider KM, 2003, EACL 2003: 10TH CONFERENCE OF THE EUROPEAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE, P307
[7]  
Takemura T, 2008, ICDS 2008: SECOND INTERNATIONAL CONFERENCE ON THE DIGITAL SOCIETY, PROCEEDINGS, P20
[8]  
Tan Jianlong, 2007, Computer Engineering, V33, P100
[9]   ONLINE CONSTRUCTION OF SUFFIX TREES [J].
UKKONEN, E .
ALGORITHMICA, 1995, 14 (03) :249-260