Skip to main content

Advertisement

SpringerLink
Log in

Minimum positive influence dominating set and its application in influence maximization: a learning automata approach

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

In recent years, with the rapid development of online social networks, an enormous amount of information has been generated and diffused by human interactions through online social networks. The availability of information diffused by users of online social networks has facilitated the investigation of information diffusion and influence maximization. In this paper, we focus on the influence maximization problem in social networks, which refers to the identification of a small subset of target nodes for maximizing the spread of influence under a given diffusion model. We first propose a learning automaton-based algorithm for solving the minimum positive influence dominating set (MPIDS) problem, and then use the MPIDS for influence maximization in online social networks. We also prove that by proper choice of the parameters of the algorithm, the probability of finding the MPIDS can be made as close to unity as possible. Experimental simulations on real and synthetic networks confirm the superiority of the algorithm for finding the MPIDS Experimental results also show that finding initial target seeds for influence maximization using the MPIDS outperforms well-known existing algorithms.

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

Similar content being viewed by others

References

  1. Watts DJ, Strogatz SH (1998) Collective dynamics of “small-world” networks. Nature 393:440–442

    Article  MATH  Google Scholar 

  2. Fortunato S (2010) Community detection in graphs. Phys Rep 486:75–174

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. 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

  5. Wang F, Camacho E, Xu K (2009) Positive influence dominating set in online social networks. In: Combinatorial optimization and applications, pp 313–321

  6. Wang F, Du H, Camacho E et al (2011) On positive influence dominating sets in social networks. Theor Comput Sci 412:265–269

    Article  MathSciNet  MATH  Google Scholar 

  7. Raei H, Yazdani N, Asadpour M (2012) A new algorithm for positive influence dominating set in social networks. In: Proceedings of the 2012 international conference on advances in social networks analysis and mining (ASONAM 2012). IEEE, pp 253257

  8. Zhang W, Wu W, Wang F, Xu K (2012) Positive influence dominating sets in power-law graphs. Soc Netw Anal Min 2:31–37

    Article  Google Scholar 

  9. Dinh TN, Shen Y, Nguyen DT, Thai MT (2014) On the approximability of positive influence dominating set in social networks. J Comb Optim 27:487–503

    Article  MathSciNet  MATH  Google Scholar 

  10. Wang G, Wang H, Tao X, Zhang J (2014) Finding weighted positive influence dominating set to make impact to negatives: a study on online social networks in the new millennium. In: ICTs and the millennium development goals. Springer, pp 67–80

  11. Java A, Kolari P, Finin T, Oates T (2006) Modeling the spread of influence on the blogosphere. In: Proceedings of the 15th international world wide web conference, pp 22–26

  12. Kimura M, Saito K, Nakano R, Motoda H (2010) Extracting influential nodes on a social network for information diffusion. Data Min Knowl Disc 20:70–97

    Article  MathSciNet  Google Scholar 

  13. Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, pp 61–70

  14. 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

  15. Liu B, Cong G, Zeng Y et al (2014) Influence spreading path and its application to the time constrained social influence maximization problem and beyond. IEEE Trans Knowl Data Eng 26:1904–1917

    Article  Google Scholar 

  16. Xu W, Lu Z, Wu W, Chen Z (2014) A novel approach to online social influence maximization. Soc Netw Anal Min 4:1–13

    Article  Google Scholar 

  17. Lee J-R, Chung C-W (2015) A query approach for influence maximization on specific users in social networks. IEEE Trans Knowl Data Eng 27:340–353

    Article  Google Scholar 

  18. Brin S, Page L (1998) The anatomy of a large-scale hypertextual Web search engine. Comput Netw ISDN Syst 30:107–117

    Article  Google Scholar 

  19. Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. J ACM (JACM) 46:604–632

    Article  MathSciNet  MATH  Google Scholar 

  20. Lü L, Zhou T, Zhang Q-M, Stanley HE (2016) The H-index of a network node and its relation to degree and coreness. Nat Commun 7:10168

    Article  Google Scholar 

  21. Leskovec J, Krause A, Guestrin C et al (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

  22. Goyal A, Lu W, Lakshmanan LV (2011) 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

  23. Kelleher LL, Cozzens MB (1988) Dominating sets in social network graphs. Math Soc Sci 16:267–279

    Article  MathSciNet  MATH  Google Scholar 

  24. Molnár F, Sreenivasan S, Szymanski BK, Korniss G (2013) Minimum dominating sets in scale-free network ensembles. Sci Rep 3:1736

    Article  Google Scholar 

  25. Basuchowdhuri P, Majumder S (2014) Finding influential nodes in social networks using minimum k-hop dominating set. In: International conference on applied algorithms. Springer, pp 137– 151

  26. Kim D, Li D, Asgari O et al (2013) A dominating set based approach to identify effective leader group of social network. In: International computing and combinatorics conference. Springer, pp 841–848

  27. Kanté MM, Limouzy V, Mary A, Nourine L (2011) Enumeration of minimal dominating sets and variants. In: International symposium on fundamentals of computation theory. Springer, pp 298–309

  28. Torkestani JA, Meybodi MR (2012) Finding minimum weight connected dominating set in stochastic graph based on learning automata. Inform Sci 200:57–77

    Article  MathSciNet  MATH  Google Scholar 

  29. Chvatal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4:233–235

    Article  MathSciNet  MATH  Google Scholar 

  30. Johnson DS (1974) Approximation algorithms for combinatorial problems. J Comput Syst Sci 9:256–278

    Article  MathSciNet  MATH  Google Scholar 

  31. Slavík P (1996) A tight analysis of the greedy algorithm for set cover. In: Proceedings of the twenty-eighth annual ACM symposium on theory of computing. ACM, pp 435–441

  32. Nieberg T, Hurink J (2005) A PTAS for the minimum dominating set problem in unit disk graphs. In: International workshop on approximation and online algorithms. Springer, pp 296–306

  33. Nacher JC, Akutsu T (2013) Analysis on critical nodes in controlling complex networks using dominating sets. In: 2013 International conference on signal-image technology & internet-based systems (SITIS). IEEE, pp 649–654

  34. Narendra KS, Thathachar MA (1989) Learning automata: an introduction. Prentice-Hall

  35. Damerchilu B, Norouzzadeh MS, Meybodi MR (2016) Motion estimation using learning automata. Mach Vis Appl 27:1047–1061

    Article  Google Scholar 

  36. Mofrad MH, Sadeghi S, Rezvanian A, Meybodi MR (2015) Cellular edge detection: combining cellular automata and cellular learning automata. AEU-Int J Electron Commun 69:1282–1290

    Article  Google Scholar 

  37. Rezvanian A, Meybodi MR (2015) Finding minimum vertex covering in stochastic graphs: a learning automata approach. Cybern Syst 46:698–727

    Article  MATH  Google Scholar 

  38. Kordestani JK, Ahmadi A, Meybodi MR (2014) An improved differential evolution algorithm using learning automata and population topologies. Appl Intell 41:1150–1169

    Article  Google Scholar 

  39. Mahdaviani M, Kordestani JK, Rezvanian A, Meybodi MR (2015) LADE: learning automata based differential evolution. Int J Artif Intell Tools 24:1550023

    Article  Google Scholar 

  40. Meybodi MRM, Meybodi MR (2014) Extended distributed learning automata. Appl Intell 41:923–940

    Article  MATH  Google Scholar 

  41. Rezvanian A, Meybodi MR (2016) Stochastic graph as a model for social networks. Comput Hum Behav 64:621–640

    Article  Google Scholar 

  42. Rezvanian A, Meybodi MR (2015) Finding maximum clique in stochastic graphs using distributed learning automata. Int J Uncerty Fuzz Knowl-Based Syst 23:1–31

    Article  MathSciNet  MATH  Google Scholar 

  43. Esnaashari M, Meybodi MR (2013) Deployment of a mobile wireless sensor network with k-coverage constraint: a cellular learning automata approach. Wirel Netw 19:945–968

    Article  Google Scholar 

  44. Elyasi M, Meybodi M, Rezvanian A, Haeri MA (2016) A fast algorithm for overlapping community detection. In: 2016 Eighth International conference on information and knowledge technology (IKT), pp 221–226

  45. Khomami MMD, Rezvanian A, Meybodi MR (2016) Distributed learning automata-based algorithm for community detection in complex networks. Int J Modern Phys B 30:1650042

    Article  MathSciNet  Google Scholar 

  46. Rezvanian A, Meybodi MR (2017) A new learning automata-based sampling algorithm for social networks. Int J Commun Syst 30:e3091

    Article  Google Scholar 

  47. Rezvanian A, Meybodi MR (2017) Sampling algorithms for stochastic graphs: a learning automata approach. Knowl-Based Syst in-press:1–19

  48. Mofrad MH, Jalilian O, Rezvanian A, Meybodi MR (2016) Service level agreement based adaptive grid superscheduling. Futur Gener Comput Syst 55:62–73

    Article  Google Scholar 

  49. Morshedlou H, Meybodi MR (2014) Decreasing impact of SLA violations: a proactive resource allocation approach for cloud computing environments. IEEE Trans Cloud Comput 2:156–167

    Article  Google Scholar 

  50. Vahidipour SM, Meybodi MR, Esnaashari M (2017) Adaptive Petri net based on irregular cellular learning automata with an application to vertex coloring problem. Appl Intell 46:272–284

    Article  MATH  Google Scholar 

  51. Masoumi B, Meybodi MR (2011) Speeding up learning automata based multi agent systems using the concepts of stigmergy and entropy. Expert Syst Appl 38:8105–8118

    Article  Google Scholar 

  52. Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25:163–177

    Article  MATH  Google Scholar 

  53. Freeman LC (1979) Centrality in social networks conceptual clarification. Soc Netw 1:215–239

    Article  Google Scholar 

  54. Torkestani JA, Meybodi MR (2011) A link stability-based multicast routing protocol for wireless mobile ad hoc networks. J Netw Comput Appl 34:1429–1440

    Article  Google Scholar 

  55. Lakshmivarahan S, Thathachar MAL (1976) Bounds on the convergence probabilities of learning automata. IEEE Trans Syst Man Cybern-Part A: Syst Humans 6:756–763

    MathSciNet  MATH  Google Scholar 

  56. Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 452–473

  57. Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99:7821–7826

    Article  MathSciNet  MATH  Google Scholar 

  58. Lusseau D, Schneider K, Boisseau OJ, et al. (2003) The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54:396–405

    Article  Google Scholar 

  59. Gleiser PM, Danon L (2003) Community structure in jazz. Adv Complex Syst 6:565–573

    Article  Google Scholar 

  60. Zeng A, Zhang C-J (2013) Ranking spreaders by decomposing complex networks. Phys Lett A 377:1031–1035

    Article  Google Scholar 

  61. Yeruva S, Devi T, Reddy YS (2016) Selection of influential spreaders in complex networks using Pareto Shell decomposition. Physica A: Stat Mech Appl 452:133–144

    Article  Google Scholar 

  62. Toothaker LE (1993) Multiple comparison procedures. Sage

Download references

Author information

Authors and Affiliations

  1. Computer Engineering and Information Technology Department, Islamic Azad University, Qazvin Branch, Qazvin, Iran

    Mohammad Mehdi Daliri Khomami

  2. Soft Computing Laboratory, Computer Engineering and Information Technology Department, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran

    Alireza Rezvanian & Mohammad Reza Meybodi

  3. Department of Computer Engineering and Information Technology, Hamedan University of Technology, Hamedan, Iran

    Alireza Rezvanian

  4. Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran

    Negin Bagherpour

Authors
  1. Mohammad Mehdi Daliri Khomami
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alireza Rezvanian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Negin Bagherpour
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mohammad Reza Meybodi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohammad Mehdi Daliri Khomami.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Daliri Khomami, M.M., Rezvanian, A., Bagherpour, N. et al. Minimum positive influence dominating set and its application in influence maximization: a learning automata approach. Appl Intell 48, 570–593 (2018). https://doi.org/10.1007/s10489-017-0987-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-017-0987-z

Keywords

Search

Navigation