Skip to main content

Advertisement

Springer Nature Link
Log in

Efficient algorithms for influence maximization in social networks

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

In recent years, due to the surge in popularity of social-networking web sites, considerable interest has arisen regarding influence maximization in social networks. Given a social network structure, the problem of influence maximization is to determine a minimum set of nodes that could maximize the spread of influences. With a large-scale social network, the efficiency and practicability of such algorithms are critical. Although many recent studies have focused on the problem of influence maximization, these works in general are time-consuming when a social network is large-scale. In this paper, we propose two novel algorithms, CDH-Kcut and Community and Degree Heuristic on Kcut/SHRINK, to solve the influence maximization problem based on a realistic model. The algorithms utilize the community structure, which significantly decreases the number of candidates of influential nodes, to avoid information overlap. The experimental results on both synthetic and real datasets indicate that our algorithms not only significantly outperform the state-of-the-art algorithms in efficiency but also possess graceful scalability.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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
Fig. 15
Fig. 16

Similar content being viewed by others

References

  1. Albert R, Jeong H, Barabasi A (1999) Diameter of the World Wide Web. Nature 401:130–131

    Article  Google Scholar 

  2. Barabasi A, Albert R (1999) Emergence of scaling in random networks. Science 286:509–512

    Article  MathSciNet  Google Scholar 

  3. Bortner D, Han J (2010) Progressive clustering of networks using structure—connected order of traversal. In: 26th IEEE international conference on data, engineering (ICDE’10), pp 653–656

  4. 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 (KDD’09), pp 199–208

  5. Danon L, Duch J, Diaz-Guilera A, Arenas A (2005) Comparing community structure identification. J Stat Mech Theory Exp 09:P09008

    Article  Google Scholar 

  6. Domingos P (2005) Mining social networks for viral marketing. IEEE Intell Syst 20(1):80–93

    Article  MathSciNet  Google Scholar 

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

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

  9. Ester M, Kriegel H, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of 2nd international conference on knowledge discovery and data Mining (KDD’96), pp 226–231

  10. Estevez P, Vera P, Saito K (2007) Selecting the most influential nodes in social network. In: Proceedings of the international joint conference on, neural networks (IJCNN’07), pp 2397–2402

  11. Feng Z, Xu X, Yuruk N, Schweiger T (2007) A novel similarity-based modularity function for graph partitioning. In: Proceedings of the 9th international conference on data warehousing and knowledge, discovery (DaWaK’07), pp 385–396

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

    Article  Google Scholar 

  13. Huang J, Sun H, Han J, Deng H, Sun Y, Liu Y (2010) SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks. In: Proceedings of the 19th ACM conference on information and, knowledge management (CIKM’10), pp 219–228

  14. Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining (KDD’03), pp 137–146

  15. Lancichinetti A, Fortnato S, Kertesz J (2009) Detecting the overlapping and hierarchical community structure in complex network. New J Phys 11(3):033015

    Article  Google Scholar 

  16. Lancichinetti A, Fortnato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110

    Article  Google Scholar 

  17. Ma H, Yang H, Lyu M, King I (2008) Mining social networks using heat diffusion processes for marketing candidates selection. In: Proceedings of the 17th ACM conference on information and, knowledge management (CIKM’08), pp 233–242

  18. Ng A, Jordan M, Weiss Y (2001) On spectral clustering: analysis and an algorithm. In: Neural information processing systems: natural and synthetic (NIPS 2001), pp 849–856

  19. Palla G, Derenyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435:814–818

    Article  Google Scholar 

  20. Rogers E (2003) Diffusion of innovations. Free Press, New York

    Google Scholar 

  21. Ruan J, Zhang W (2007) An efficient spectral algorithm for network community discovery and its applications to biological and social networks. In: Proceedings of the 7th IEEE international conference on data mining (ICDM’07), pp 643–648

  22. Saito K, Kimura M, Ohara K, Motoda H (2011) Efficient discovery of influential nodes for SIS models in social networks. Knowl Inf Syst 30(3):613–635

    Article  Google Scholar 

  23. Valente T (1995) Network models of the diffusion of innovations. Hampton Press, Cresskill

    Google Scholar 

  24. Wan L, Liao J, Zhu X (2008) Finding and evaluating community structure in social networks. In: Proceedings of the 4th international conference on advanced data mining and applications (ADMA’08), pp 620–627

  25. Wang Y, Feng X (2009) A potential-based node selection strategy for influence maximization in a social network. In: Proceedings of the 5th international conference on advanced data mining and applications (ADMA’09), pp 350–361

  26. Wasserman S, Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, Cambridge

    Book  Google Scholar 

  27. White S, Smyth P (2005) A spectral clustering approach to finding communities in graph. In: Proceedings of the 5th SIAM international conference on data mining (SDM’05), pp 274–286

  28. Xu X, Yuruk N, Feng Z, Schweiger T (2007) SCAN: a structural clustering algorithm for networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining (KDD’07), pp 824–833

  29. Young H (2000) The diffusion of innovations in social networks. The Johns Hopkins University, economics working paper 437

  30. Zachary W (1997) An information flow model for conflict and fission in small group. J Anthropol Res 33:452–473

    Google Scholar 

Download references

Acknowledgments

Suh-Yin Lee was supported by the National Science Council, Project No. NSC99-2221-E-009-128-MY2. Wen-Chih Peng was supported in part by the National Science Council, Project No. 100-2218-E-009-016-MY3 and 100-2218-E-009-013-MY3, by Taiwan MoE ATU Program, by ITRI JRC, Project No. B352BW3300, by D-Link and by Microsoft.

Author information

Authors and Affiliations

  1. Department of Computer Science, National Chiao Tung University, Hsinchu, 300, Taiwan

    Yi-Cheng Chen, Wen-Chih Peng & Suh-Yin Lee

Authors
  1. Yi-Cheng Chen
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Wen-Chih Peng
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Suh-Yin Lee
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Yi-Cheng Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, YC., Peng, WC. & Lee, SY. Efficient algorithms for influence maximization in social networks. Knowl Inf Syst 33, 577–601 (2012). https://doi.org/10.1007/s10115-012-0540-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-012-0540-7

Keywords