Advertisement

Least Cost Rumor Influence Minimization in Multiplex Social Networks

  • Adil Imad Eddine Hosni
  • Kan LiEmail author
  • Cangfeng Ding
  • Sadique Ahmed
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11306)

Abstract

This paper deals with the issue of rumors propagation in online social networks (OSNs) that are connected through overlapping users, named multiplex OSNs. We consider a strategy to initiate an anti-rumor campaign to raise the awareness of individuals and prevent the adoption of the rumor for further limiting its influence. Therefore, we introduce the Least Cost Anti-rumor Campaign (LCAC) problem to minimize the influence of the rumor. The proposed problem defines the minimum number of users to initiate this campaign, which reaches a large number of overlapping users to increase the awareness of individuals across networks. Due to the NP-hardness of LCAC problem, we prove that its objective function is submodular and monotone. Then, we introduce a greedy algorithm for LCAC problem that guarantees an approximation within \((1-1/\textit{e})\) of the optimal solution. Finally, experiments on real-world and synthetics multiplex networks are conducted to investigate the effect of the number of the overlapping users as well as the networks structure topology. The results provide evidence about the efficacy of the proposed algorithm to limit the spread of a rumor.

Keywords

Rumor propagation Multiplex online social networks Optimization Rumor influence minimization 

Notes

Acknowledgment

The Research was supported in part by National Basic Research Program of China (973 Program, No. 2013CB329605).

References

  1. 1.
    Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bhatti, N., Bouch, A., Kuchinsky, A.: Integrating user-perceived quality into web server design. Comput. Netw. 33(1–6), 1–16 (2000)CrossRefGoogle Scholar
  3. 3.
    Borodin, A., Filmus, Y., Oren, J.: Threshold models for competitive influence in social networks. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 539–550. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-17572-5_48CrossRefGoogle Scholar
  4. 4.
    Budak, C., Abbadi, A.E.: Limiting the spread of misinformation in social networks. In: Distribution, pp. 665–674 (2011)Google Scholar
  5. 5.
    Daley, D., Kendall, D.: Epidemics and rumours. Nature 204(4963), 1118 (1964)CrossRefGoogle Scholar
  6. 6.
    Dinh, T.N., Nguyen, D.T., Thai, M.T.: Cheap, easy, and massively effective viral marketing in social networks: truth or fiction? In: ACM Conference on Hypertext and Social Media, pp. 165–174. ACM (2012)Google Scholar
  7. 7.
    Fan, L., Lu, Z., Wu, W., Bhavani, T., Ma, H., Bi, Y.: Least cost rumor blocking in social networks. In: IEEE 33rd International Conference on Distributed Computing Systems (2013)Google Scholar
  8. 8.
    Garrett, R.K.: Troubling consequences of online political rumoring. Hum. Commun. Res. 37(2), 255–274 (2011)CrossRefGoogle Scholar
  9. 9.
    Hamidian, S., Diab, M.T.: Rumor detection and classification for Twitter data. In: Proceedings of the Fifth International Conference on Social Media Technologies, Communication, and Informatics (SOTICS), pp. 71–77 (2015)Google Scholar
  10. 10.
    Hamidian, S., Diab, M.T.: Rumor identification and belief investigation on Twitter. In: ACL, pp. 3–8 (2016)Google Scholar
  11. 11.
    Han, S., Zhuang, F., He, Q., Shi, Z., Ao, X.: Energy model for rumor propagation on social networks. Phys. A Stat. Mech. Its Appl. 394, 99–109 (2014)CrossRefGoogle Scholar
  12. 12.
    Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: KDD, p. 137 (2003)Google Scholar
  13. 13.
    Kimura, M., Saito, K., Motoda, H.: Minimizing the spread of contamination by blocking links in a network. In: AAAI, pp. 1175–1180 (2008)Google Scholar
  14. 14.
    Kuhnle, A., Alim, M.A., Li, X., Zhang, H., Thai, M.T.: Multiplex influence maximization in online social networks with heterogeneous diffusion models. IEEE Trans. Comput. Soc. Syst. 5(2), 418–429 (2018)CrossRefGoogle Scholar
  15. 15.
    Ma, J., Zhu, H.: Rumor diffusion in heterogeneous networks by considering the individuals’ subjective judgment and diverse characteristics. Phys. A Stat. Mech. Its Appl. 499, 276–287 (2018)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Magnani, M., Rossi, L.: The ML-Model for multi-layer social networks. In: ASONAM, pp. 5–12. IEEE Computer Society (2011)Google Scholar
  17. 17.
    Montanari, A., Saberi, A.: The spread of innovations in social networks. Proc. Natl. Acad. Sci. 107(47), 20196–20201 (2010)CrossRefGoogle Scholar
  18. 18.
    Nguyen, D.T., Zhang, H., Das, S., Thai, M.T., Dinh, T.N.: Least cost influence in multiplex social networks: model representation and analysis. In: 2013 IEEE 13th International Conference on Data Mining pp. 567–576 (2013)Google Scholar
  19. 19.
    Tong, G., et al.: An efficient randomized algorithm for rumor blocking in online social networks. IEEE Trans. Netw. Sci. Eng. (2017)Google Scholar
  20. 20.
    Wang, B., Chen, G., Fu, L., Song, L., Wang, X.: DRIMUX: dynamic rumor influence minimization with user experience in social networks. IEEE Trans. Knowl. Data Eng 29(10), 2168–2181 (2017)CrossRefGoogle Scholar
  21. 21.
    Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440 (1998)CrossRefGoogle Scholar
  22. 22.
    Yagan, O., Qian, D., Zhang, J., Cochran, D.: Information diffusion in overlaying social-physical networks. In: 46th Annual Conference on information Sciences and Systems (CISS), pp. 1–6. IEEE (2012)Google Scholar
  23. 23.
    Yao, Q., Shi, R., Zhou, C., Wang, P., Guo, L.: Topic-aware social influence minimization. In: Proceedings of the 24th International Conference on World Wide Web - WWW 2015 Companion, vol. 1, pp. 139–140 (2015)Google Scholar
  24. 24.
    Zhang, H., Nguyen, D.T., Zhang, H., Thai, M.T.: Least cost influence maximization across multiple social networks. IEEE/ACM Trans. Netw. (TON) 24(2), 929–939 (2016)CrossRefGoogle Scholar
  25. 25.
    Zhang, L., Su, C., Jin, Y., Goh, M., Wu, Z.: Cross-network dissemination model of public opinion in coupled networks. Inf. Sci. 451, 240–252 (2018)MathSciNetCrossRefGoogle Scholar
  26. 26.
    Zheng, C., Xia, C., Guo, Q., Dehmer, M.: Interplay between SIR-based disease spreading and awareness diffusion on multiplex networks. J. Parallel Distrib. Comput. 115, 20–28 (2018)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Adil Imad Eddine Hosni
    • 1
    • 2
  • Kan Li
    • 1
    Email author
  • Cangfeng Ding
    • 1
    • 3
  • Sadique Ahmed
    • 1
  1. 1.School of Computer ScienceBeijing Institute of TechnologyBeijingChina
  2. 2.Ecole Militaire PolytechniqueAlgiersAlgeria
  3. 3.School of Mathematics and Computer ScienceYanan universityYan’anChina

Personalised recommendations