›› 2012, Vol. 27 ›› Issue (3): 506-514.doi: 10.1007/s11390-012-1239-7

Special Issue: Data Management and Data Mining

• Special Issue on Social Network Mining • Previous Articles     Next Articles

Spam Short Messages Detection via Mining Social Networks

Jian-Yun Liu1 (刘建芸), Yu-Hang Zhao1 (赵宇航), Member, CCF, Zhao-Xiang Zhang1 (张兆翔), Member, CCF, ACM, IEEE, Yun-Hong Wang1 (王蕴红), Member, CCF, ACM, IEEE, Xue-Mei Yuan2 (袁雪梅), Lei Hu2 (胡磊), Member, CCF, and Zhen-Jiang Dong2 (董振江)   

  1. 1. School of Computer Science and Engineering, Beihang University, Beijing 100191, China;
    2. ZTE Corporation, Nanjing 210012, China
  • Received:2011-12-31 Revised:2012-03-13 Online:2012-05-05 Published:2012-05-05
  • About author:Jian-Yun Liu received the B.E. degree from China University of Geo-sciences in 2009. He is now pursu-ing the M.S. degree in the Labora-tory of Intelligent Recognition and Image Processing at Beihang Univer-sity. His research interests include data mining, video analysis and pat-tern recognition.
  • Supported by:

    This work is supported by the National Natural Science Foundation of China under Grant No. 60873158, the National Basic Research 973 Program of China under Grant No. 2010CB327902, the Fundamental Research Funds for the Central Universities of China, and the Opening Funding of the State Key Laboratory of Virtual Reality Technology and Systems of China.

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] Hidalgo J M G, Bringas G C, Sanz E P, Garcia F C. Contentbased SMS spam filtering. In Proc. the 2006 ACM Symposiumon Document Engineering, Amsterdam, Netherlands,Oct. 10-13, 2006, pp.107-114.

[2] http://www.isc.org.cn/zxzx/xhdt/listinfo-1532.html.

[3] Boykin P O, Roychowdhury V P. Leveraging social networksto fight spam. Computer, April 2005, 38(4): 61-68.

[4] Yoo S, Yang Y, Lin F, Moon I. Mining social networks forpersonalized email prioritization. In Proc. the 15th ACMSIGKDD, Paris, France, June 28-July 1, 2009, pp.967-976.

[5] Gomes L H, Almeida R B, Bettencourt L M A, Almeida V,Almeida J M. Comparative graph theoretical characterizationof networks of spam and legitimate email. In Proc. Conf.Email and Anti-Spam, California, CA, USA, July 21-22, 2005.

[6] Newman M E J. Modularity and community structure innetworks. Proceedings of National Academy of Sciences ofU.S.A., May 2006, 103(23): 8577-8582.

[7] Goldberg A V. Finding a maximum density subgraph. Tech-nical Report, Uni. California, Berkeley, 1984. http://www.eecs.berkeley.edu/Pubs/TechRpts/1984/CSD-84-171.pdf.

[8] Grandoni F. A note on the complexity of minimum dominat-ing set. J. Discrete Algorithms, June 2006, 4(2): 209-214.

[9] Edmonds J. Paths, trees, and flowers. Canadian Journal ofMathematics, 1965, 17(3): 449-467.

[10] Knuth D. Dancing links. Millennial Perspectives in ComputerScience, Nov. 2000: 187-214.

[11] Almeida V, Bestavros A, Crovella M, de Oliveira A. Chara-cterizing reference locality in the WWW. In Proc. the 4th Int.Conf. Parallel and Distributed Information Systems, MiamiBeach, USA, Dec. 18-20, 1996, pp.92-103.
No related articles found!
Full text



[1] Ju-Hum Kwon, Chee-Yang Song, Chang-Joo Moon, and Doo-Kwon Baik. Bridging Real World Semantics to Model World Semantics for Taxonomy Based Knowledge Representation System[J]. , 2005, 20(3): 296 -308 .
[2] Bo Yan, You-Xing Qu, Feng-Lou Mao, Victor N. Olman, and Ying Xu. PRIME: A Mass Spectrum Data Mining Tool for De Novo Sequencing and PTMs Identification[J]. , 2005, 20(4): 483 -490 .
[3] Li-Guo Yu and Srini Ramaswamy. Component Dependency in Object-Oriented Software[J]. , 2007, 22(3): 379 -386 .
[4] Ji-Gang Wu, Thambipillai Srikanthan, and Guang-Wei Zou. New Model and Algorithm for Hardware/Software Partitioning[J]. , 2008, 23(4 ): 644 -651 .
[5] Belal Al-Khateeb and Graham Kendall, Senior Member, IEEE. Effect of Look-Ahead Depth in Evolutionary Checkers[J]. , 2012, 27(5): 996 -1006 .
[6] Ren-Jie He and Zhen-Yu Yang, Member, CCF, ACM, IEEE. Differential Evolution with Adaptive Mutation and Parameter Control Using Lévy Probability Distribution[J]. , 2012, 27(5): 1035 -1055 .
[7] Jie Tang, Chen Liu, Shao-Shan Liu, Zhi-Min Gu, and Jean-Luc Gaudiot. Pinned OS/Services: A Case Study of XML Parsing on Intel SCC[J]. , 2013, 28(1): 3 -13 .
[8] Chong Cao, Hai-Zhou Ai. Facial similarity learning with humans in the loop[J]. , 2015, 30(3): 499 -510 .
[9] Huai-Yu Wan, Zhi-Wei Wang You-Fang Lin, Xu-Guang Jia, Yuan-Wei Zhou. Discovering Family Groups in Passenger Social Networks[J]. , 2015, 30(5): 1141 -1153 .
[10] Fan-Fu Zhou, Ru-Hui Ma, Jian Li, Li-Xia Chen, Wei-Dong Qiu, Hai-Bing Guan. Optimizations for High Performance Network Virtualization[J]. , 2016, 31(1): 107 -116 .

ISSN 1000-9000(Print)

CN 11-2296/TP

Editorial Board
Author Guidelines
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
E-mail: jcst@ict.ac.cn
  Copyright ©2015 JCST, All Rights Reserved