Controlling Rumor Cascade over Social Networks

  • Ragia A. Ibrahim
  • Hesham A. Hefny
  • Aboul Ella Hassanien
Conference paper

DOI: 10.1007/978-3-319-48308-5_44

Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 533)
Cite this paper as:
Ibrahim R.A., Hefny H.A., Hassanien A.E. (2017) Controlling Rumor Cascade over Social Networks. In: Hassanien A., Shaalan K., Gaber T., Azar A., Tolba M. (eds) Proceedings of the International Conference on Advanced Intelligent Systems and Informatics 2016. AISI 2016. Advances in Intelligent Systems and Computing, vol 533. Springer, Cham

Abstract

This work studies controlling rumor cascade over social networks problem. Previous research was mainly focused on removing nodes or edges to achieve the desired outcome. For this study, we firstly propose effective algorithms to solve rumor cascade controlling problem. Second, we conduct a theoretical study for our methods, including the hardness of the problem, the accuracy and complexity. Lastly, we conduct experiments on synthetic data set and compare results with local structure node measures.

Keywords

Graph mining Social networks Influence propagation Simulation 

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Ragia A. Ibrahim
    • 1
    • 3
  • Hesham A. Hefny
    • 1
  • Aboul Ella Hassanien
    • 2
    • 3
  1. 1.Institute of Statistical Studies and Research (ISSR)Cairo UniversityGizaEgypt
  2. 2.Faculty of Computers and InformationCairo UniversityGizaEgypt
  3. 3.Scientific Research Group in EgyptGizaEgypt

Personalised recommendations