Skip to main content
SpringerLink
Log in

TI-SC: top-k influential nodes selection based on community detection and scoring criteria in social networks

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

Influence maximization is a classic optimization problem to find a subset of seed nodes in a social network that has a maximum influence with respect to a propagation model. This problem suffers from the overlap of seed nodes and the lack of optimal selection of seed nodes. Kempe et al. have shown that this problem is an NP-hard problem, and the objective function is submodular. Therefore, some heuristic and greedy algorithms have been proposed to find a near-optimal solution. However, the greedy algorithm may not satisfy the accuracy of a given solution and high time-consuming problem. To overcome these problems, the TI-SC algorithm is proposed for the problem of influence maximization. The TI-SC algorithm selects the influential nodes by examining the relationships between the core nodes and the scoring ability of other nodes. After selecting each seed node, the scores are updated to reduce the overlap in selecting the seed nodes. This algorithm has efficient performance in high Rich-Club networks. The Rich-Club phenomenon causes overlapping of the influence spread among the seed nodes in most of the other methods so that the TI-SC algorithm reduces this overlapping. Furthermore, the discovered communities with low expansion are not considered in the seed node selection phase, and this is useful for reducing computational overhead. Experimental results on both synthetic and real datasets show that the proposed TI-SC algorithm significantly outperforms the state-of-the-art algorithms in terms of efficiency in both small and large-scale datasets.

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
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

Notes

  1. http://snap.stanford.edu/data/.

  2. http://konect.cc/.

References

  • Ahajjam S, Badir H (2018) Identification of influential spreaders in complex networks using HybridRank algorithm. Sci Rep 8:11932

    Article  Google Scholar 

  • Atif Y, Al-Falahi K, Wangchuk T, Lindström B (2019) A fuzzy logic approach to influence maximization in social networks. J Ambient Intell Humaniz Comput 1–17

  • Banerjee S, Jenamani M, Pratihar DK (2019a) ComBIM: a community-based solution approach for the budgeted influence maximization problem. Expert Syst Appl 125:1–13

    Article  Google Scholar 

  • Banerjee S, Jenamani M, Pratihar DK (2019b) Maximizing the earned benefit in an incentivized social networking environment: a community-based approach. J Ambient Intell Humaniz Comput 1–17

  • Barabási A-L, Albert R (1999) Emergence of scaling in random networks. Science 286:509–512

    Article  MathSciNet  Google Scholar 

  • Berahmand K, Bouyer A (2019) A link-based similarity for improving community detection based on label propagation algorithm. J Syst Sci Complex 32:737–758. https://doi.org/10.1007/s11424-018-7270-1

    Article  MATH  Google Scholar 

  • Berahmand K, Bouyer A, Samadi N (2018) A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks Chaos. Solitons Fractals 110:41–54

    Article  Google Scholar 

  • Berahmand K, Bouyer A, Samadi N (2019) A new local and multidimensional ranking measure to detect spreaders in social networks. Computing 101:1711–1733

    Article  MathSciNet  Google Scholar 

  • Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms. SIAM, pp 946–957

  • Bozorgi A, Samet S, Kwisthout J, Wareham T (2017) Community-based influence maximization in social networks under a competitive linear threshold model. Knowl-Based Syst 134:149–158

    Article  Google Scholar 

  • Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 199–208

  • Chen Y-C, Zhu W-Y, Peng W-C, Lee W-C, Lee S-Y (2014) CIM: community-based influence maximization in social networks. ACM Trans Intell Syst Technol 5:25

    Article  Google Scholar 

  • Chen W, Lin T, Tan Z, Zhao M, Zhou X (2016) Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 795–804

  • Cheng S, Shen H, Huang J, Zhang G, Cheng X (2013) Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In: Proceedings of the 22nd ACM international conference on information and knowledge management. ACM, pp 509–518

  • 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. ACM, pp 57–66

  • Gmati H, Mouakher A, Gonzalez-Pardo A, Camacho D (2018) A new algorithm for communities detection in social networks with node attributes. J Ambient Intell Humaniz Comput 1–13

  • Goyal A, Lu W, Lakshmanan LV (2011a) Celf ++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web. ACM, pp 47–48

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

  • Guimera R, Danon L, Diaz-Guilera A, Giralt F, Arenas A (2003) Self-similar community structure in a network of human interactions. Phys Rev E 68:065103

    Article  Google Scholar 

  • Hosseini-Pozveh M, Zamanifar K, Naghsh-Nilchi AR (2017) A community-based approach to identify the most influential nodes in social networks. J Inf Sci 43:204–220

    Article  Google Scholar 

  • Huang H, Shen H, Meng Z, Chang H, He H (2019) Community-based influence maximization for viral marketing. Appl Intell, pp 1–14

  • Jung K, Heo W, Chen W (2012) Irie: scalable and robust influence maximization in social networks. In: 2012 IEEE 12th international conference on data mining. IEEE, pp 918–923

  • 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. ACM, pp 137–146

  • Kitsak M, Gallos LK, Havlin S, Liljeros F, Muchnik L, Stanley HE, Makse HA (2010) Identification of influential spreaders in complex networks. Nat Phys 6:888

    Article  Google Scholar 

  • Lawyer G (2015) Understanding the influence of all nodes in a network. Sci Rep 5:8665

    Article  Google Scholar 

  • Leskovec J, Mcauley JJ (2012) Learning to discover social circles in ego networks. In: Advances in neural information processing systems. pp 539–547

  • 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. ACM, pp 420–429

  • Li X, Guo J, Gao C, Zhang L, Zhang Z (2018) A hybrid strategy for network immunization. Chaos, Solitons Fractals 106:214–219

    Article  MathSciNet  Google Scholar 

  • Liu B, Cong G, Xu D, Zeng Y (2012) Time constrained influence maximization in social networks. In: 2012 IEEE 12th international conference on data mining. IEEE, pp 439–448

  • Liu D, Jing Y, Zhao J, Wang W, Song G (2017) A fast and efficient algorithm for mining top-k nodes in complex networks. Sci Rep 7:43330

    Article  Google Scholar 

  • Ma H, Zhu Y, Li D, Kim D, Liang J (2015) Improving the influence under IC-N model in social networks. Discrete Math Algorithms Appl 7:1550037

    Article  MathSciNet  Google Scholar 

  • Morone F, Min B, Bo L, Mari R, Makse HA (2016) Collective influence algorithm to find influencers via optimal percolation in massively large social media. Sci Rep 6:30062

    Article  Google Scholar 

  • Ni Y, Shi Q, Wei Z (2017) Optimizing influence diffusion in a social network with fuzzy costs for targeting nodes. J Ambient Intell Humaniz Comput 8:819–826

    Article  Google Scholar 

  • Qiu L, Jia W, Yu J, Fan X, Gao W (2019) PHG: a three-phase algorithm for influence maximization based on community structure. IEEE Access 7:62511–62522

    Article  Google Scholar 

  • Rossi M-EG, Shi B, Tziortziotis N, Malliaros FD, Giatsidis C, Vazirgiannis M (2018) MATI: an efficient algorithm for influence maximization in social networks. PLoS ONE 13:e0206318

    Article  Google Scholar 

  • Ruan Z, Iniguez G, Karsai M, Kertész J (2015) Kinetics of social contagion. Phys Rev Lett 115:218702

    Article  Google Scholar 

  • Samadi N, Bouyer A (2019) Identifying influential spreaders based on edge ratio and neighborhood diversity measures in complex networks. Computing 101:1147–1175

    Article  MathSciNet  Google Scholar 

  • Shang J, Zhou S, Li X, Liu L, Wu H (2017) CoFIM: a community-based framework for influence maximization on large-scale networks. Knowl-Based Syst 117:88–100

    Article  Google Scholar 

  • Wang X-G (2016) A new algorithm for the influence maximization problem in dynamic networks or traffic sensor networks. Multimedia Tools Appl 75:4833–4844

    Article  Google Scholar 

  • Wang Y, Cong G, Song G, Xie K (2010) Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 1039–1048

  • Wang C, Chen W, Wang Y (2012) Scalable influence maximization for independent cascade model in large-scale social networks. Data Min Knowl Disc 25:545–576

    Article  MathSciNet  Google Scholar 

  • Wang Q, Jin Y, Lin Z, Cheng S, Yang T (2016) Influence maximization in social networks under an independent cascade-based model. Phys A 444:20–34

    Article  MathSciNet  Google Scholar 

  • Xin Y, Gao C, Wang Z, Zhen X, Li X (2019) Discerning influential spreaders in complex networks by accounting the spreading heterogeneity of the nodes. IEEE Access 7:92070–92078

    Article  Google Scholar 

  • Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42:181–213

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Azarbaijan Shahid Madani University, Tabriz, Iran

    Hamid Ahmadi Beni & Asgarali Bouyer

Authors
  1. Hamid Ahmadi Beni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Asgarali Bouyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Asgarali Bouyer.

Additional information

Publisher's Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Beni, H.A., Bouyer, A. TI-SC: top-k influential nodes selection based on community detection and scoring criteria in social networks. J Ambient Intell Human Comput 11, 4889–4908 (2020). https://doi.org/10.1007/s12652-020-01760-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-020-01760-2

Keywords

Search

Navigation