Comprehensive decomposition optimization method for locating key sets of commenters spreading conspiracy theory in complex social networks

With the power of social media being harnessed to coordinate events and revolutions across the globe, it is important to identify the key sets of individuals that have the power to mobilize crowds. These key sets have higher resources at their disposal and can regulate the flow of information in social networks. They can maximize information spread and influence/manipulate crowds when they are coordinating. But due to the inherent drawbacks in node-based and network-based community detection algorithms, neither of these types of algorithms can be used to detect/identify these key sets. In this study, we present a bi-level max-max optimization approach to identify these key sets, where the degree centrality is used to identify individuals’ influence at the commenter-level, while the network-level is designed to evaluate the spectral modularity values. We also present a set of evaluation metrics that can be used to rank these key sets for an in-depth investigation. We demonstrated the efficacy of the proposed model by identifying key sets hidden in a YouTube network spreading fake news about the conflict in South China Sea. The network consisted of 47,265 comments, 8477 commenters, and 5095 videos. A co-commenter network was constructed, where two commenters were linked together if they comment on same video. The proposed model efficiently identified key sets of commenters spread information to the whole network to manipulate YouTube’s recommendation and search algorithm to increase the information dissemination. Moreover, the projected approach could identify sets of commenters that were key connectors to multiple groups, high influence across the network, higher interactions, and reachability than other regular communities. Besides, the Girvan–Newman modularity method, the depth-first search method, and text analysis was applied to validate the outcomes, categorize the identified key sets, and monitor the commenters’ behaviors and information spread strategies in the network. In addition, the model considered a multi-criteria problem to rank these key sets of commenters based on the small real-world networks’ features.

[1]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[2]  H. Wu,et al.  Thermal transport through a one-dimensional quantum spin-1/2 chain heterostructure: The role of three-site spin interaction , 2012 .

[3]  Nitin Agarwal,et al.  Examining Intensive Groups in YouTube Commenter Networks , 2019, SBP-BRiMS.

[4]  Sophia Tsoka,et al.  Community Structure Detection for Directed Networks through Modularity Optimisation , 2016, Algorithms.

[5]  Yinghong Ma,et al.  A three-stage algorithm on community detection in social networks , 2020, Knowl. Based Syst..

[6]  Nitin Agarwal,et al.  Finding Fake News Key Spreaders in Complex Social Networks by Using Bi-Level Decomposition Optimization Method , 2019, Communications in Computer and Information Science.

[7]  Jie Liu,et al.  An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures , 2016, J. Comput. Appl. Math..

[8]  Reza Zafarani,et al.  Social Media Mining: An Introduction , 2014 .

[9]  Babak Teimourpour,et al.  Community detection in attributed networks considering both structural and attribute similarities: two mathematical programming approaches , 2019, Neural Computing and Applications.

[10]  Chen-Kun Tsung,et al.  A Spectral Clustering Approach Based on Modularity Maximization for Community Detection Problem , 2016, 2016 International Computer Symposium (ICS).

[11]  Nitin Agarwal,et al.  Focal structures analysis: identifying influential sets of individuals in a social network , 2016, Social Network Analysis and Mining.

[12]  Yoshitsugu Yamamoto,et al.  A CUTTING PLANE ALGORITHM FOR MODULARITY MAXIMIZATION PROBLEM , 2017 .

[13]  Xiang Li,et al.  Network Clustering via Maximizing Modularity: Approximation Algorithms and Theoretical Limits , 2015, 2015 IEEE International Conference on Data Mining.

[14]  Nitin Agarwal,et al.  Developing Graph Theoretic Techniques to Identify Amplification and Coordination Activities of Influential Sets of Users , 2020, SBP-BRiMS.

[15]  Christos Faloutsos,et al.  Patterns of Cascading Behavior in Large Blog Graphs , 2007, SDM.

[16]  Fang Hu,et al.  A new algorithm CNM-Centrality of detecting communities based on node centrality , 2016 .

[17]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[18]  Darren Scott Appling,et al.  Determining credibility from social network structure , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[19]  Christos Faloutsos,et al.  Cascading Behavior in Large Blog Graphs , 2007 .

[20]  Tao Zhou,et al.  Hierarchical Clustering Supported by Reciprocal Nearest Neighbors , 2019, Inf. Sci..

[21]  Keisuke Sato,et al.  A branch-and-price approach with MILP formulation to modularity density maximization on graphs , 2017, ArXiv.

[22]  Nitin Agarwal,et al.  Analyzing Disinformation and Crowd Manipulation Tactics on YouTube , 2018, 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[23]  D. K. R. Babajee On the Kung-Traub Conjecture for Iterative Methods for Solving Quadratic Equations , 2016, Algorithms.

[24]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[25]  Eamonn O'Neill,et al.  Feasibility of structural network clustering for group-based privacy control in social networks , 2010, SOUPS.

[26]  Yun Liu,et al.  Detecting communities in social networks using label propagation with information entropy , 2017 .

[27]  Sibel Adali,et al.  This Just In: Fake News Packs a Lot in Title, Uses Simpler, Repetitive Content in Text Body, More Similar to Satire than Real News , 2017, Proceedings of the International AAAI Conference on Web and Social Media.

[28]  Dit-Yan Yeung,et al.  A Convex Formulation of Modularity Maximization for Community Detection , 2011, IJCAI.

[29]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[30]  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.

[31]  Jon Kleinberg,et al.  Authoritative sources in a hyperlinked environment , 1999, SODA '98.

[32]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  Chao Li,et al.  Identification of influential spreaders based on classified neighbors in real-world complex networks , 2018, Appl. Math. Comput..

[34]  Konstantin Avrachenkov,et al.  Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.

[35]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[36]  Ludo Waltman,et al.  A smart local moving algorithm for large-scale modularity-based community detection , 2013, The European Physical Journal B.

[37]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[38]  Haggai Roitman,et al.  An author-reader influence model for detecting topic-based influencers in social media , 2014, HT.