Skip to main content

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1415))

  • 513 Accesses

Abstract

The online social networks (OSNs) have become the significant elements of information society used for maintaining social relationships. Community structure is the fundamental element of any OSN which is constituted considering the users’ common interests. Coalition formation is the key form of interaction between the users in OSNs for information diffusion. The role of the Shapley value in OSNs is to measure the significance of key/influential users in each community. In this paper, a novel approach is proposed to identify such influential users by considering various node centrality measures using the Shapley value. The bridge nodes among these influential nodes are identified, which will be used for faster disseminating of information in the OSNs. Further, a recommender system to identify the influential nodes is developed based on centrality measure, information flow coefficient, and coordination coefficient to assess more accurately the information flow without any noise. The approach is validated with the popular OSN structures like the ‘Twitter followers’ network and Zachary’s karate club network with the help of the popular statistical programming language ‘R’. From the results obtained, it is observed that the context of the formulation of OSN communities based on their characteristics will provide a better solution.

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 229.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 299.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. Freeman LC (1979) Centrality in social networks I: conceptual clarification. Soc Netw 1:215–239

    Article  Google Scholar 

  2. Aadithya KV, Ravindran B, Michalak TP, Jennings NR (2010) Efficient computation of the shapley value for centrality in networks. In: Lecture notes in computer science, vol 6484. Springer, Berlin, Heidelberg

    Google Scholar 

  3. Shapley LS (1953) A value for n-person games. In: Contributions to the theory of games, RAND Corporation

    Google Scholar 

  4. Suri NR, Narahari Y (2008) Determining the top-k nodes in social networks using the Shapley value. In: AAMAS ’08: proceedings of the seventh ınternational joint conference on autonomous agents and multiagent systems, pp 1509–1512

    Google Scholar 

  5. Suri NR, Narahari Y (2010) A Shapley value-based approach to discover influential nodes in social networks. IEEE Trans Autom Sci Eng 8(1):130–147

    Google Scholar 

  6. Gómez D, González-Arangüena E, Manuel C, Owen G, Del Pozo M, Tejada J (2003) Centrality and power in social networks: a game theoretic approach. Math Soc Sci 46(1):27–54

    Article  MathSciNet  Google Scholar 

  7. Hasan M, Zaki MJ (2011) A survey of link prediction in social networks. Soc Netw Data Analytics 243–275

    Google Scholar 

  8. Bakshy E, Rosenn I, Marlow C, Ariana L (2012) The role of social networks in ınformation diffusion. In: WWW ‘12: proceedings of the 21st international conference on World Wide Web, pp 519–528

    Google Scholar 

  9. Resnick P, Varian HR (1997) Recommender systems. Commun ACM 40(3)

    Google Scholar 

  10. Sarwar B, Karypis G, Konstan J, Riedl J (2000) Analysis of recommendation algorithms for e-commerce. In: Proceedings of the 2nd ACM conference on electronic commerce, ACM, pp 158–167

    Google Scholar 

  11. Adomavicius G, Tuzhilin A (2005) Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Trans Knowl Data Eng 17:734–749

    Article  Google Scholar 

  12. https://cran.r-project.org/web/packages/igraph/igraph.pdf

  13. Wang L, Lou T, Tang J, Hopcroft JE (2011) Detecting community kernels in large social networks. In: 2011 IEEE 11th ınternational conference on data mining (ICDM), pp 784–793

    Google Scholar 

  14. Zachary W (1976) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452–473

    Article  Google Scholar 

  15. Ricci F, Rokach L, Shapira B (2011) Introduction to recommender systems handbook. In: Recommender systems handbook, Springer, pp 1–35

    Google Scholar 

  16. Newman M, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev

    Google Scholar 

  17. Chakrabarty N, Biswas S (2020) Navo minority over-sampling technique (NMOTe): a consistent performance booster on imbalanced datasets. J Electron 2(2):96–136

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 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

Sailaja Kumar, K., Evangelin Geetha, D. (2022). A Recommender System for Information Diffusion. In: Pandian, A.P., Palanisamy, R., Narayanan, M., Senjyu, T. (eds) Proceedings of Third International Conference on Intelligent Computing, Information and Control Systems. Advances in Intelligent Systems and Computing, vol 1415. Springer, Singapore. https://doi.org/10.1007/978-981-16-7330-6_51

Download citation

Publish with us

Policies and ethics