Abstract
Complex software system will bring a lot of software security problems, it is very meaningful to know how to more accurately abstract the software network model from the software system and efficiently find the key nodes in the software network. This research takes open source software as the research object, constructs a directed network model of software system, proposes a new weight calculation method, adds weights to the model to form a directed weighted network, and then regards the software network as a complex network. The defect mining and defect propagation cost are two node mining methods related to the weight and degree of the node. At the same time, the PageRank algorithm is improved to mine the key nodes. Finally, the robustness of the software system execution network model is carried out by different attack methods. The evaluation, through experimental verification and comparison, shows that the mining method proposed in this study can more accurately and efficiently mine key nodes in the software system.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Li, Y., Zhang, Y., Deng, Y.: Degree centrality based on the weighted network. In: 24th Chinese Control and Decision Conference (CCDC), China, pp. 3976–3979. IEEE (2012)
Landherr, A., Friedl, B., Heidemann, J.: A critical review of centrality measures in social networks. Bus. Inf. Syst. Eng. 2(6), 371–385 (2010)
Kitsak, M., Havlin, S., Paul, G., et al.: Betweenness centrality of fractal and non-fractal scale-free model networks and tests on real networks. Phys. Rev. E 75(5), 056115 (2007)
Callaway, D.S., Newman, M.E.J., Strogatz, S.H., et al.: Network robustness and fragility: percolation on random graphs. Phys. Rev. Lett. 85(25), 5468–5471 (2000)
Freeman, L.C.: Centrality in Social Networks’ Conceptual Clarification. Soc. Netw. 1(3), 215–239 (1979)
Maharani, W., Gozali, A.A.: Degree centrality and eigenvector centrality in twitter. In: International Conference on Telecommunication Systems Services and Applications, pp. 1–5. IEEE (2015)
Kitsak, M., Gallos, L.K., Havlin, S., et al.: Identifying influential spreaders in complex networks. Nat. Phys. 6(11), 888–893 (2010)
Andersen, R., Chung, S.: Local graph partitioning using pagerank vectors. Soc. Netw. 12(4), 475–486 (2006)
Opsahl, T., Agneessens, F., Skvoretz, J.: Node centrality in weighted networks: generalizing degree and shortest paths. Soc. Netw. 32(3), 245–251 (2010)
Malik, H.A.M., Abid, F., et al.: Robustness of dengue complex network under targeted versus random attack. Complexity (2017). https://doi.org/10.1155/2017/2515928
Mahesar, A.W., Shah, A., Wahiddin, M.R.: Node status detection and information diffusion in router network using scale-free network. In: Proceedings of the 10th International Network Conference (INC 2014), p. 95, Lulu.com (2014)
Acknowledgement
This work was supported by the National Natural Science Foundation of China (Grant No. U1636115).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Shan, C., Wang, P., Hu, C., Gao, X., Mei, S. (2020). Research on Software Network Key Nodes Mining Methods Based on Complex Network. In: Han, W., Zhu, L., Yan, F. (eds) Trusted Computing and Information Security. CTCIS 2019. Communications in Computer and Information Science, vol 1149. Springer, Singapore. https://doi.org/10.1007/978-981-15-3418-8_14
Download citation
DOI: https://doi.org/10.1007/978-981-15-3418-8_14
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-3417-1
Online ISBN: 978-981-15-3418-8
eBook Packages: Computer ScienceComputer Science (R0)
