A Novel Approach for Dynamic Rumor Influence Minimization in Social Networks

Authors

  • K. Mounica  Department of MCA, QIS College of Engineering Techology, Ongole, Andhra Pradesh, India
  • K. Jayakrishna  Associate Professor. Department of MCA, QIS College of Engineering Techology, Ongole, Andhra Pradesh, India

Keywords:

Rumor Influence, Social Network, Greedy algorithm.

Abstract

With the quick advancement of big scale on-line social networks, on-line information sharing is getting to be inescapable day by day. Various information is proliferating through on-line social networks also as each the constructive and antagonistic. All through this paper, we have a tendency to tend to center around the negative information issues simply like the on-line rumor tidbits. Rumor square may well be a big disadvantage in substantial scale social networks. Vindictive bits of rumor may make disorder in the public eye and so ought to be hindered when potential once being recognized. amid this paper, we have a tendency to propose a model of dynamic rumor influence reduction with user expertise (DRIMUX).Our objective is to curtail the influence of the rumor (i.e., the quantity of clients that have acknowledged and sent the talk) by obstruct a correct arrangement of hubs. A dynamic Ising spread model considering each the overall quality and individual fascination of the talk is given bolstered sensible situation. To boot, inside and out totally not quite the same as existing issues with influence decrease, we have a tendency to have a tendency to require into thought the imperative of client encounter utility. In particular, every hub is allocated a resilience time limit. In the event that the piece time of every client surpasses that edge, the utility of the system will diminish. Underneath this imperative, we have a tendency to keep an eye on then define step back as a system dynamic idea downside with survival hypothesis, and propose arrangements upheld most likelihood standard. Tests territory unit executed bolstered extensive scale world systems and approve the adequacy of our philosophy.

References

  1. J Yang and J. Leskovec, “Patterns of temporal variation in online media,” in Proc. ACM Int. Conf. Web Search Data Minig, 2011, pp. 177–186.
  2. R Crane and D. Sornette, “Robust dynamic classes revealed by measuring the response function of a social system,” in Proc. of the Natl. Acad. Sci. USA, vol. 105, no. 41, Apr. 2008, pp. 15 649–15 653.
  3. S Han, F. Zhuang, Q. He, Z. Shi, and X. Ao, “Energy model for rumor propagation on social networks,” Physica A: Statistical Mechanics and its Applications, vol. 394, pp. 99–109, Jan. 2014.
  4. D Chelkak and S. Smirnov, “Universality in the 2d ising model and conformal invariance of fermionic observables,” Inventiones Mathmaticae, vol. 189, pp. 515–580, Sep. 2012.
  5. W Chen, C.Wang, and Y.Wang, “Scalable influence maximization for prevalent viral marketing in large-scale social networks,” in Proc. 16th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2010, pp. 1029–1038.
  6. S Shirazipourazad, B. Bogard, H. Vachhani, and A. Sen, “Influence propagation in adversarial setting: How to defeat competition with least amount of investment,” in Proc. 21st ACM Int. Conf. Inf. Knowl. Manag., 2012, pp. 585–594.
  7. E Serrano, C. A. Iglesias, and M. Garijo, “A novel agent-based rumor spreading model in twitter,” in Proc. 24th Int. Conf. World Wide Web, 2015, pp. 811–814
  8. C Budak, D. Agrawal, and A. E. Abbadi, “Limiting the spread of misinformation in social networks,” in Proc. 20th Int. Conf. World Wide Web, 2011, pp. 665–674.
  9. M Kimura, K. Saito, and H. Motoda, “Blocking links to minimize contamination spread in a social network,” ACM Trans. Knowl.Discov. Data, vol. 3, no. 2, pp. 9:1–9:23, Apr. 2009.
  10. L. Fan, Z. Lu, W. Wu, B. Thuraisingham, H. Ma, and Y. Bi, “Least cost rumor blocking in social networks,” in Proc. IEEE ICDCS’13,Philadelphia, PA, Jul. 2013, pp. 540–549.
  11. Chen,W.;Wang, C.; andWang, Y. 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proceedings of the 16th ACM SIGKDD Internatioanl Conference on Knowledge Discovery and Data Mining, 1029–1038.
  12. Crane, R., and Sornette, D. 2008. Robust dynamic classes revealed by measuring the response function of a social system. Proceedings of the National Academy of Sciences of the United States of America 105:15649–15653.
  13. Fan, L.; Lu, Z.;Wu,W.; Thuraisingham, B.; Ma, H.; and Bi, Y. 2013. Least cost rumor blocking in social networks. In Proceedings of the 33rd International Conference on Distributed Computing Systems, 540–549.
  14. Han, S.; Zhuang, F.; He, Q.; Shi, Z.; and Ao, X. 2014. Energy model for rumor propagation on social networks. In Proceedings of Physica A: Statistical Mechanics and its Applications, 99–109.
  15. Kempe, D.; Kleinberg, J.; and Tardos, E. 2003. Maximizing the spread of influence through a social network. In Proceedings of the 9th ACM SIGKDD Internatioanl Conference on Knowledge Discovery and Data Mining, 1175–1180.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2018-04-30

Issue

Volume 4, Issue 2, March-April-2018

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
K. Mounica, K. Jayakrishna, " A Novel Approach for Dynamic Rumor Influence Minimization in Social Networks, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 2, pp.370-374, March-April-2018.