Skip to main content
SpringerLink
Log in

Opinion Maximization in Signed Social Networks Using Centrality Measures and Clustering Techniques

  • Conference paper
  • First Online:
Distributed Computing and Intelligent Technology (ICDCIT 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13776))

Abstract

In a social network, Opinion Maximization is a problem that targets spreading the desired opinion across the social network. In the real world, every user/individual has their own opinion. The opinion of an individual can be favorable or unfavorable. Each individual can affect the others positively or negatively. In this paper, we consider the Opinion Maximization problem for signed, weighted and directed social networks with Multi-Stage Linear Threshold Model for information propagation. The seed nodes are responsible for spreading the desired opinion in the network. The Opinion Maximization problem asks to compute the minimum number of seed nodes such that the overall opinion of the network is maximized.

In this paper, we proposed three heuristics to select the seed nodes. The proposed methods use centrality measures and clustering of the social network. The proposed methods are tested on real-world as well as synthetic data sets.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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

Notes

  1. 1.

    We implemented AOMF [20].

References

  1. He, Q., et al.: Reinforcement-learning-based competitive opinion maximization approach in signed social networks. IEEE Trans. Comput. Soc. Syst. 9, 1–10 (2021)

    Article  Google Scholar 

  2. Abebe, R., Kleinberg, J., Parkes, D., Tsourakakis, C.E.: Opinion dynamics with varying susceptibility to persuasion. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery amp; Data Mining. KDD 2018, New York, NY, USA, pp. 1089–1098. Association for Computing Machinery (2018)

    Google Scholar 

  3. Nayak, A., Hosseinalipour, S., Dai, H.: Smart information spreading for opinion maximization in social networks. In: IEEE INFOCOM 2019 - IEEE Conference on Computer Communications, pp. 2251–2259 (2019)

    Google Scholar 

  4. Liu, X., Kong, X., Yu, P.S.: Active opinion maximization in social networks. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD 2018, New York, NY, USA, pp. 1840–1849. Association for Computing Machinery (2018)

    Google Scholar 

  5. Chen, X., Deng, L., Zhao, Y., Zhou, X., Zheng, K.: Community-based influence maximization in location-based social network. World Wide Web 24(6), 1903–1928 (2021). https://doi.org/10.1007/s11280-021-00935-x

    Article  Google Scholar 

  6. Yao, X., Gao, N., Gu, C., Huang, H.: Enhance rumor controlling algorithms based on boosting and blocking users in social networks. IEEE Trans. Comput. Soc. Syst. (2022)

    Google Scholar 

  7. Li, Y., Chen, W., Wang, Y., Zhang, Z.L.: Voter model on signed social networks. Internet Math. 11(2), 93–133 (2015). A preliminary version appears as “Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships”, WSDM’2013

    Google Scholar 

  8. Zhu, Y., Li, D., Yan, R., Wu, W., Bi, Y.: Maximizing the influence and profit in social networks. IEEE Trans. Comput. Soc. Syst. 4, 1–11 (2017)

    Article  Google Scholar 

  9. Quach, T.-T., Wendt, J.D.: A diffusion model for maximizing influence spread in large networks. In: Spiro, E., Ahn, Y.-Y. (eds.) SocInfo 2016. LNCS, vol. 10046, pp. 110–124. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-47880-7_7

    Chapter  Google Scholar 

  10. Aral, S., Dhillon, P.: Social influence maximization under empirical influence models. Nat. Hum. Behav. 2, 375–382 (2018)

    Article  Google Scholar 

  11. Topîrceanu, A.: Benchmarking cost-effective opinion injection strategies in complex networks. Mathematics 10(12), 2067 (2022)

    Article  Google Scholar 

  12. Liang, W., Shen, C., Li, X., Nishide, R., Piumarta, I., Takada, H.: Influence maximization in signed social networks with opinion formation. IEEE Access 7, 68837–68852 (2019)

    Article  Google Scholar 

  13. He, Q., Wang, X., Lei, Z., Huang, M., Cai, Y., Ma, L.: TIFIM: a two-stage iterative framework for influence maximization in social networks. Appl. Math. Comput. 354, 338–352 (2019)

    MathSciNet  MATH  Google Scholar 

  14. Cai, T., Li, J., Mian, A.S., Li, R.H., Sellis, T.K., Yu, J.X.: Target-aware holistic influence maximization in spatial social networks. IEEE Trans. Knowl. Data Eng. 34, 1993–2007 (2022)

    Google Scholar 

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

    Google Scholar 

  16. Zhu, J., Ghosh, S., Wu, W.: Robust rumor blocking problem with uncertain rumor sources in social networks. World Wide Web 24, 229–247 (2021). https://doi.org/10.1007/s11280-020-00841-8

    Article  Google Scholar 

  17. Ni, Q., Guo, J., Huang, C., Wu, W.: Community-based rumor blocking maximization in social networks: algorithms and analysis. Theoret. Comput. Sci. 840, 257–269 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  18. Guo, J., Chen, T., Wu, W.: A multi-feature diffusion model: rumor blocking in social networks. IEEE/ACM Trans. Networking 29(1), 386–397 (2021)

    Google Scholar 

  19. He, Q., Lv, Y., Wang, X., Huang, M., Cai, Y.: Reinforcement learning-based rumor blocking approach in directed social networks. IEEE Syst. J. 16, 1–11 (2022)

    Article  Google Scholar 

  20. He, Q., et al.: Positive opinion maximization in signed social networks. Inf. Sci. 558, 34–49 (2021)

    Article  MathSciNet  Google Scholar 

  21. Gionis, A., Terzi, E., Tsaparas, P.: Opinion maximization in social networks. In: IEEE Transactions on Knowledge and Data Engineering (2013)

    Google Scholar 

  22. Chen, W., et al.: Influence maximization in social networks when negative opinions may emerge and propagate, pp. 379–390. SIAM/Omnipress (2011)

    Google Scholar 

  23. He, Q., Fang, H., Zhang, J., Wang, X.: Dynamic opinion maximization in social networks. IEEE Trans. Knowl. Data Eng. 35, 350–361 (2021)

    Google Scholar 

  24. Cao, T., Wu, X., Wang, S., Hu, X.: OASNET: an optimal allocation approach to influence maximization in modular social networks. In: Proceedings of the 2010 ACM Symposium on Applied Computing, pp. 1088–1094 (2010)

    Google Scholar 

  25. Zhang, X., Zhu, J., Wang, Q., Zhao, H.: Identifying influential nodes in complex networks with community structure. Knowl.-Based Syst. 42, 74–84 (2013)

    Article  Google Scholar 

  26. Traag, V., Bruggeman, J.: Community detection in networks with positive and negative links. Phys. Rev. E, Stat. Nonlin. Soft Matter Phys. 80, 036115 (2009)

    Google Scholar 

  27. Reichardt, J., Bornholdt, S.: Statistical mechanics of community detection. Phys. Rev. E 74, 016110 (2006)

    Article  MathSciNet  Google Scholar 

  28. Guo, W.F., Zhang, S.W.: A general method of community detection by identifying community centers with affinity propagation. Physica A 447, 508–519 (2016)

    Article  Google Scholar 

  29. Androulidakis, M.A.: Community Detection in Signed Directed Graphs. PhD thesis, University of Piraeus (2021)

    Google Scholar 

  30. Kessler, M.M.: Bibliographic coupling between scientific papers. Am. Doc. 14, 10–25 (1963)

    Article  Google Scholar 

  31. Small, H.: Co-citation in the scientific literature: a new measure of the relationship between two documents. J. Am. Soc. Inf. Sci. 24, 265–269 (1973)

    Article  Google Scholar 

  32. Liu, W.C., Huang, L.C., Liu, C., Jordán, F.: A simple approach for quantifying node centrality in signed and directed social networks. Appl. Netw. Sci. 5, 46 (2020)

    Article  Google Scholar 

  33. He, Q., et al.: CAOM: a community-based approach to tackle opinion maximization for social networks. Inf. Sci. 513, 252–269 (2020)

    Article  MathSciNet  Google Scholar 

  34. Kumar, S., Spezzano, F., Subrahmanian, V., Faloutsos, C.: Edge weight prediction in weighted signed networks. In: Data Mining (ICDM), 2016 IEEE 16th International Conference on, pp. 221–230. IEEE (2016)

    Google Scholar 

  35. Kumar, S., Hooi, B., Makhija, D., Kumar, M., Faloutsos, C., Subrahmanian, V.: REV2: fraudulent user prediction in rating platforms. In: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, pp. 333–341. ACM (2018)

    Google Scholar 

  36. West, R., Paskov, H.S., Leskovec, J., Potts, C.: Exploiting social network structure for person-to-person sentiment analysis. Trans. Assoc. Comput. Linguist. 2, 297–310 (2014)

    Article  Google Scholar 

  37. Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems. CHI 2010, New York, NY, USA, pp. 1361–1370. Association for Computing Machinery (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer and Information Sciences, University of Hyderabad, Hyderabad, India

    Leela Srija Alla & Anjeneya Swami Kare

Authors
  1. Leela Srija Alla
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anjeneya Swami Kare
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anjeneya Swami Kare .

Editor information

Editors and Affiliations

  1. Indian Statistical Institute, Kolkata, India

    Anisur Rahaman Molla

  2. Kent State University, Kent, OH, USA

    Gokarna Sharma

  3. Indian Institute of Management, Lucknow, India

    Pradeep Kumar

  4. Technology Innovation Institute, Abu Dhabi, United Arab Emirates

    Sanjay Rawat

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Alla, L.S., Kare, A.S. (2023). Opinion Maximization in Signed Social Networks Using Centrality Measures and Clustering Techniques. In: Molla, A.R., Sharma, G., Kumar, P., Rawat, S. (eds) Distributed Computing and Intelligent Technology. ICDCIT 2023. Lecture Notes in Computer Science, vol 13776. Springer, Cham. https://doi.org/10.1007/978-3-031-24848-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-24848-1_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-24847-4

  • Online ISBN: 978-3-031-24848-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation