Skip to main content
SpringerLink
Log in

CLUS-BET: improving influence propagation and classification in networks using a novel seed selection technique

  • Original Article
  • Published:
Social Network Analysis and Mining Aims and scope Submit manuscript

Abstract

Theories to maximise influence in social networks have been investigated vastly by researchers in recent times. Various strategies have been proposed to identify initial seed node set to diffuse the information in the network. In this manuscript, a seed node selection strategy has been proposed based on the clustering coefficient and betweenness centrality scores of the nodes in the graph (CLUS-BET). The influence spread (in the underlying network) is measured using Independent Cascade Model (ICM) by selecting top k seed nodes having high CLUS-BET score. The network coverage obtained are \(72.48\%\), \(65.85\%\), \(51.12\%\) and \(53.15\%\) for CORA, Citeseer, PubMed and Amazon Computers network respectively. The results obtained are better in comparison to any of the classical centrality algorithms’-based seed node selection. Also, the results are compared with a recent state of art method GRAIN based seed selection strategy. The manuscript further testifies that the quality of nodes selected based on CLUS-BET property improves the Graph Convolution Network (GCN) based node classification accuracy. CLUS-BET based GCN produces a node classification accuracy of \(90\%\), \(77\%\) and \(89.2\%\) for CORA, Citeseer and PubMed networks respectively. The results surpass the classification accuracy of base GCN model and its variations in contemporary state of art. Also, the property helps in identifying the most prominent influential clusters or groups of the network responsible for spreading the information in the network to a vast majority. The analytical explanation suggests that these are the groups having most number of nodes with high CLUS-BET score. The proposed idea is scalable with the graphical network as it avoids Monte Carlo simulation rounds with Greedy method for information cascade to identify seed nodes. The metric calculation for CLUS-BET is simple, less time consuming and effective.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Algorithm 1
Algorithm 2
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Data availibility statement

No datasets were generated or analysed during the current study.

References

  • Anderson RM (1991) Discussion: the Kermack–McKendrick epidemic threshold theorem. Bull Math Biol 53(1–2):1

    Article  MathSciNet  Google Scholar 

  • Ahuja V (2021) Transforming the media and entertainment industry: Cases from the social media marketing world. J Cases Inf Technol (JCIT) 23(4):1–17

  • Azaouzi M, Romdhane LB (2018) An efficient two-phase model for computing influential nodes in social networks using social actions. J Comput Sci Technol 33(2):286–304

    Article  MathSciNet  Google Scholar 

  • Azaouzi M, Mnasri W, Romdhane LB (2021) New trends in influence maximization models. Comput Sci Rev 40:100393

    Article  Google Scholar 

  • Bagrow JP, Liu X, Mitchell L (2019) Information flow reveals prediction limits in online social activity. Nat Hum Behav 3(2):122–128

    Article  Google Scholar 

  • Brandes U, Borgatti SP, Freeman LC (2016) Maintaining the duality of closeness and betweenness centrality. Soc Netw 44:153–159

    Article  Google Scholar 

  • Britton T (2020) Epidemic models on social networks—with inference. Statistica Neerlandica 74(3):222–241

    Article  MathSciNet  Google Scholar 

  • Caliò A, Tagarelli A (2021) Attribute based diversification of seeds for targeted influence maximization. Inf Sci 546:1273–1305

    Article  MathSciNet  Google Scholar 

  • Caliò A, Interdonato R, Pulice C, Tagarelli A (2018) Topology-driven diversity for targeted influence maximization with application to user engagement in social networks. IEEE Trans Knowl Data Eng 30(12):2421–2434

    Article  Google Scholar 

  • Chen YW, Zhang LF, Huang JP (2007) The Watts–Strogatz network model developed by including degree distribution: theory and computer simulation. J Phys A: Math Theor 40(29):8237

    Article  MathSciNet  Google Scholar 

  • Ding J, Sun W, Wu J, Guo Y (2020) Influence maximization based on the realistic independent cascade model. Knowl Based Syst 191:105265

    Article  Google Scholar 

  • Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, pp 57–66

  • Goldenberg J, Libai B, Muller E (2001) Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark Lett 12(3):211–223

    Article  Google Scholar 

  • Goyal A, Lu W, Lakshmanan LV (2011) Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th international conference on data mining, pp 211–220. IEEE

  • Grafström J, Jakobsson L, Wiede P (2018) The impact of influencer marketing on consumers’ attitudes by Influencer Marketing in Sweden. Jönköping University, School of Business and Economics

  • Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83(6):1420–1443

    Article  Google Scholar 

  • Hamilton WL, Ying R, Leskovec J (2017) Inductive representation learning on large graphs. In: Proceedings of the 31st international conference on neural information processing systems, pp 1025–1035

  • Indu V, Thampi SM (2019) A nature-inspired approach based on forest fire model for modeling rumor propagation in social networks. J Netw Comput Appl 125:28–41

    Article  Google Scholar 

  • Kaur M, Kaur H (2017) Implementation of enhanced graph layout algorithm for visualizing social network data using networkx library. Int J Adv Res Comput Sci. https://doi.org/10.26483/ijarcs.v8i3.2998

    Article  Google Scholar 

  • Kempe D, Kleinberg J, Tardos É (2003) 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

  • Kianian S, Rostamnia M (2021) An efficient path-based approach for influence maximization in social networks. Expert Syst Appl 167:114168

    Article  Google Scholar 

  • Kipf TN, Welling M (2016) Variational graph auto-encoders. arXiv preprint arXiv:1611.07308

  • Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: International conference on learning representations

  • Kourtellis N, Morales GDF, Bonchi F (2015) Scalable online betweenness centrality in evolving graphs. IEEE Trans Knowl Data Eng 27(9):2494–2506

    Article  Google Scholar 

  • Kwon HW (2020) Performance appraisal politics in the public sector: the effects of political skill and social similarity on performance rating. Public Pers Manag 49(2):239–261

    Article  MathSciNet  Google Scholar 

  • Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, pp 420–429

  • Li D, Wang C, Zhang S, Zhou G, Chu D, Wu C (2017) Positive influence maximization in signed social networks based on simulated annealing. Neurocomputing 260:69–78

    Article  Google Scholar 

  • Li Y, Fan J, Wang Y, Tan K-L (2018) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30(10):1852–1872

    Article  Google Scholar 

  • Li Y, Chen W, Wang Y, Zhang Z-L (2013) Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. In: Proceedings of the sixth ACM international conference on web search and data mining, pp 657–666

  • Li Q, Han Z, Wu X-M (2018) Deeper insights into graph convolutional networks for semi-supervised learning. In: Thirty-Second AAAI conference on artificial intelligence

  • Li Y, Qiu B, Chen Y, Zhao HV (2019) Analysis of information diffusion with irrational users: a graphical evolutionary game approach. In: ICASSP 2019–2019 IEEE international conference on acoustics, speech and signal processing (ICASSP), IEEE. pp 2527–2531

  • Padmanabhan MR. Somisetty N, Basu S, Pavan A (2018) Influence maximization in social networks with non-target constraints. In: 2018 IEEE international conference on big data (big data), pp 771–780. IEEE

  • Rahimkhani K, Aleahmad A, Rahgozar M, Moeini A (2015) A fast algorithm for finding most influential people based on the linear threshold model. Expert Syst Appl 42(3):1353–1361

    Article  Google Scholar 

  • Roethlisberger FJ, Dickson WJ (2003) Management and the worker, vol 5. Psychology Press, London

    Google Scholar 

  • Saxena A, Gera R, Iyengar S (2017) A faster method to estimate closeness centrality ranking. arXiv preprint arXiv:1706.02083

  • Saxena R, Jadeja M (2022) Network centrality measures: role and importance in social networks. In: Principles of social networking. Springer, Berlin, pp. 29–54

  • Saxena R, Jadeja M, Bhateja V (2021) Propagation analysis of Covid-19: an sir model-based investigation of the pandemic. Arab J Sci Eng pp 1–13

  • Shchur O, Mumme M, Bojchevski A, Günnemann S (2018) Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868

  • Trivedi N, Singh A (2020) Efficient influence maximization in social-networks under independent cascade model. Procedia Comput Sci 173:315–324

    Article  Google Scholar 

  • Utku A, Can U, Aslan S (2023) Detection of hateful twitter users with graph convolutional network model. Earth Sci Inf 16(1):329–343

    Article  Google Scholar 

  • Veličković P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. arXiv preprint arXiv:1710.10903

  • Wang H, Leskovec J (2020) Unifying graph convolutional neural networks and label propagation. arXiv preprint arXiv:2002.06755

  • Watts DJ, Strogatz SH (1998) Collective dynamics of ‘small-world’-networks. Nature 393:440–442

    Article  Google Scholar 

  • Wu Z, Pan S, Chen F, Long G, Zhang C, Philip SY (2020) A comprehensive survey on graph neural networks. IEEE Trans Neural Netw Learn Syst 32(1):4–24

    Article  MathSciNet  Google Scholar 

  • Xu H, Jiang B, Ding C (2022) MVINF: social influence prediction with multi-view graph attention learning. Cogn Comput 14(3):1182–1188

    Article  Google Scholar 

  • Yin C, Yuan M (2022) GCN-based text classification research. In: International conference on artificial intelligence and security, Springer, Berlin. pp 55–66

  • Zhang S, Tong H, Xu J, Maciejewski R (2019) Graph convolutional networks: a comprehensive review. Comput Soc Netw 6:1–23

    Article  Google Scholar 

  • Zhang W, Yang Z, Wang Y, Shen Y, Li Y, Wang L, Cui B (2021) Grain: improving data efficiency of graph neural networks via diversified influence maximization. arXiv preprint arXiv:2108.00219

Download references

Funding

None.

Author information

Author notes

  1. Pranjal Paira and Mahipal Jadeja have contributed equally to this work.

Authors and Affiliations

  1. Department of Computer Science and Engineering, Malaviya National Institute of Technology, Jaipur, Rajasthan, 302017, India

    Rahul Saxena & Mahipal Jadeja

  2. Department of Information Technology, Manipal University Jaipur, Jaipur, Rajasthan, 303007, India

    Rahul Saxena & Pranjal Paira

Authors
  1. Rahul Saxena
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pranjal Paira
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mahipal Jadeja
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rahul Saxena.

Ethics declarations

Conflict of interest

The authors declare that they have no Conflict of interest.

Ethical approval

The reported work does not involve any experiment over any animals or human beings and, hence, not applicable.

Informed Consent

Not applicable.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Saxena, R., Paira, P. & Jadeja, M. CLUS-BET: improving influence propagation and classification in networks using a novel seed selection technique. Soc. Netw. Anal. Min. 14, 81 (2024). https://doi.org/10.1007/s13278-024-01244-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s13278-024-01244-7

Keywords

Search

Navigation