Identification of important nodes on large-scale Internet based on unsupervised learning

In recent years, scholars have conducted in-depth researches on the robustness, structural vulnerability, and detection and identification of devices in cyberspace from different perspectives such as complex networks and cyberspace resource mapping. Aiming at the problem of identifying important nodes on a large-scale Internet, a CETCRank algorithm for identifying important Internet nodes based on unsupervised learning is proposed. When the algorithm analyzes the attributes of each cyberspace equipment, it not only considers the graph structure characteristics based on the network topology, but also integrates the threat metric of cyberspace equipment. Based on the hypothesis of the cyber attack model, the effective identification of important nodes in the Internet can be realized by integrating the node attributes into the constructed Markov chain model. Experiments show that the time and space complexity of the CETCRank algorithm is suitable for analyzing large-scale Internet, and the recognition performance of important nodes is better than the PageRank algorithm.

[1]  Paul Coulton,et al.  Extending cyberspace: location based games using cellular phones , 2006, CIE.

[2]  Yi-Cheng Zhang,et al.  Leaders in Social Networks, the Delicious Case , 2011, PloS one.

[3]  M. Zelen,et al.  Rethinking centrality: Methods and examples☆ , 1989 .

[4]  Duanbing Chen,et al.  Vital nodes identification in complex networks , 2016, ArXiv.

[5]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[6]  L. Freeman Centrality in social networks conceptual clarification , 1978 .

[7]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[8]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[9]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[10]  P. Bonacich Factoring and weighting approaches to status scores and clique identification , 1972 .

[11]  Béla Genge,et al.  ShoVAT: Shodan-based vulnerability assessment tool for Internet-facing services , 2016, Secur. Commun. Networks.

[12]  Zhang Guoqiang,et al.  Research on Internet Correlation , 2006 .

[13]  Shou-De Lin,et al.  Unsupervised Ranking using Graph Structures and Node Attributes , 2017, WSDM.

[14]  Yicheng Zhang,et al.  Identifying influential nodes in complex networks , 2012 .

[15]  F. Harary,et al.  Eccentricity and centrality in networks , 1995 .

[16]  Marie-Claude Boily,et al.  Dynamical systems to define centrality in social networks , 2000, Soc. Networks.

[17]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[18]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.