Spam Short Messages Detection via Mining Social Networks

Short message service (SMS) is now becoming an indispensable way of social communication, and the problem of mobile spam is getting increasingly serious. We propose a novel approach for spam messages detection. Instead of conventional methods that focus on keywords or flow rate filtering, our system is based on mining under a more robust structure: the social network constructed with SMS. Several features, including static features, dynamic features and graph features, are proposed for describing activities of nodes in the network in various ways. Experimental results operated on real dataset prove the validity of our approach.

[1]  Virgílio A. F. Almeida,et al.  Characterizing reference locality in the WWW , 1996, Fourth International Conference on Parallel and Distributed Information Systems.

[2]  Yiming Yang,et al.  Mining social networks for personalized email prioritization , 2009, KDD.

[3]  Fabrizio Grandoni,et al.  A note on the complexity of minimum dominating set , 2006, J. Discrete Algorithms.

[4]  J. Edmonds Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[5]  P. Oscar Boykin,et al.  Leveraging social networks to fight spam , 2005, Computer.

[6]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Andrew V. Goldberg,et al.  Finding a Maximum Density Subgraph , 1984 .

[8]  Donald E. Knuth,et al.  Dancing links , 2000, cs/0011047.

[9]  Virgílio A. F. Almeida,et al.  Comparative Graph Theoretical Characterization of Networks of Spam , 2005, CEAS.

[10]  José María Gómez Hidalgo,et al.  Content based SMS spam filtering , 2006, DocEng '06.