skip to main content
10.1145/3308560.3314200acmotherconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
research-article

Identification of the Source(s) of Misinformation Propagation Utilizing Identifying Codes

Published:13 May 2019Publication History

ABSTRACT

With billions of users, social networks have become the go to platform for information diffusion for news media outlets. Lately, certain entities (users and/or organizations) have been active in generating misinformation in order to attract users to their respective websites, to generate online advertisement revenues, to increase followers, to create political instability, etc. With the increasing presence of misinformation on social networks, it is becoming increasingly difficult to not only distinguish between information and misinformation, but also, to identify the source(s) of misinformation propagation. This effort reviews my doctoral research on identifying the source(s) of misinformation propagation. Particularly, I utilize the mathematical concept of Identifying Codes to uniquely identify users who become active in propagating misinformation. In this paper, I formally present the computation of the Minimum Identifying Code Set (MICS) as a novel variation of the traditional Graph Coloring problem. Furthermore, I present an Integer Linear Program for the computation of the MICS. I apply the technique on various anonymous Facebook network datasets and show the effectiveness of the approach.

References

  1. Mohammad-Ali Abbasi and Huan Liu. 2013. Measuring user credibility in social media. In International Conference on Social Computing, Behavioral-Cultural Modeling, and Prediction. Springer, 441–448. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Kaustav Basu, Malhar Padhee, Sohini Roy, Anamitra Pal, Arunabha Sen, Matthew Rhodes, and Brian Keel. 2018. Health Monitoring of Critical Power System Equipments Using Identifying Codes. In International Conference on Critical Information Infrastructures Security. Springer, 29–41.Google ScholarGoogle Scholar
  3. Kaustav Basu, Chenyang Zhou, Arunabha Sen, and Victoria Horan Goliber. 2019. A Novel Graph Analytic Approach to Monitor Terrorist Networks. arXiv preprint arXiv:1902.02836(2019).Google ScholarGoogle Scholar
  4. Irène Charon, Olivier Hudry, and Antoine Lobstein. 2003. Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theoretical Computer Science 290, 3 (2003), 2109–2120. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Giovanni Luca Ciampaglia, Prashant Shiralkar, Luis M Rocha, Johan Bollen, Filippo Menczer, and Alessandro Flammini. 2015. Computational fact checking from knowledge networks. PloS one 10, 6 (2015), e0128193.Google ScholarGoogle ScholarCross RefCross Ref
  6. Mehrdad Farajtabar, Jiachen Yang, Xiaojing Ye, Huan Xu, Rakshit Trivedi, Elias Khalil, Shuang Li, Le Song, and Hongyuan Zha. 2017. Fake news mitigation via point process based intervention. arXiv preprint arXiv:1703.07823(2017). Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Mark G Karpovsky, Krishnendu Chakrabarty, and Lev B Levitin. 1998. On a new class of codes for identifying vertices in graphs. IEEE Transactions on Information Theory 44, 2 (1998), 599–611. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Moshe Laifenfeld and Ari Trachtenberg. 2008. Identifying codes and covering problems. IEEE Transactions on Information Theory 54, 9 (2008), 3929–3950. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http://snap.stanford.edu/data.Google ScholarGoogle Scholar
  10. Saikat Ray, Rachanee Ungrangsi, De Pellegrini, Ari Trachtenberg, and David Starobinski. 2003. Robust location detection in emergency sensor networks. In INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies, Vol. 2. IEEE, 1044–1053.Google ScholarGoogle ScholarCross RefCross Ref
  11. Arunabha Sen, Victoria H Goliber, Kaustav Basu, Chenyang Zhou, and Sumitava Ghosh. 2019. On upper and lower bounds of identifying code set for soccer ball graph with application to satellite deployment. In Proceedings of the 20th International Conference on Distributed Computing and Networking. ACM, 307–316. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Arunabha Sen, Victoria Horan Goliber, Chenyang Zhou, and Kaustav Basu. 2018. Terrorist Network Monitoring with Identifying Code. In International Conference on Social Computing, Behavioral-Cultural Modeling and Prediction and Behavior Representation in Modeling and Simulation. Springer, 329–339.Google ScholarGoogle Scholar
  13. Baoxu Shi and Tim Weninger. 2016. Fact checking in heterogeneous information networks. In Proceedings of the 25th International Conference Companion on World Wide Web. International World Wide Web Conferences Steering Committee, 101–102. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Kai Shu, Amy Sliva, Suhang Wang, Jiliang Tang, and Huan Liu. 2017. Fake news detection on social media: A data mining perspective. ACM SIGKDD Explorations Newsletter 19, 1 (2017), 22–36. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Kai Shu, Suhang Wang, and Huan Liu. 2018. Understanding user profiles on social media for fake news detection. In 2018 IEEE Conference on Multimedia Information Processing and Retrieval (MIPR). IEEE, 430–435.Google ScholarGoogle ScholarCross RefCross Ref
  16. Jukka Suomela. 2007. Approximability of identifying codes and locating-dominating codes.Inform. Process. Lett. 103, 1 (2007), 28–33. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Eugenio Tacchini, Gabriele Ballarin, Marco L Della Vedova, Stefano Moret, and Luca de Alfaro. 2017. Some like it hoax: Automated fake news detection in social networks. arXiv preprint arXiv:1704.07506(2017).Google ScholarGoogle Scholar
  18. Ying Xiao, Christoforos Hadjicostis, and Krishnaiyan Thulasiraman. 2006. The d-identifying codes problem for vertex identification in graphs: probabilistic analysis and an approximation algorithm. In International Computing and Combinatorics Conference. Springer, 284–298. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Identification of the Source(s) of Misinformation Propagation Utilizing Identifying Codes
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        WWW '19: Companion Proceedings of The 2019 World Wide Web Conference
        May 2019
        1331 pages
        ISBN:9781450366755
        DOI:10.1145/3308560

        Copyright © 2019 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 13 May 2019

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed limited

        Acceptance Rates

        Overall Acceptance Rate1,899of8,196submissions,23%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format .

      View HTML Format