A Heuristic Reputation Based System to Detect Spam Activities in a Social Networking Platform, HRSSSNP

Manoj Rameshchandra Thakur, Sugata Sanyal

Computer Science Department, Veermata Jijabai Technological Institute, Mumbai, India.
Corporate Technology Office, Tata Consultancy Services, Mumbai, India.

DOI: 10.4236/sn.2013.21005                

Abstract

The introduction of the social networking platform has drastically affected the way individuals interact. Even though most of the effects have been positive, there exist some serious threats associated with the interactions on a social networking website. A considerable proportion of the crimes that occur are initiated through a social networking platform [1]. Almost 33% of the crimes on the internet are initiated through a social networking website [1]. Moreover activities like spam messages create unnecessary traffic and might affect the user base of a social networking platform. As a result preventing interactions with malicious intent and spam activities becomes crucial. This work attempts to detect the same in a social networking platform by considering a social network as a weighted graph wherein each node, which represents an individual in the social network, stores activities of other nodes with respect to itself in an optimized format which is referred to as localized data set. The weights associated with the edges in the graph represent the trust relationship between profiles. The weights of the edges along with the localized data set are used to infer whether nodes in the social network are compromised and are performing spam or malicious activities.

Keywords

Spam; Social Graph; Collaborative Filtering; Weighted Graph; Localized Data-Set; Trust Level

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	Social Networking Statistics, URL (last checked 14 Dec 2012) http://www.internetsafety101.org/Socialnetworkingstats.htm.
[2]	E. F. Walter, S. Battiston and F. Schweitzer, “Persona- lized and Dynamic Trust in Social Networks,” Proceed- ings of The Third ACM Conference on Recommender Systems, Association for Computing Machinery, New York, pp. 197-204.
[3]	E. F. Walter, S. Battiston and F. Schweitzer, “A Model of a Trust-Based Recommendation System on a Social Network,” Autonomous Agents and Multi-Agent Systems, Vol. 16, No. 1, 2008, pp. 57-74. doi:10.1007/s10458-007-9021-x
[4]	Uniform Resource Locator, “Weighted Graphs.” (last checked 02 Dec 2012) http://courses.cs.vt.edu/~cs3114/Fall10/Notes/T22.WeightedGraphs.pdf.
[5]	A. K. Trivedi, R. Arora, R. Kapoor, Sudip Sanyal and Su- gata Sanyal, “A Semi-Distributed Reputation-Based In- trusion Detection System for Mobile Ad hoc Networks,” Journal of Information Assurance and Security, Vol. 1, No. 4, 2006, pp. 265-274.
[6]	A. K. Trivedi, R. Kapoor, R. Arora, Sudip Sanyal and Sugata Sanyal, “RISM—Reputation Based Intrusion Detection System for Mobile Ad hoc Networks,” Third International Conference on Computers and Devices for Communications, Institute of Radio Physics and Electronics, University of Calcutta, Kolkata, 18-20 December 2006, pp. 234-237.
[7]	P. A. Chirita, J. Diederich and W. Nejdl, “MailRank: Using Ranking for Spam Detection,” Proceedings of the 14th ACM international conference on Information and Knowledge Management, Bremen, 31 October-5 Novem- ber 2005.
[8]	J. Golbeck and J. Hendler, “Reputation Network Analysis for Email Filtering,” Proceedings of the 1st Conference on Email and Anti-Spam, Mountain View, 2004.
[9]	B. Markines, C. Cattuto and F. Menczer, “Social Spam Detection,” Proceedings of the 5th International Work- shop on Adversarial Information Retrieval on the Web, Madrid, 21-21 April 2009. doi:10.1145/1531914.1531924
[10]	H. Y. Lam and D. Y. Yeung, “A Learning Approach to Spam Detection based on Social Networks,” Proceedings of the Fourth Conference on Email and Anti-Spam, Mountain View, 2007.
[11]	R. Bhadauria and S. Sanyal, “Survey on Security Issues in Cloud Computing and Associated Mitigation Tech- niques,” International Journal of Computer Applications, Vol. 47, No. 18, Foundation of Computer Science, New York, 2012, pp. 47-66. doi:10.5120/7292-0578
[12]	R. A. Vasudevan, A. Abraham, S. Sanyal and D. P. Agra- wal, “Jigsaw-Based Secure Data Transfer over Computer Networks,” IEEE International Conference on Informa- tion Technology: Coding and Computing, Las Vegas, Vol. 1, 2004, pp. 2-6.
[13]	A. Abraham, R. Jain, S. Sanyal and S. Y. Han, “SCIDS: A Soft Computing Intrusion Detection System,” In: A. Sen, et al., Eds., 6th International Workshop on Distri- buted Computing, Lecture Notes in Computer Science, Vol. 3326, Springer Verlag, Berlin, pp. 252-257.
[14]	S. Sanyal, D. Gada, R. Gogri, P. Rathod, Z. Dedhia and N. Mody, “Security Scheme for Distributed DoS in Mobile Ad Hoc Networks,” Technical Report, School of Tech- nology & Computer Science, Tata Institute Of Funda- mental Research 2004.
[15]	S. Pal, S. Khatua, N. Chaki and S. Sanyal, “A New Trust- ed and Collaborative Agent Based Approach for Ensuring Cloud Security,” Annals of Faculty Engineering Hune- doara International Journal of Engineering, Vol. 10, No. 1, 2012, pp. 71-78.
[16]	P. Rathod, N. Mody, D. G., Rajat G., Z. Dedhia, S. San- yal and A. Abraham, “Security Scheme for Malicious Node Detection in Mobile Ad Hoc Networks,” In: A. Sen et al., Eds., 6th International Workshop on Distributed Computing, Lecture Notes in Computer Science, Vol. 3326, Springer Verlag, Berlin, 2004, pp. 541-542.
[17]	Uniform Resource Locator, “Social Graph.” (last checked on 11 Dec 2012) http://en.wikipedia.org/wiki/Social_graph.
[18]	Uniform Resource Locator, “Recommender System.” (last checked 10 Dec 2012) http://en.wikipedia.org/wiki/Recommender_system.
[19]	V. Goyal, V. Kumar, M. Singh, A. Abraham and S. Sanyal, “CompChall: Addressing Password Guessing Attacks,” IEEE International Conference on In- formation Technology: Coding and Computing, Vol. 1, 4-6 April 2005, pp 739-744.