Skip to main content

Stemming the Flow of Information in a Social Network

  • Chapter

Part of the Lecture Notes in Computer Science book series (LNISA,volume 8851)

Abstract

Social media has changed the way people interact with each other and has contributed greatly towards bringing people together. It has become an ideal platform for people to share their opinions. However, due to the volatility of social networks, a negative campaign or a rumor can go viral resulting in severe impact to the community. In this paper, we aim to solve this problem of stemming the flow of a negative campaign in a network by observing only parts of the network. Given a negative campaign and information about the status of its spread through a few candidate nodes, our algorithm estimates the information flow in the network and based on this estimated flow, finds a set of nodes which would be instrumental in stemming the information flow. The proposed algorithm is tested on real-world networks and its effectiveness is compared against other existing works.

Keywords

  • social network
  • rumor source
  • rumor stemming
  • targeted influence

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-319-13734-6_24
  • Chapter length: 10 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   79.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-13734-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   99.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Budak, C., Agrawal, D., El Abbadi, A.: Limiting the spread of misinformation in social networks. In: Proceedings of the 20th International conference on World Wide Web, pp. 665–674. ACM (2011)

    Google Scholar 

  2. Capasso, V., Capasso, V.: Mathematical structures of epidemic systems, vol. 88. Springer (1993)

    CrossRef  Google Scholar 

  3. Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International conference on Knowledge Discovery and Data Mining, pp. 1029–1038. ACM (2010)

    Google Scholar 

  4. Chew, C., Eysenbach, G.: Pandemics in the age of twitter: content analysis of tweets during the 2009 H1N1 outbreak. PloS one 5(11) (2010)

    CrossRef  Google Scholar 

  5. Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57–66. ACM (2001)

    Google Scholar 

  6. Gönci, B., Németh, V., Balogh, E., Szabó, B., Dénes, Á., Környei, Z., Vicsek, T.: Viral epidemics in a cell culture: novel high resolution data and their interpretation by a percolation theory based model. PloS one 5(12) (2010)

    CrossRef  Google Scholar 

  7. Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146. ACM (2003)

    Google Scholar 

  8. Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Van Briesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420–429. ACM (2007)

    Google Scholar 

  9. Mann, H.B., Whitney, D.R.: On a test of whether one of two random variables is stochastically larger than the other. The Annals of Mathematical Statistics, 50–60 (1947)

    MathSciNet  CrossRef  Google Scholar 

  10. Narayanam, R., Narahari, Y.: A shapley value-based approach to discover influential nodes in social networks. IEEE Transactions on Automation Science and Engineering (99), 1–18 (2010)

    Google Scholar 

  11. Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web (1999)

    Google Scholar 

  12. Prakash, B.A., Vreeken, J., Faloutsos, C.: Spotting culprits in epidemics: How many and which ones? In: IEEE International Conference on Data Mining, vol. 12, pp. 11–20 (2012)

    Google Scholar 

  13. Premm Raj, H., Narahari, Y.: Influence limitation in multi-campaign social networks: A shapley value based approach (2012)

    Google Scholar 

  14. Seo, E., Mohapatra, P., Abdelzaher, T.: Identifying rumors and their sources in social networks. In: SPIE Defense, Security, and Sensing. pp. 83891I–83891I. International Society for Optics and Photonics (2012)

    Google Scholar 

  15. Shah, D., Zaman, T.: Rumors in a network: Who’s the culprit? IEEE Transactions on Information Theory 57(8), 5163–5181 (2011)

    MathSciNet  CrossRef  Google Scholar 

  16. Srinivasan, B., Anandhavelu, N., Dalal, A., Yenugula, M., Srikanthan, P., Layek, A.: Topic-based targeted influence maximization. In: Social Networking Workshop, 2014 Sixth International Conference on Communication Systems and Networks (COMSNETS), pp. 1–6 (January 2014)

    Google Scholar 

  17. Steel, E.: Nestlé takes a beating on social-media sites. The Wall Street Journal 29 (2010)

    Google Scholar 

  18. Tong, H., Prakash, B.A., Eliassi-Rad, T., Faloutsos, M., Faloutsos, C.: Gelling, and melting, large graphs by edge manipulation. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 245–254. ACM (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Srinivasan, B.V., Kumar, A., Gupta, S., Gupta, K. (2014). Stemming the Flow of Information in a Social Network. In: Aiello, L.M., McFarland, D. (eds) Social Informatics. SocInfo 2014. Lecture Notes in Computer Science, vol 8851. Springer, Cham. https://doi.org/10.1007/978-3-319-13734-6_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13734-6_24

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13733-9

  • Online ISBN: 978-3-319-13734-6

  • eBook Packages: Computer ScienceComputer Science (R0)