Detection and Minimization Influence of Rumor in Social Network

Authors(2) :-S.Hema Latha, Palaparthy Vivekanandareddy

With the fast development of big scale on-linesocial networks, on-line data sharing is becoming omnipresent daily. Numerous info is propagating through on-line social networks similarly as every the positive and negative. Throughout this paper, we tend to tend to focus on the negative data problems just like the on-line rumors. Rumor block may well be a significant drawback in large-scale social networks. Malicious rumours might cause chaos in society and sought to be blocked as soon as potential once being detected. during this paper, we tend to propose a model of dynamic rumor influence reduction with user expertise (DRIMUX).Our goal is to cut back the influence of the rumor (i.e., the number of users that have accepted and sent the rumor) by block an exact set of nodes. A dynamic Ising propagation model considering every the worldwide quality and individual attraction of the rumor is given supported realistic state of affairs. To boot, altogether completely different from existing problems with influence reduction, we tend to tend to require into thought the constraint of user experience utility. Specifically, each node is assigned a tolerance time threshold. If the block time of each user exceeds that threshold, the utility of the network will decrease. Underneath this constraint, we tend to tend to then formulate draw back as a network abstract thought drawback with survival theory, and propose solutions supported most probability principle. Experiments area unit implemented supported large-scale world networks and validate the effectiveness of our methodology.

Authors and Affiliations

S.Hema Latha
MCA Department, Vignan's Lara Institute of Technology and Science, Vadlamudi, Guntur, Andhra Pradesh, India
Palaparthy Vivekanandareddy

Social Network, Rumor Influence Minimization, Rumor-Blocking Strategies, Survival Theory.

  1. B. Wang, G. Chen, L. Fu, L. Song, and X. Wang, "Drimux: Dynamic rumor influence minimization with user experience in social networks," in Proc.30th AAAI Int. Conf. Artif. Intell., Feb. 2016.
  2. 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.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. S. Han, F. Zhuang, Q. He, Z. Shi, and X. Ao, "Energy model for rumor propagation on social networks,"Physica A: tatistical Mechanics and its Applications, vol. 394, pp. 99–109, Jan. 2014.
  8. 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.
  9. W. Chen, C.Wang, and Y.Wang, "Scalable influence maximization for prevalent viral marketing in large-scale social networks," in Proc. 16th ACM SIGKDDInt. Conf. Knowl. Discovery Data Mining, 2010, pp. 1029–1038.
  10. 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.
  11. D. N. Yang, H. J. Hung, W. C. Lee, and W.Chen, "Maximizing acceptance probability for active friending in online social networks," in Proc. 19thACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2013, pp. 713–721.
  12. J. Leskovec, L. A. Adamic, and B. A.Huberman, "The dynamics of viral marketing," inProc. 7th ACM Conf. Electronic Commerce, 2006,pp. 228–237.
  13. A.McCallum, A. Corrada-Emmanuel, and X.Wang, "Topic and role discovery in social networks," in Proc. 19th Int. Joint Conf.Artif. Intell.,2005, pp. 786–791.
  14. E. J. Newman, "The structure of scientific collaboration networks,"in Proceedings of NationalAcademy of Science, 2001, pp.404–409.
  15. L. Fu, W. Huang, X. Gan, F. Yang, and X.Wang, "Capacity of wireless networks with social characteristics," IEEE Trans. Wireless Commun., vol.15, pp. 1505–1516, Feb. 2016.
  16. A.Bessi, F. Petroni, M. Del Vicario, F. Zollo,Anagnostopoulos,A. Scala, G. Caldarelli, and W.Quattrociocchi, "Viral misinformation:The role of homophily and polarization," in Proc. 24th Int.Conf.World Wide Web, 2015, pp. 355–356.
  17. 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.
  18. S. Fiegerman, "Face book, Google, twitter accused of enabling isis," http://money.cnn.com/2016/12/20/technology/twitterfacebook-google-lawsuit-isis, 2016.
  19. Face book, "Face book community standards," https://www.facebook.com/communitystandads.

Publication Details

Published in : Volume 4 | Issue 2 | March-April 2018
Date of Publication : 2018-04-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 108-114
Manuscript Number : CSEIT1833621
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

S.Hema Latha, Palaparthy Vivekanandareddy, "Detection and Minimization Influence of Rumor in Social Network", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 2, pp.108-114, March-April.2018
URL : http://ijsrcseit.com/CSEIT1833621

Follow Us

Contact Us