Skip to main content

An Efficient Algorithm for Influence Maximization Based on Propagation Path Analysis

  • Conference paper
  • First Online:
Advances in Computer Science and Ubiquitous Computing (CUTE 2017, CSA 2017)

Abstract

The problem of influence maximization is to find a subset of nodes in a social network which can make the influence spreading maximized. Although traditional centrality measures can better identify the influential nodes, there are still some disadvantages and limitations. In this paper, we firstly propose a propagation path model which can find m paths with the highest probability from a certain node to other nodes in the network. Then utilizing the propagation model, the node set that are most likely to activate a certain node can be obtained. By implementing simulations in three real networks, we verify that our proposed algorithm can outperform well-known centrality measures. We also use the independent cascade model (IC) to evaluate the spreading ability of nodes with different centrality measures. In comparison with traditional centrality methods, our method is more stable and generally applicable. Besides, we apply PPA method extended to signed networks where we proposed PPAS method, through the experiments on real data sets, our PPAS method has the better performance in identifying the state of the nodes in networks.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Morone, F., Makse, H.A.: Influence maximization in complex networks through optimal percolation. Nature 254, 65–68 (2015)

    Article  Google Scholar 

  2. Gao, S., Ma, J., Chen, Z., Wang, G., Xing, C.: Ranking the spreading ability of nodes in complex networks based on local structure. Phys. A 403, 30–47 (2014)

    Article  Google Scholar 

  3. Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215–239 (1979)

    Article  MathSciNet  Google Scholar 

  4. Sabidussi, G.: The centrality index of a graph. Psychometrika 31(4), 581–603 (1966)

    Article  MathSciNet  Google Scholar 

  5. Deng, Y.: Deng entropy. Chaos, Solitons Fractals 91, 49–53 (2016)

    Article  Google Scholar 

  6. Jiang, W., Wei, B., Xie, C., Zhou, D.: An evidential sensor fusion method in fault diagnosis. Mech. Eng. 8(3), 1–7 (2016)

    Article  Google Scholar 

  7. Jiang, W., Wei, B., Xie, C., Zhou, D.: A modified method for risk evaluation in failure modes and effects analysis of aircraft turbine rotor blades. Mech. Eng. 8(4), 1–7 (2016)

    Article  Google Scholar 

  8. Deng, Y.: Generalized evidence theory. Appl. Intell. 43(3), 30–43 (2015)

    Google Scholar 

  9. Jiang, W., Zhan, J.: A modified combination rule in generalized evidence theory. Appl. Intell. 1–11 (2016)

    Google Scholar 

  10. Jiang, W., Xie, C., Zhuang, M., Shou, Y., Tang, Y.: Sensor data fusion with z-numbers and its application in fault diagnosis. Sensors 16(9), 1509 (2016)

    Article  Google Scholar 

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

    Google Scholar 

  12. Bogu, M., Pastor-Satorras, R., Díaz-Guilera, A., Arenas, A.: Models of social networks based on social distance attachment. Physica. E, 70(5), 056122 (2004)

    Google Scholar 

Download references

Acknowledgments

This research was supported in part by the Chinese National Natural Science Foundation under grant Nos. 61702441, 61772454, 61379066, 61602202, 61379064, 61472344, 61402395, Natural Science Foundation of Jiangsu Province under contracts BK20160428.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wei Liu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Liu, W., Chen, X., Chen, B., Wang, J., Chen, L. (2018). An Efficient Algorithm for Influence Maximization Based on Propagation Path Analysis. In: Park, J., Loia, V., Yi, G., Sung, Y. (eds) Advances in Computer Science and Ubiquitous Computing. CUTE CSA 2017 2017. Lecture Notes in Electrical Engineering, vol 474. Springer, Singapore. https://doi.org/10.1007/978-981-10-7605-3_133

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-7605-3_133

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-7604-6

  • Online ISBN: 978-981-10-7605-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics