A behavior-based SMS antispam system

IBM Journal of Research and Development

Volumn 54, Issue 6, 2010, Pages

  Wang, C ^a   Zhang, Y ^a   Chen, X ^a   Liu, Z ^a   Shi, L ^a   Chen, G ^a   Qiu, F ^a   Ying, C ^a   Lu, W ^a  

^a IBM CHINA RESEARCH LAB   (China)

Author keywords

Anti spam; Short message services

Indexed keywords

ANTI-SPAM; ANTI-SPAM SYSTEMS; BEHAVIOR-BASED; DAILY LIVES; HIGH PRECISION; MOBILE-PHONE USERS; OFFLINE; SCALABILITY ISSUE; SHORT MESSAGE SERVICES; SHORT MESSAGING SERVICE; SIDE EFFECT; SOCIAL NETWORKS; SPAMMERS; SYSTEM INFRASTRUCTURE; TELECOM; TELECOM OPERATORS; VALUE ADDED SERVICE;

INTERNET; TELECOMMUNICATION EQUIPMENT;

MESSAGE PASSING;

EID: 79953777209     PISSN: 00188646     EISSN: 00188646     Source Type: Journal    
DOI: 10.1147/JRD.2010.2066050     Document Type: Article

References (28)

1. G. Flake, S. Lawrence, C. Lee Giles, and F. Coetzee, "Self- organization and identification of web communities", Computer, vol. 35, no. 3, pp. 66-71, Mar. 2002. (Pubitemid 34249404)
2. J. Hopcroft, O. Khan, B. Kulis, and B. Selman, "Natural communities in large linked networks", in Proc. 9th ACM Int. Conf. SIGKDD, Washington, DC, 2003, vol. 9, pp. 541-546.
3. R. Kumar, J. Novak, and A. Tomkins, "Structure and evolution of online social networks", in Proc. 12th ACM Int. Conf. SIGKDD, Philadelphia, PA, Aug. 2006, vol. 12, pp. 611-617. (Pubitemid 44535563)
4. L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, "Group formation in large social networks: Membership, growth and evolution", in Proc. 12th ACM Int. Conf. SIGKDD, Philadelphia, PA, Aug. 2006, vol. 12, pp. 44-54. (Pubitemid 44535502)
5. A. Clauset, M. E. J. Newman, and C. Moore, "Finding community structure in very large networks", Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top., vol. 70, no. 6, pp. 066111-1-066111-6, Dec. 2004.
6. M. Girvan and M. E. J. Newman, "Community structure in social and biological networks", Proc. Nat. Acad. Sci., vol. 99, no. 12, pp. 7821-7826, 1973.
7. R. A. Hanneman and M. Riddle, Introduction to Social Network Methods. Riverside, CA: Univ. California, Riverside, 2005.
8. Y. Dourisboure, F. Geraci, and M. Pellegrini, "Extraction and classification of dense communities in the web", in Proc. 16th Int. Conf. WWW, 2007, pp. 461-470. (Pubitemid 47582275)
9. D. Gibson, J. Kleinberg, and P. Raghavan, "Inferring web communities from link topology", in Proc. 9th ACM Conf. Hypertext Hypermedia - Links, Objects, Time and Space - Structure in Hypermedia Systems, Jun. 20-24, 1998, pp. 225-234.
10. J. Abello, M. G. C. Resende, and S. Sudarsky, "Massive quasi-clique detection", in Proc. Latin Amer. Theor. Informat., 2002, pp. 598-612.
11. A. A. Nanavati, R. Singh, D. Chakraborty, K. Dasgupta, S. Mukherjea, S. Gurumurthy, G. Das, and A. Joshi, "Analyzing the structure and evolution of massive telecom graphs", IEEE Trans. Knowl. Data Eng., vol. 20, no. 5, pp. 703-718, May 2008.
12. E. Loukakis and C. Tsouros, "A depth f irst search algorithm to generate the family of maximal independent sets of a graph lexicographically", Computing, vol. 27, no. 4, pp. 349-366, 1981. (Pubitemid 12509138)
13. R. E. Osteen and J. T. Tou, "A clique-detection algorithm based on neighborhoods in graph", Int. J. Comput. Inf. Sci., vol. 2, no. 4, pp. 257-268, 1973.
14. S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa, "A new algorithm for generating all the maximal independent sets", SIAM J. Comput., vol. 6, no. 3, pp. 505-517, Sep. 1977.
15. E. A. Akkoyunlu, "The enumeration of maximal cliques of large graphs", SIAM J. Comput., vol. 2, no. 1, pp. 1-6, Mar. 1973.
16. K. Makino and T. Uno, "New algorithm for enumerating all maximal cliques", in Proc. SWAT, 2004, pp. 260-272.
17. N. Modani and K. Dey, "Large maximal cliques enumeration in large sparse graphs", in Proc. 15th Int. COMAD, Dec. 9-12, 2009, pp. 1377-1378. [Online]. Available: http://www.cse.iitb.ac.in/~comad/2009/proceedings/R3-1.pdf.
18. S. B. Seidman, "Network structure and minimum degree", Soc. Netw., vol. 5, no. 3, pp. 269-287, Sep. 1983.
19. C. R. Palmer, P. B. Gibbons, and C. Faloutsos, "ANF: A fast and scalable tool for data mining in massive graphs", in Proc. 8th ACM Int. Conf. SIGKDD, 2002, pp. 81-90.
20. R. Luce, "Connectivity and generalized cliques in sociometric group structure", Psychometrika, vol. 15, no. 2, pp. 169-190, Jun. 1950.
21. S. B. Seidman and B. L. Foster, "A graph-theoretic generalization of the clique concept", J. Math. Sociol., vol. 6, no. 1, pp. 139-154, 1978.
22. R. Alba, "A graph-theoretic definition of a sociometric clique", J. Math. Sociol., vol. 3, pp. 113-126, 1973.
23. G. D. Mulligan and D. G. Corneil, "Corrections to Bierstone's algorithm for generating cliques", J. Assoc. Comput. Mach., vol. 19, no. 2, pp. 244-247, Apr. 1972.
24. E. Tomita, A. Tanaka, and H. Takahashi, "The worst-case time complexity for generating all maximal cliques and computational experiments", Theor. Comput. Sci., vol. 363, no. 1, pp. 28-42, Oct. 2006. (Pubitemid 44486521)
25. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, "Trawling the web for emerging cyber-communities", in Proc. 8th Int. Conf. World Wide Web, 1999, pp. 1481-1493.
26. S. Dill, R. Kumar, K. McCurley, S. Rajagopalan, D. Sivakumar, and A. Tomkins, "Self-similarity in the web", in Proc. 27th Int. Conf. VLDB, 2001, pp. 69-78.
27. L. Friedland and D. Jensen, "Finding tribes: Identifying close-knit individuals from employment patterns", in Proc. 13th ACM Int. Conf. SIGKDD, Aug. 2007, pp. 290-299. (Pubitemid 350229216)
28. R. Kumar, J. Novak, P. Raghavan, and A. Tomkins, "Structure and evolution of blogspace", Commun. ACM, vol. 47, no. 12, pp. 35-39, Dec. 2004.