A trust-based approach for security policies enhancement in dynamic social networks

The sensitive information revealed in social networks is a real threat menacing users' privacy. Hence, trust is required to enhance the security policies in these networks. Motivated by the privacy problems in particular the danger of sexual predators and the disregard of the dynamic aspect of social networks, users popularity and activity which may affect the precision of the expected results of influential users detection, we aim to present a generic model to improve security policies. To do so, we use text mining techniques to distinguish suspicious conversations using lexical and behavioural features classification and to determine influential users having the maximum trust score value. This trust score is calculated using an algorithm called DynamicInflu inspired by the honey bee's foraging behaviour based on popularity and activity parameters. The experiments are performed on real data and the comparison of the DynamicInflu algorithm with commonly used approaches showed a good performance.

[1]  N. Pendar.  Toward Spotting the Pedophile Telling victim from predator in text chats , 2007 .

[2]  Shengchao Qin,et al.  Maximizing influence under influence loss constraint in social networks , 2016, Expert Syst. Appl..

[3]  J. C. Jiang,et al.  Finding influential agent groups in complex multiagent software systems based on citation network analyses , 2015, Adv. Eng. Softw..

[4]  Krishna P. Gummadi,et al.  Measuring User Influence in Twitter: The Million Follower Fallacy , 2010, ICWSM.

[5]  Magdalini Eirinaki,et al.  Identification of influential social networkers , 2012, Int. J. Web Based Communities.

[6]  Hugo Jair Escalante,et al.  Sexual predator detection in chats with chained classifiers , 2013, WASSA@NAACL-HLT.

[7]  Ali Moeini,et al.  A fast algorithm for finding most influential people based on the linear threshold model , 2015, Expert Syst. Appl..

[8]  Yue Zhang,et al.  BeeHive: An Efficient Fault-Tolerant Routing Algorithm Inspired by Honey Bee Behavior , 2004, ANTS Workshop.

[9]  Ming Tang,et al.  Identify influential spreaders in complex networks, the role of neighborhood , 2015, ArXiv.

[10]  Panta Lucic,et al.  Modeling Transportation Problems Using Concepts of Swarm Intelligence and Soft Computing , 2002 .

[11]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[12]  Dervis Karaboga,et al.  Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems , 2007, IFSA.

[13]  Karl O. Jones,et al.  Comparison of bees algorithm, ant colony optimisation and particle swarm optimisation for PID controller tuning , 2008, CompSysTech.

[14]  Denis Gillet,et al.  Identifying influential scholars in academic social media platforms , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[15]  Michael Trusov,et al.  Determining Influential Users in Internet Social Networks , 2010 .

[16]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[17]  Jimeng Sun,et al.  A Survey of Models and Algorithms for Social Influence Analysis , 2011, Social Network Data Analytics.

[18]  Mark S. Granovetter.  T H E S T R E N G T H O F WEAK TIES: A NETWORK THEORY REVISITED , 1983 .

[19]  Ioannis Mavridis,et al.  Utilizing document classification for grooming attack recognition , 2011, 2011 IEEE Symposium on Computers and Communications (ISCC).

[20]  Weifa Liang,et al.  Finding top-k influential users in social networks under the structural diversity model , 2016, Inf. Sci..

[21]  Bernhard Rieder,et al.  Studying Facebook via data extraction: the Netvizz application , 2013, WebSci.

[22]  Sha Yang,et al.  Modeling the Formation of Dyadic Relationships between Consumers in Online Communities , 2007 .

[23]  Mohammad Ali Abbasi,et al.  Measuring User Credibility in Social Media , 2013, SBP.

[24]  Xin-She Yang,et al.  Engineering Optimizations via Nature-Inspired Virtual Bee Algorithms , 2005, IWINAC.

[25]  Jie Tang,et al.  Influence Maximization in Dynamic Social Networks , 2013, 2013 IEEE 13th International Conference on Data Mining.

[26]  Goran Z. Markovic,et al.  Routing and wavelength assignment in all-optical networks based on the bee colony optimization , 2007, AI Commun..

[27]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[28]  John Yearwood,et al.  Detection of child exploiting chats from a mixed chat dataset as a text classification task , 2011, ALTA.

[29]  Jian Xu,et al.  Social network user influence sense-making and dynamics prediction , 2014, Expert Syst. Appl..