Complex Network Based SMS Filtering Algorithm
Authors:
- Wen-Liang HuangWHWen-Liang Huang
- Yong LiuYLYong Liu
- Zhi-Qiang ZhongZZZhi-Qiang Zhong
- Zhong-Ming ShenZSZhong-Ming Shen
- 7 August 2009
- journal article
- Published by China Science Publishing & Media Ltd. in Acta Automatica Sinica
- Vol. 35 (7) , 990-996
Abstract
It is very important to recognize and filter the spam short messages(SMS).As the contents and formats of spam messages are diverse,the ordinary filtering methods based on keyword matching and sending speed can not tackle this problem effectively.This paper first presents a formalized representation of the SMS network.On the basis of real short message samples,the social characteristics of the SMS network are analyzed and studied.Further analysis and statistical work are carried out to discover the un-normal patterns of spam senders in SMS network.An N-degree association spam filter algorithm(NASFA)based on the un-normal patterns of spam senders is presented.Experiments and analysis show that the algorithm can effciently recognize spam senders,and the wrong recognition rate is reduced significantly.Keywords
This publication has 8 references indexed in Scilit:
- Distribution of infected mass in disease spreading in scale-free networksPhysica A: Statistical Mechanics and its Applications, 2003
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Navigation in a small worldNature, 2000
- Emergence of Scaling in Random NetworksScience, 1999
- Collective dynamics of ‘small-world’ networksNature, 1998
- Stretched exponential distributions in nature and economy: “fat tails” with characteristic scalesThe European Physical Journal B, 1998
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959