Skip to main content

Influential Node Detection in Online Social Network for Influence Minimization of Rumor

  • Conference paper
  • First Online:
Proceedings of International Conference on Frontiers in Computing and Systems

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 404))

  • 314 Accesses

Abstract

In any online social media platform, it is necessary to reduce the effect of rumor data from original information as it may cause harm to society. Influential users can be detected through different centrality measures. When the rumor is generated through some influential users, they have more impact on society. Here, we have proposed a prognostic method to distinguish those influential users of online social media, based on network analysis. The susceptible-infectious-recovered (SIR) model has been used for simulation of the propagation of information. For the particular seed nodes which have been chosen by practicing different centrality measures, detailed relative learning in terms of infected nodes is also exhibited. Selection of seed nodes through centrality measure is computationally exhaustive; therefore, we form a composite model, where the original social network is decomposed using the k-core, and centrality nodes are obtained from that decomposed network. Centrality measurements thus derived from the generated network are used as the seed of information propagation. Another important result derived from the empirical study is that not only the influential nodes, but neighbors of the influential nodes also have a greater impact on maximizing the effect of rumors.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Albert R, Jeong H, Barabási A (2000) Error and attack tolerance of complex networks. Nature 406(6794):378–382

    Article  Google Scholar 

  2. Amani AM, Jalili M, Yu X, Stone L (2017) Finding the most influential nodes in pinning controllability of complex networks. IEEE Trans. Circ. Syst. II: Express Briefs 64(6):685–689

    Google Scholar 

  3. Brandes U (2001) A faster algorithm for betweenness centrality. J Math Soc 25(2):163–177

    Article  Google Scholar 

  4. Dey P, Chaterjee A, Roy S (2019) Influence maximization in online social network using different centrality measures as seed node of information propagation. Sādhanā 44(9):205

    Article  MathSciNet  Google Scholar 

  5. Kundu S, Murthy CA, Pal SK (2011) A new centrality measure for influence maximization in social networks. In: International conference on pattern recognition and machine intelligence. Springer, pp 242–247

    Google Scholar 

  6. Leskovec J, Krevl A (2014) SNAP datasets: stanford large network dataset collection. http://snap.stanford.edu/data

  7. Moreno Y, Nekovee M, Pacheco AF (2004) Dynamics of rumor spreading in complex networks. Phys. Rev. E 69(6):066130

    Google Scholar 

  8. Ya-Qi W, Xiao-Yuan Y, Yi-Liang H, Xu-An W (2013) Rumor spreading model with trust mechanism in complex social networks. Communi Theor Phys 59(4):510

    Article  Google Scholar 

  9. Zareie A, Sheikhahmadi A, Jalili M (2019) Influential node ranking in social networks based on neighborhood diversity. Future Gener Comput Syst 94:120–129

    Article  Google Scholar 

  10. Zhao Laijun, Cui Hongxin, Qiu Xiaoyan, Wang Xiaoli, Wang Jiajia (2013) Sir rumor spreading model in the new media age. Physica A: Stat Mech Appl 392(4):995–1003

    Article  MathSciNet  Google Scholar 

  11. Zubiaga A, Aker A, Bontcheva K, Liakata M, Procter R (2018) Detection and resolution of rumours in social media: a survey. ACM Comput Surv (CSUR) 51(2):1–36

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maitreyee Ganguly .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ganguly, M., Dey, P., Chatterjee, S., Roy, S. (2023). Influential Node Detection in Online Social Network for Influence Minimization of Rumor. In: Basu, S., Kole, D.K., Maji, A.K., Plewczynski, D., Bhattacharjee, D. (eds) Proceedings of International Conference on Frontiers in Computing and Systems. Lecture Notes in Networks and Systems, vol 404. Springer, Singapore. https://doi.org/10.1007/978-981-19-0105-8_58

Download citation

  • DOI: https://doi.org/10.1007/978-981-19-0105-8_58

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-19-0104-1

  • Online ISBN: 978-981-19-0105-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics