Skip to main content
SpringerLink
Log in

An Evaluation Algorithm for Importance of Dynamic Nodes in Social Networks Based on Three-Dimensional Grey Relational Degree

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

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

  • 1720 Accesses

Abstract

The importance assessment of dynamic nodes in social networks has been a very challenging problem in the field of social network research. This paper creatively adopts the three-dimensional grey relational degree algorithm, introduces the dimension of time based on the attributes of nodes and nodes, and realizes the screening of important nodes in the dynamic social network. Finally, the algorithm is verified by Facebook data set for three consecutive months, and compared with the result of TOPSIS algorithm, which shows that this algorithm is more practical and accurate.

This work is supported by National Nature Science Foundation of China (No. 61572521), Research Project of Military Science (No. 16QJ003-097).

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Wang, L., Cheng, X.Q.: Dynamic community in online social networks. Chin. J. Comput. 38(2), 219–237 (2015)

    MathSciNet  Google Scholar 

  2. Wang, Z., Du, C., Fan, J., et al.: Ranking influential nodes in social networks based on node position and neighborhood. Neurocomputing 260, 466–2477 (2017)

    Article  Google Scholar 

  3. Shimbel, A.: Structural parameters of communication networks. Bull. Math. Biophys. 15(4), 501–507 (1953)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  6. Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163–177 (2001). Social networks betweenness centrality algorithms

    Article  Google Scholar 

  7. Newman, M.E.J.: A measure of betweenness centrality based on random walks. Soc. Netw. 27(1), 39–54 (2005)

    Article  Google Scholar 

  8. Bian, T., Hu, J., Deng, Y.: Identifying influential nodes in complex networks based on AHP. Physica A 479(4), 422–436 (2017)

    Article  MathSciNet  Google Scholar 

  9. Yannick, R.: Closeness centrality extended to unconnected graphs: the harmonic centrality index ASNA, pp. 1–14 (2009)

    Google Scholar 

  10. Du, Y., Gao, C., Hu, Y., et al.: A new method of identifying influential nodes in complex networks based on TOPSIS[J]. Physica A 399(4), 57–69 (2014)

    Article  Google Scholar 

  11. Song, G., Li, Y., Chen, X., et al.: Influential node tracking on dynamic social network: an interchange greedy approach. IEEE Trans. Knowl. Data Eng. 29(2), 359–372 (2017)

    Article  Google Scholar 

  12. Wang, Z.X., Dang, Y.G., Shen, C.G.: Three-dimensional grey relational model and its application. Statist. Decis. 15, 174–176 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic Technology, Armed Police Engineering University, Xian, 710000, China

    Xiaolong Li, Yiliang Han, Deyang Zhang & Xuguang Wu

Authors
  1. Xiaolong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yiliang Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Deyang Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xuguang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaolong Li .

Editor information

Editors and Affiliations

  1. Zhengzhou University, Zhengzhou, Henan, China

    Qinglei Zhou

  2. Xidian University, Xi’an, Shaanxi, China

    Qiguang Miao

  3. Harbin Institute of Technology, Harbin, China

    Hongzhi Wang

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

    Wei Xie

  5. Zhengzhou Institute of Technology, Zhengzhou, China

    Yan Wang

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

    Zeguang Lu

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

Li, X., Han, Y., Zhang, D., Wu, X. (2018). An Evaluation Algorithm for Importance of Dynamic Nodes in Social Networks Based on Three-Dimensional Grey Relational Degree. In: Zhou, Q., Miao, Q., Wang, H., Xie, W., Wang, Y., Lu, Z. (eds) Data Science. ICPCSEE 2018. Communications in Computer and Information Science, vol 902. Springer, Singapore. https://doi.org/10.1007/978-981-13-2206-8_18

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-2206-8_18

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-2205-1

  • Online ISBN: 978-981-13-2206-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation