Skip to main content
SpringerLink
Log in

Identifying Vital Nodes in Social Networks Using an Evidential Methodology Combining with High-Order Analysis

  • Conference paper
  • First Online:
Data Science (ICPCSEE 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1257))

  • 1211 Accesses

Abstract

Identifying vital nodes is a basic problem in social network research. The existing theoretical framework mainly focuses on the lower-order structure of node-based and edge-based relations and often ignores important factors such as interactivity and transitivity between multiple nodes. To identify the vital nodes more accurately, a high-order structure, named as the motif, is introduced in this paper as the basic unit to evaluate the similarity among the node in the complex network. It proposes a notion of high-order degree of nodes in complex network and fused the effect of the high-order structure and the lower-order structure of nodes, using evidence theory to determine the vital nodes more efficiently and accurately. The algorithm was evaluated from the function of network structure. And the SIR model was adopted to examine the spreading influence of the nodes ranked. The results of experiments in different datasets demonstrate that the algorithm designed can identify vital nodes in the social network accurately.

Supported by the Natural Science Foundation of China (No. 61662066, 61163010).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Zhang, J., Tang, J.: Survey of social influence analysis and modeling. Sci. Sin. Inform. 47, 967–979 (2017) (in Chinese). https://doi.org/10.1360/N112017-00137

  2. Han, Z.M., Chen, Y., Liu, W., Yuan, B.H., Li, M.Q., Duan, D.G.: Research on node influence analysis in social networks. Ruan Jian Xue Bao/J. Softw. 28(1), 84–104 (2017). (in Chinese). http://www.jos.org.cn/1000-9825/5115.htm

  3. Wasserman, S.: Social network analysis methods and applications. Contemp. Sociol. 91(435), 219–220 (1995)

    Google Scholar 

  4. Bonacich, P.F.: Factoring and weighting approaches to status scores and clique identification. J. Math. Sociol. 2(1), 113–120 (1972)

    Article  Google Scholar 

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

    Article  Google Scholar 

  6. Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35–41 (1977)

    Article  Google Scholar 

  7. Gao, C., Wei, D., Hu, Y., et al.: A modified evidential methodology of identifying influential nodes in weighted networks. Phys. A 392(21), 5490–5500 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chen, D., Lü, L., Shang, M., et al.: Identifying influential nodes in complex networks. Phys. A 391(4), 1777–1787 (2012)

    Article  Google Scholar 

  9. Wei, D., Deng, X., Zhang, X., et al.: Identifying influential nodes in weighted networks based on evidence theory. Phys. A 392(10), 2564–2575 (2013)

    Article  Google Scholar 

  10. Benson, A.R., Gleich, D.F., Leskovec, J.: Higher-order organization of complex networks. Science 353(6295), 163–166 (2016)

    Article  Google Scholar 

  11. Benson, A.R.: Tools for higher-order network analysis (2018)

    Google Scholar 

  12. Milo, R.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824–827 (2002)

    Article  Google Scholar 

  13. Shen-Orr, S.S., Milo, R., Mangan, S., et al.: Network motifs in the transcriptional regulation network of Escherichia coli. Nat. Genet. 31(1), 64–68 (2002)

    Article  Google Scholar 

  14. Yin, H., Benson, A.R., Leskovec, J., et al.: Local higher-order graph clustering. In: KDD 2017, pp. 555–564 (2017)

    Google Scholar 

  15. Zhao, H., Xiaogang, X., Yangqiu, S., et al.: Ranking users in social networks with higher-order structures. In: AAAI (2018)

    Google Scholar 

  16. Shafer, G.: A Mathematical Theory of Evidence. by Glenn Shafer, vol. 73, no. 363, pp. 677–678 (1978)

    Google Scholar 

  17. Dempster, A.P.: Upper and lower probabilities induced by a multivalued mapping. Ann. Math. Stat. 38(2), 325–339 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  18. Schank, T., Wagner, D.: Finding, counting and listing all triangles in large graphs, an experimental study, vol. 3503, pp. 606–609. Springer, Heidelberg (2005)

    Google Scholar 

  19. Ren, X.L., Lü, L.Y.: Review of ranking nodes in complex networks. Chin. Sci. Bull. (Chin. Ver.) 59(1197), 1175–1280 (2014) (in Chinese). https://doi.org/10.1360/72013-1280

  20. Yan, G., Zhang, M., Luo, H., et al.: Identifying vital nodes algorithm in social networks fusing higher-order information. J. Commun. 40(10), 109–118 (2019). (in Chinese)

    Google Scholar 

  21. Bian, T., Deng, Y.: A new evidential methodology of identifying influential nodes in complex networks. Chaos Solitons Fract. 103, 101–110 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  22. Kunegis, J.: KONECT - the koblenz network collection. In: Proceedings of the International Conference on World Wide Web Companion, pp. 1343–1350 (2013)

    Google Scholar 

  23. Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: CHI 2010 (2010)

    Google Scholar 

  24. Richardson, M., Agrawal, R., Domingos, P.: Trust management for the semantic web. In: ISWC (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electronic and Information Engineering, Lanzhou Jiaotong University, Lanzhou, 730070, China

    Meng Zhang, Guanghui Yan, Yishu Wang & Ye Lv

Authors
  1. Meng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guanghui Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yishu Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ye Lv
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guanghui Yan .

Editor information

Editors and Affiliations

  1. North University of China, Taiyuan, China

    Jianchao Zeng

  2. Northeast Forestry University, Harbin, China

    Weipeng Jing

  3. Harbin University of Science and Technology, Harbin, China

    Xianhua Song

  4. National Academy of Guo Ding Institute of Data Science, Beijing, China

    Zeguang Lu

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, M., Yan, G., Wang, Y., Lv, Y. (2020). Identifying Vital Nodes in Social Networks Using an Evidential Methodology Combining with High-Order Analysis. In: Zeng, J., Jing, W., Song, X., Lu, Z. (eds) Data Science. ICPCSEE 2020. Communications in Computer and Information Science, vol 1257. Springer, Singapore. https://doi.org/10.1007/978-981-15-7981-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-7981-3_8

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-7980-6

  • Online ISBN: 978-981-15-7981-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation