By Topic

Multi-index evaluation algorithm based on principal component analysis for node importance in complex networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
J. Jin ; Department of Computer Science, Central China Normal University, Wuhan 430079, People's Republic of China ; K. Xu ; N. Xiong ; Y. Liu
more authors

The evaluation of vital nodes in complex networks has been an increasing widespread concern in recent years. Seeking and protecting vital nodes is important to ensure the security and stability of the whole network. Presently, most of the existing evaluation algorithms cannot completely reflect the circumstances of complex networks because these algorithms are proposed based on a certain characteristic of the network, and the single metric is incomplete and limited. With that said, the development of a new algorithm that evaluates node importance in complex networks is critical. First, a number of classic ranking measures for evaluating vital nodes have been demonstrated in the present study. Second, basic concepts of complex networks have been summarised further. Third, a new multi-index evaluation algorithm based on principal component analysis has been proposed. The algorithm can reveal the simple structure behind the complex data, and has no parameter restrictions to represent the features of the data. The algorithm presented in the current study synthesises the topological characteristics of the network, such as degree centrality, betweenness centrality, closeness centrality, eigenvector centrality, mutual-information and local clustering coefficient to reflect the relative node importance. Finally, to verify the validity of the algorithm, a simulation experiment was conducted. The results indicated that the algorithm is more rational, effective, complete and accurate than the algorithm of single metric evaluation.

Published in:

IET Networks  (Volume:1 ,  Issue: 3 )