[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

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

  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  • Alassad, M., Agarwal, N., Hussain, M.N.: Examining intensive groups in YouTube commenter networks. In: Proc. 12th Int. Conf. SBP-BRiMS 2019, no. 12, pp. 224–233 (2019a)

  • Alassad, M., Hussain, M.N., Agarwal, N.: Finding fake news key spreaders in complex social networks by using bi-level decomposition optimization method. In: International Conference on Modelling and Simulation of Social-Behavioural Phenomena in Creative Societies, pp. 41–54 (2019b)

  • Alassad, M., Hussain, M.N., Agarwal, N.: Developing graph theoretic techniques to identify amplification and coordination activities of influential sets of users. In: Accept. Int. Conf. Soc. Comput. Behav. Model. Predict. Behav. Represent. Model. Simul., (2020)

  • Alinezhad E, Teimourpour B, Sepehri MM, Kargari M (2020) Community detection in attributed networks considering both structural and attribute similarities: two mathematical programming approaches. Neural Comput. Appl. 32(8):3203–3220

    Article  Google Scholar 

  • Briscoe, E.J., Appling, D.S., Mappus, R.L., Hayes, H.: Determining credibility from social network structure. In: Proc. 2013 IEEE/ACM Int. Conf. Adv. Soc. Networks Anal. Min., pp. 1418–1424 (2014)

  • Chan, E.Y.K., Yeung, D.Y.: A convex formulation of modularity maximization for community detection. In: IJCAI Int. Jt. Conf. Artif. Intell., pp. 2218–2225 (2011)

  • Chen, W., Wang, Y.: Efficient influence maximization in social networks categories and subject descriptors. In: Proc. 15th ACM SIGKDD Int. Conf. Knowl. Discov. Data Min., pp. 199–207 (2009)

  • Chen N, Liu Y, Chen H, Cheng J (2017) Detecting communities in social networks using label propagation with information entropy. Phys. A Stat. Mech. Appl. 471:788–798

    Article  Google Scholar 

  • Dinh, T.N., Li, X., Thai, M.T.: Network clustering via maximizing modularity: approximation algorithms and theoretical limits. In: Proc. IEEE Int. Conf. Data Mining, ICDM, vol. 2016-Janua, pp. 101–110 (2016)

  • Girvan M, Newman MEJ (2002a) Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12):7821–7826

    Article  Google Scholar 

  • Girvan M, Newman M (2002b) Community structure in social and biological networks. PNAS 99(12):7821–7826

    Article  Google Scholar 

  • Herzig, J., Mass, Y., Roitman, H.: An author-reader influence model for detecting topic-based influencers in social media. In: Proc. 25th ACM Conf. Hypertext Soc. media, pp. 46–55 (2014)

  • Horne, B.D., Adali, S.: This just in: fake news packs a lot in title, uses simpler, repetitive content in text body, more similar to satire than real news. In: Elev. Int. AAAI Conf. Web Soc. Media, pp. 759–766 (2017)

  • Hu F, Liu Y (2016) A new algorithm CNM-Centrality of detecting communities based on node centrality. Phys. A Stat. Mech. Appl. 446:138–151

    Article  Google Scholar 

  • Hussain, M.N., Tokdemir, S., Agarwal, N., Al-Khateeb, S.: Analyzing disinformation and crowd manipulation tactics on YouTube. In: 2018 IEEE/ACM Int. Conf. Adv. Soc. Networks Anal. Min., pp. 1092–1095 (2018)

  • Izunaga Y, Yamamoto Y (2017) A cutting plane algorithm for modularity maximization problem. J. Oper. Res. Soc. Jpn. 60(1):24–42

    Google Scholar 

  • Jones, S., O’Neill, E.: Feasibility of structural network clustering for group-based privacy control in social networks. In: Proc. Sixth Symp. Usable Priv. Secur., p. 9 (2010)

  • Kleinberg JONM (1999) Authoritative sources in a hyperlinked environment. Proc. ACM-SIAM Symp. Discrete Algorithms 46(5):604–632

    Google Scholar 

  • Leskovec, J., Mcglohon, M., Faloutsos, C., Glance, N., Hurst, M.: Patterns of cascading behavior in large blog graphs. In: Proc. 2007 SIAM Int. Conf. data Min., pp. 551–556 (2007a)

  • Leskovec, J., McGlohon, M., Faloutsos, C., Glance, N., Hurst, M.: Cascading behavior in large blog graphs. In: Proceedings of the 2007 SIAM International Conference on Data Mining, pp. 551–556 (2007b)

  • Li C, Wang L, Sun S, Xia C (2018) Identification of influential spreaders based on classified neighbors in real-world complex networks. Appl. Math. Comput. 320(11):512–523

    Article  Google Scholar 

  • Newman MEJ (2004a) Fast algorithm for detecting community structure in networks. Phys. Rev. E Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top. 69(6):5

    Google Scholar 

  • Newman MEJ (2004b) Detecting community structure in networks. Eur. Phys. J. B Condens. Matter 38(2):321–330

    Google Scholar 

  • Newman MEJ (2006) Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23):8577–8582

    Article  Google Scholar 

  • Page L, Brin S, Motwani R, Winograd T (1998) The PageRank citation ranking: bringing order to the Web. World Wide Web Internet Web Inf. Syst. 54(1999–66):1–17

    Google Scholar 

  • Sato, K., Izunaga, Y.: A branch-and-price approach with MILP formulation to modularity density maximization on graphs, pp. 1–25 (2017). arXiv Prepr. http://arxiv.org/abs/1705.02961

  • Şen F, Wigand R, Agarwal N, Tokdemir S, Kasprzyk R (2016) Focal structures analysis: identifying influential sets of individuals in a social network. Soc. Netw. Anal. Min. 6(1):17

    Article  Google Scholar 

  • Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2):146–160

    Article  Google Scholar 

  • Tsung, C.K., Ho, H., Chou, S., Lin, J., Lee, S.: A spectral clustering approach based on modularity maximization for community detection problem. In: Proc. 2016 Int. Comput. Symp. ICS 2016, pp. 12–17 (2017)

  • Waltman L, Van Eck NJ (2013) A smart local moving algorithm for large-scale modularity-based community detection. Eur. Phys. J. B 86(11):1–14

    Article  Google Scholar 

  • Xie WB, Lee YL, Wang C, Chen DB, Zhou T (2020) Hierarchical clustering supported by reciprocal nearest neighbors. Inf. Sci. (Ny) 527:279–292

    Article  Google Scholar 

  • Yang L, Silva JC, Papageorgiou LG, Tsoka S (2016) Community structure detection for directed networks through modularity optimisation. Algorithms 9(4):1–10

    Article  Google Scholar 

  • You X, Ma Y, Liu Z (2020) A three-stage algorithm on community detection in social networks. Knowl. Based Syst. 187:104822

    Article  Google Scholar 

  • Zachary WW (1977) An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4):452–473

    Article  Google Scholar 

  • Zafarani R, Abbasi MA, Liu H (2014) Social Media Mining: An Introduction. Cambridge University Press, Cambridge

    Book  Google Scholar 

Download references

Acknowledgements

This research is funded in part by the U.S. National Science Foundation (OIA-1946391, OIA-1920920, IIS-1636933, ACI-1429160, and IIS-1110868), U.S. Office of Naval Research (N00014-10-1-0091, N00014-14-1-0489, N00014-15-P-1187, N00014-16-1-2016, N00014-16-1-2412, N00014-17-1-2675, N00014-17-1-2605, N68335-19-C-0359, N00014-19-1-2336, N68335-20-C-0540), U.S. Air Force Research Lab, U.S. Army Research Office (W911NF-17-S-0002, W911NF-16-1-0189), U.S. Defense Advanced Research Projects Agency (W31P4Q-17-C-0059), Arkansas Research Alliance, the Jerry L. Maulden/Entergy Endowment at the University of Arkansas at Little Rock, and the Australian Department of Defense Strategic Policy Grants Program (SPGP) (Award Number: 2020-106-094). Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the funding organizations. The researchers gratefully acknowledge the support.

Author information

Authors and Affiliations

  1. University of Arkansas at Little Rock, Little Rock, AR, USA

    Mustafa Alassad, Muhammad Nihal Hussain & Nitin Agarwal

Authors
  1. Mustafa Alassad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Muhammad Nihal Hussain
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nitin Agarwal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nitin Agarwal.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix

Appendix

figure a

.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Alassad, M., Hussain, M.N. & Agarwal, N. Comprehensive decomposition optimization method for locating key sets of commenters spreading conspiracy theory in complex social networks. Cent Eur J Oper Res 30, 367–394 (2022). https://doi.org/10.1007/s10100-021-00738-5

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-021-00738-5

Keywords

Search

Navigation