Open AccessKey nodes in complex networks identified by multi-attribute decision-making method
Author(s) -
Yu Hui,
Zun Liu,
Yongjun Li
Publication year - 2013
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.62.020204
Subject(s) - computer science , betweenness centrality , complex network , key (lock) , node (physics) , ranking (information retrieval) , closeness , data mining , variety (cybernetics) , rank (graph theory) , ideal (ethics) , theoretical computer science , artificial intelligence , centrality , mathematics , computer security , mathematical analysis , philosophy , structural engineering , epistemology , combinatorics , world wide web , engineering
In complex networks, it is significant how to rank the nodes according to their importance. Most of the existing methods of ranking key nodes (e.g. degree-based, betweenness-based) only consider one factor but not the integration of whole complex network in evaluating the importance of nodes, so those methods each have a limited application range. In this paper, a multi-attribute decision-making method to identify the key nodes in complex networks is proposed. In our method, each node is regarded as a solution, and each importance evaluation criterion as one solution's attribute. After that, we calculate the closeness between each solution and the ideal solution in order to obtain the integration results of node importance in complex networks. The proposed method can be used in a variety of complex networks. It is also easy to evaluate the importance evaluation criteria. Finally, experimental results show that the proposed method is effective.