Identifying Important Nodes in Complex Networks Based on Multiattribute Evaluation

Table 2

List of contrast centrality indices in the experiments.

Indices	Calculation Process	Descriptions
Clustering Coefficient		Representing the degree of node aggregation in the network
k-shell		The node’s degree is greater than or equal to its value
		Calculating the sum of the values of the multilevel neighbor set
		Consisting of the degree of the node and its neighborhoods and r is a tuning parameter to regulate the degree
		Extending the weight degree centrality
		Taking the values as the qualities and taking the shortest distance as their distance based on classical gravity formula
SL		Considering the sum of the degree of both the nearest and the next nearest neighbors