A structure free self-adaptive piecewise hashing algorithm for spam filtering

ICIMCS '13: Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service(2013)

引用 0|浏览3
暂无评分
摘要
Nowadays, email spam problem continues growing drastically and many spam detection algorithms have been developed at the same time. However, there are several shortcomings shared by most of these algorithms. In order to solve these shortcomings, we present a structure free Self-adaptive piecewise hashing algorithm(SFSPH) together with its super method(SFSPH-S, which is much faster than SFSPH but has lower accuracy). Both of them are based on the extremum characteristic theory, robin fingerprint algorithm and optimization theory. Then we designed several experiments to evaluate the algorithms' performance, including accuracy, speed and robustness, by comparing them with the famous DSC algorithm and the Email Remove-duplicate Algorithm Based on SHA-1(ERABS). Our extensive experiments demonstrated the good performance and accuracy of our algorithm for spam filtering.
更多
查看译文
关键词
extremum characteristic theory,robin fingerprint algorithm,spam detection algorithm,email remove-duplicate algorithm,good performance,optimization theory,famous dsc algorithm,extensive experiment,lower accuracy,structure free self-adaptive piecewise,email spam problem,optimization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要