Considering the shortcomings of the existing network key node identification methods based on multiattribute fusion, which have single evaluation methods and low decision accuracy, combined with the advantages of the… Click to show full abstract
Considering the shortcomings of the existing network key node identification methods based on multiattribute fusion, which have single evaluation methods and low decision accuracy, combined with the advantages of the high accuracy of TOPSIS (Technique for Order Preference by Similarity to an Ideal Solution) algorithm and the applicability of grey relational analysis method for incomplete information evaluation, the concept of relative closeness is proposed, and nodes are ranked in importance based on the relative closeness; a key node identification method algorithm based on improved multiattribute fusion is designed. First, the identification problem of key nodes is transformed into multiattribute decision-making method, and the decision matrix is obtained. Second, the weighting matrix is obtained by weighting them in both subjective and objective dimensions, the relative closeness is calculated for the weighting matrix. Finally, sort the network nodes by relative closeness, and network performance simulation experiments are designed using various combinations of evaluation methods and key node identification methods. The simulation results show that this method is more adaptable and improves the identification accuracy of the network key nodes.
               
Click one of the above tabs to view related content.