Identification of Influential Nodes via Effective Distance-based Centrality Mechanism in Complex Networks

. Eﬃcient identiﬁcation of inﬂuential nodes is one of the essential aspects in the ﬁeld of complex networks, which has excellent theoretical and practical signiﬁcance in the real world. A valuable number of approaches have been developed and deployed in these areas where just a few have used centrality measures along with their concerning deﬁciencies and limitations in their studies. Therefore, to resolve these challenging issues, we propose a novel eﬀective distance-based centrality (EDBC) algorithm for the identiﬁcation of inﬂuential nodes in concerning networks. EDBC algorithm comprises factors such as the power of K-shell, degree nodes, eﬀective distance, and numerous levels of neighbor’s inﬂuence or neighborhood potential. The performance of the proposed algorithm is evaluated on nine real-world networks, where a susceptible infected recovered (SIR) epidemic model is employed to examine the spreading dynamics of each node. Simulation results demonstrate that the proposed algorithm outperforms the existing techniques such as eigenvector, betweenness, closeness centralities, hyperlink-induced topic search, H-index, K-shell, page rank, proﬁt leader, and gravity over a valuable margin.


Introduction
In recent years, complex networks are an attractive and hot research area by virtue of its wide range of practical and theoretical applications in many major fields [1][2][3][4][5]. Several real-world application areas such as management science, chemistry, economics, and financial systems [6,7], computer science, biological science [8,9], and many other similar fields can be regarded as complex networks [10,11]. Finding the most important nodes is helpful to efficiently analyze the entire network, such as controlling the spreading of disease, detecting the most vital node of the disease transmission rapidly can control the spreading of disease, and erecting a new marketing tool [12][13][14][15]. Some of the existing commonly used approaches to identify the influential nodes are closeness centrality (CC) [16], degree centrality (DC) [17], betweenness centrality (BC) [18], information centrality (IC) [19], load centrality(LC) [20], eigenvector centrality(EC) [21], page rank (PR) [22], H-index [23], K-shell decomposition, hyperlink-induced topic search (HITS) [24,25], and so on. Several algorithms are usually not precise, but precise algorithms have comparatively high computational time complexity. For example, DC is a very simple method of finding influential nodes, but it only considers limited information. erefore, it is not suitable in some cases. Similarly, BC and CC are not applicable in large networks because of their high computation time complexity. PR is based on global information, so it works very well in directed networks but is not suitable for undirected ones [26]. Similarly, the K-shell algorithm takes into account the core or periphery position of the nodes in the networks to investigate influential nodes. It is a straightforward index mechanism for finding the influential nodes; due to its low complexity, it can be applied in large-scale networks, although it cannot differentiate among the key nodes in the same core layer [27][28][29]. All in all, the above existing approaches have low accuracy of ranking and are ineffective for some networks. ere are numerous ranking approaches for influential or key nodes identification, but it is not easy to find all influential nodes. Frequently, two types of models are used to evaluate ranking results of important nodes: (i) SIR model [30] and (ii) Kendall's correlation coefficient τ [31]. e main job of the SIR model is to choose the top-k ranking node's results as seed nodes. When the selected seed nodes or vertices of a technique make the flow of network spread faster, then the technique is said to be better than the other techniques. For measurement between two ranking results, Kendall's correlation coefficient τ is used. If Kendall's correlation coefficient τ is positive, then it means the two rankings are positively correlated, and if Kendall's correlation coefficient τ is negative, then the two rankings are negatively correlated. If the coefficient is 1, it means the rankings are the same, and if it is -1, it means the rankings are completely opposite. e technique is said to be more accurate when Kendall's correlation coefficient τ is higher. From the above discussion, we propose a new, efficient, and effective method termed as EDBC algorithm for key or influential nodes identification in complex networks. EDBC comprises effective distance, K-shell, nodes degree, and many other levels of neighbor influences or neighborhood potential-like factors. We applied EDBC on nine different real-world networks. e simulation results proved that our algorithm is better than other conventional algorithms, including newly developed algorithms such as gravity centrality and profit leader, which were, respectively, developed in 2017 and 2018. e core contribution of the proposed EDBC algorithm is summarized as follows. (1) A new ranking centrality perspective: from the last two decades, several models and algorithms regarding the identification of influential or key nodes have been developed but still it is a challenge. In this regard, we propose a novel effective distance-based centrality algorithm which is comprising of several features to have experimented on unweighted networks and structure to sort out the important nodes. (2) Accuracy: we have compared the proposed algorithm with various ranking methods where experiments have shown that EDBC is comparatively more effective and efficient algorithm.
rough rendering comprehensive experiments on nine real-world networks, the EDBC has outperformed various existing algorithms such as BC, CC, EC, PR, HITS, H-index, K-shell, GR, and PL. (3) Parameter-free : the proposed EDBC neither depends on prior knowledge nor relies on adjustments of parameters. It has its own way to quickly and efficiently identifying the key nodes. (4) Applicability: the proposed EDBC reduces the calculation cost as its basis on twostage neighbor nodes. erefore, its application is appropriate on any type of networks, i.e., directed or undirected networks. e rest of this paper is organized as follows. In Section 2, we present overviews of the related work. In Section 3, we discuss the proposed EDBC algorithm, whereas its performance evolution is discussed in Section 4. Finally, we elaborate conclusion and future recommendations in Section 5.

Related Work
e criterion of detecting the most important nodes in complex networks is one of the challenging issues from the past few decades. Two types of centrality measures can be used for identification of key nodes, i.e., (i) matrix-based centrality such as random walk matrix [32], Laplacian matrix [33], and adjacency matrix [34] (ii) superficial-based properties such as CC, BC, DC, and motif centrality measurement [35]. Currently, a vast number of studies have been offered regarding the identification of the key nodes, e.g., node removals, profit leader [36], and local neighbor contribution [3]; these studies have their own advantages and disadvantages. Zhong-Kui Bao et al. [37] proposed heuristic clustering (HC) method of detecting the most influential nodes; HC works on the basis of similarity index which categorizes nodes into various clusters; in this way, the center nodes in clusters are taken as multiple spreaders. Hongming Mo et al. [38] proposed an evidential method for the influential node identification, which is based on the Dempster-Shafer evidence theory. Furthermore, Bian and Yong [39] introduced a new evidential centrality (NEC) algorithm, which is the extension of the evidential method. Tian et al. [40] proposed an analytic hierarchy process (AHP), which works on the basis of multiple attribute decision-making (MADM) method; AHP is used to detect the important branch of every decision and choose the best nodes in the entire network. Zeng et al. [41] have proposed a mixed degree decomposition algorithm for finding ranking nodes; however, the limitation of this technique is the high time complexity and high degree peripheral nodes. Lin et al. [42] improve the K-shell decomposition method; they consider the shortest distance among the nodes and set of nodes by high index K-shell. For further improvement of the K-shell decomposition method, Bae et al. [43] suggested neighborhood coreness centrality (cn) and extended neighborhood coreness (cn+) algorithms. In [44], authors proposed a centrality method for influential nodes identification, which is based on gravity formula. In this method, mass is replaced by the K-shell value of each node and the distance is the shortest path between two nodes. According to the authors, the proposed gravity-based method has better results than other existing methods. Liu et al. [45] proposed a weight degree centrality measure method, which considered the degree of nodes, neighborhoods of their nodes, and one tuning parameter. ey compared the proposed WDC algorithm with other various algorithms such as BC, DC, K-shell decomposition, neighborhood coreness, and extended neighborhood coreness methods. A neighborhood centrality method was proposed by Liu et al. [46] for influential nodes identification, which cogitates numerous neighbors' level influence factors that are based on benchmark centrality measures. On the contrary, there were some indexing centrality methods which are based on edges' potential to enhance the effectiveness of ranking centrality measures [47,48]. Pei et al. [49] have claimed that the K-shell decomposition algorithm performs well for finding key nodes in the entire real network. In [50], a bio-inspired centrality method was proposed, which combines the K-shell index, with Physarum centrality to identify key nodes. Gomez et al. [51] improve the BC centrality method to take into account explicitly numerous dimensions. Furthermore, Zang et al. [52] proposed an advanced unbiased betweenness centrality method, which considers a reverse propagation algorithm to choose the key nodes in the real network. ere have been numerous studies to improve the existing algorithm for influential nodes identification.
ough, all these studies have their own advantages and disadvantages. Still, efficient and effective influential nodes identification persists as a nontrivial challenge. Inspired from [44,53], we proposed an efficient algorithm called EDBC, which effectively identifies the highly influential nodes in various scales of complex networks.

EDBC Model
In this section, we discuss some basic concepts about the proposed method. e proposed method considers the degree of nodes, effective distance, power of K-shell, and several levels of neighborhood nodes influences. EDBC calculation is presented in Sections 3.1 and 3.2.

Preliminaries
In graph theory, the degree of a node denotes the number of all connected edges in the node, that is, the sum of all connected edges in the network. In graph G, set A � A ij |i, j � 1 . . . N denotes the adjacency matrix of G which is defined as follows: where represents node degree,v i , and a ij indicates the element of A.
Definition 2. (power of K-shell α(i, j)). We consider the nodes i and j for K-shell (k si and k sj ). We add k si and k sj in equation (2) for the measurement of power influences: where k si and k sj represent the K-shell of node i and node j.
Here, we used the square root for normalization of the influence factor for the power of K-shell.
Definition 3. (effective distance ED(i, j), see [54]). Effective distance is an essential parameter in the networks G � (N, M) spreading process, and we employ this parameter in the EDBC algorithm. For calculating the distance between the nodes, we have not used the existing distance path algorithm such as Dijkstra and the Bellman-Ford algorithm because the time complexities of these algorithms are very high. For this purpose, we propose effective distance between the nodes, which can be calculated through the following formula: where P ji denotes the flow of information ratio from node V j to V i : P ji � (a ji / iεΨ(j) a(ji)). As can be seen from the formula, ED(i, j) ≠ ED(j, i).

Definition 4.
(influence (I i,j )). Normally, when the neighbors of nodes have high influence, then nodes' influences will increase automatically. Besides, the influence of nodes on neighbors will be decreased with an increase of shortest distances among them. Inspired from inverse square law, we can compute the influence of node as follows: e sum of node influence on all neighbor nodes, which measure the influence of that node, which can be calculated as follows: where η(i) is the set of nearest all neighbors node i. Algorithm 1 depicts the working mechanism of our proposed solution.

EDBC Algorithm.
e node influence in a network depends on three aspects. (i) e node location in the network when a node is in the center of the network, and the influence will be high. Otherwise, if the node is located on the edge of the network, the influence will definitely be relatively small. (ii) e number of node neighbors: a large number of neighbors will be the greater influence of the node. (iii) e distance between the nodes: the smaller the distance is, there is a greater probability of information transmission between nodes and its neighbors. On this basis, we proposed EDBC algorithm, as described in section 1. e proposed EDBC algorithm mainly comprises factors such as the power of K-shell, degree nodes, effective distance, and numerous levels of neighbor influence. At the first stage, it calculates the degree and K-shell of nodes in network, and then, it finds the power of K-shell according to equation (2). Furthermore, it calculates the distance between the nodes (nearest and next-nearest neighbors) through equation (3), and finally, it calculates the influence of each node using equations (4) and (5). To further demonstrate the EDBC algorithm over a specific calculation process, we consider a simple network to provide a clear and detailed picture of the proposed methodology. Figure 1 presents a synthetic network with 16 nodes and 21 edges, where node V16 has a higher influence than other nodes in the network. Moreover, a control flowchart of EDBC algorithm is also presented through Figure 2, where, in the first phase, we have constructed a concerning network; then, we calculate the degree and K-shell of each node; after that, we calculate the power of K-shell as well as effective distance that only considers the nearest and the next-nearest neighbors nodes. At the last step, influence of each node in the entire network is hereby calculated.

Computation of the Power of K-Shell α(i, j).
For calculating the power of K-shell, here we apply equation (2). For node V16, the K-shell value is 2; first of all, we calculate the K-shell of node i and node j. Table 1 shows the K-shell of Complexity given toy network. We have α (16,9) Similarly, in this way, other K-shell power can be calculated.

Calculation of the Effective
Distance. ED (between nearest and next-nearest neighbor of nodes) depends on the closeness among the nodes and its neighbors, to calculate effective distance among the neighbors and the next neighbors of V16 by using equation (3): where P 9,16 � 1 d (16) � 0.125.

Calculation of the Neighbor Nodes' Influence.
In this context, EDBC algorithm considers only the nearest and the next-nearest neighbor's nodes. Here, we take V9 as an example of the nearest neighbor node, according to equation (4): where d (16) is the degree of V16, which is 8. Now, we take the next-nearest neighbor of V9. erefore, the influence of node V16 to node V7 or node V5 can be computed as follows: By this rule, all the nearest and next-nearest neighbor's nodes of the influence with V16 can be calculated.

Computation of the Influence for Each Node.
e computation of the total influence of the nodes in the entire network means the sum of the total number of influence (2) calculate the degree of v (3) calculate the K-shell of v (4) //Computing the interaction in the most nearest neighbors nodes (5) for node u in G.neighbors of node v do (6) evaluate the power of K-shell (v) using equation (2)  (7) evaluate the power of K-shell (u) using equation (2)  (8) evaluate ED(v,u) using equation (4)  (9) evaluate influence(v,u) using equation (5)  (10) //Computing the interaction in the next-nearest neighbors' nodes (11) for node w in G.neighbors of node u do (12) evaluate the power of K-shell (v) using equation (2)  (13) evaluate the power of K-shell (w) using equation (2)  (14) evaluate ED(v,w) using equation (3)  (15) evaluate influence(v,w) using equation (4)   nodes on the nearest and next-nearest neighbor nodes. By using equation (5), we can compute the total influence of the node V16 for a given graph: where j and k show the nearest and next-nearest neighbor nodes. Applying all of the above procedure, we get all nodes influence the ranking results of the given toy network, as shown in Table 2.

Computational Complexity.
EDBC takes three components. In the first phase, it calculates the degree and K-shell, so the time complexity becomes O(|M|). In the second phase, it computes the effective distance among the nodes and their adjacent or neighbors. e distance between the nearest and next-nearest neighbors in the entire network is calculated. erefore, the computational time complexity is O (N < K > 2 ), and in the third and fourth phases, the node's influence of all neighbors will be calculated. erefore, EDBC algorithm's total time complexity can become O(N < k > 2 + |M|), where N and k denote the number of nodes and average degree of nodes in the network, respectively.

Experimentation and Results' Analysis
In this section, we discuss the experimental setup we performed on various real-world networks and datasets to overview of the performance evaluation and comparison between the proposed EDBC algorithm and ten aforementioned state-of-the-art algorithms. We implemented EDBC algorithm in Python 3.7 and rendered experiments on Feiteng Server (1, 16-core, and 1.5gHZ) provided by Kirin Operating System in the main lab of our school.

Comparison of Some Benchmark Centralities.
We compared EDBC of our proposed methodology with nine baseline algorithms, which we are going to briefly summarize and classify according to their characteristic in this section. e existing centrality measures are classified into categories: (a) Structure-based centralities: the node influence is significantly affected via the network topology. In Calculate the flow of information Calculate the distance between two nodes Step 1 Step 2 Real-world dataset Complex network Step 3 Step 4  fact, a lot of centralities consider structural information for the identification of influential nodes. e structure-based measure is further divided into two categories: (i) based on the neighborhood of each node, for example, K-shell and H-index and (ii) based on paths between nodes, such as betweenness and closeness centralities. K-shell (KS) algorithm decomposes a network into sublayers that are directly connected to the centrality [55]. In fact, this algorithm assigns Ks (integer index) to each node, which are representatives of the nodes' location in the network. e Ks of each node with high or low values is placed at the center or periphery of the network. By this rule, the network is designated via a layered structure, revealing the complete hierarchy of its nodes. e innermost nodes are known as core or nucleus, and K-shell nodes are placed into internal and external layers. It is a straightforward indexing algorithm for identifying the influential nodes and can be applied to any network; however, it cannot differentiate the influential nodes in the same core layer. erefore, KS algorithm is not suitable for some of the networks. Our experiments provide evidence in this case. e H-index [23] algorithm is commonly used to evaluate researchers' and scientists' academic achievements. e computation process of the H value in the H-index signifies that the author or scholar has at least H citations of H article published by an author. High H-index reflects that the node has greater influence. Still, this algorithm has many problems with its effective execution, e.g., edge value weight needs to be in appropriate range, otherwise the desired ranking could not be achieved. Betweeness centrality (BC) [18] is used to computes important nodes via global information. It works on the shortest path between the nodes where a node with a higher BC value indicates that it is more important than other nodes in the entire network. However, it is not appropriate for large and complex networks, whereas experimental results have clearly depicted that EDBC is a suitable approach for any kind of network whether it is large or small. Closeness centrality (CC) [16] depends on global information, and it works on the relative distance between each pair of nodes to detect the important nodes. CC can better be identifying influential nodes but very difficult to apply in large networks. e limitation of this algorithm is the lack of applicability to networks by disconnected components. In short, these kinds of centralities have high computational complexity and cannot be suitable for large-scale networks.
(b) Eigenvector-based centralities: eigenvector-based centralities not only consider the neighborhood node number but also consider their influences. ese centralities are PageRank, eigenvector, profit leader, HITS, and gravity index. Eigenvector centrality (EC) [21] is based on the information gain method to choose important nodes in the network. It neither depends only on the degree number of neighborhood nodes nor the impact of each neighbor node. is algorithm has excessive applications both in theoretical and practical. ough, if there exist several nodes with higher degrees in the graph, the risky phenomenon of fractional convergence will still occur; therefore, EC is not an appropriate solution for such networks. PageRank (PR) [22] is one of the famous centrality algorithms; Google search engine is working based on this algorithm. Like EC, PR supposes that the influence of a web page depends on both the quantity and quality of the pages joined by it [55]. It is suitable for directed networks but not for undirected and unweighted, but EDBC is appropriate in case of any type of network whether it is directed or undirected. hyperlink-induced topic search (HITS) [25] is a link analysis technique that uses various metrics concurrently. It scrutinizes the influence of the node via two attributes, i.e., hub and authority value, where the hub value emulates the node role for information transmission, while the authority value analyzes the original node creativity in the information. ese two attributes interact and converge through the iteration process. Profit leader (PL) [36] is one of the most recent algorithms, which was proposed by Yu et al. in May 2018. is algorithm is based on the profit leader concept, which chooses the important nodes in the entire network by calculating the profit the node can make. is algorithm is very simple and applicable to some networks. However, this algorithm is not working very well in case of small networks. Gravity (GR) was proposed by Ma et al. in 2016 [44], which works on the principle of gravity formula. Here, mass is replaced by the K-shell value of each node, and the distance is the shortest path between two nodes, to identify the key nodes in the network. Its drawback is the computational time complexity which is too high to be suitable for largescale networks.

Data Description.
We evaluated EDBC on nine realworld networks to reveal its performance. e data has been collected from different genres of fields where its basic properties, scales, and structures are presented in Table 3.

Complexity
Physicians [56]. is dataset contains 241 nodes and 1098 edges, collected in 1966 by RonBurt. A node denotes a physician, and the link between two physicians represents that the left-hand physician is the friend of the right-hand physician. ere is only one link that subsists between any two nodes. e-mail [57]. is network is an e-mail system at the University RV in south Tarragona, Spain. It consists of 5451 links and 1133 nodes. Nodes denote users, and links show that one e-mail was sent at least. Subelij-euroroad [58]. is is a Europe e-road network, which contains 1174 nodes and 1417 edges. Nodes represent cities, and edges of the two nodes indicate that they are linked via an e-road.
Air-traffic control [59]. is network was created for FAA (federal aviation administration) system in the USA. Nodes represent service centers or airports, and edges are formed from a string of preferred routes. Petster-friendships [60]. is network consists of friendships among users on the website hamsterster. com. In this network, users represent nodes, and the closeness among users represents edges. US-Powergrid [61].
is is an undirected network which consists of information about the power grid of the Western states in the USA. It contains 6594 links and 4941 nodes. e generator or transformator in the network represents nodes, while the power supply line denotes edges. Web-spam [62]. is dataset is constructed by Purdue University network repository. It consists of 4767 nodes and 37,375 edges. Pages and hyperlinks represent nodes and edges, respectively. PGP algorithm [63]. is is the user's communication network for the Pretty Good Privacy (PGP) algorithm and consists of 24,316 links and 10,680 nodes. It comprises only the giant interconnected elements of the network. CAIDA-project [64].
is is the CAIDA-project network, collected in 2007 and containing 26,475 nodes and 53,381 edges. A node represents autonomous systems (AS), while edges represent communication.

SIR Model.
To evaluate the effectiveness of the identification of influential nodes, we employ the SIR model to simulate the spreading influence of ranking nodes in our experiments [65,66]. is model consists of three states, i.e., S (susceptible) means a healthy state and may be infected by others. I (infected) means an infected state and can infect other individuals. R (recovered) represents a recovered state, which cannot be infected by other individuals again. All the seed nodes in the network are in a susceptible state initially. At each time step, the seed node in the network may infect its neighbor's susceptible nodes via a probability β; then, infected nodes are recovered (enter into the recovered state) with probability μ. is process will continue until there has no longer infected nodes. Finally, all the recovered nodes are used to imitate the real node influence. S(t), I(t), and R(t) denote the nodes' numbers in susceptible, infected, and recovered states. So, e spreading influence K i of the node V i is as follows: where N ite denotes iteration numbers; here, we set N ite � 1000 independent run, and nI and nR represent the number of infected and recovered nodes, respectively.

Kendall's Correlation Coefficient τ.
Kendall's correlation coefficient τ [67,68] is used to measure the correctness results of two ranking methods. In this paper, we acquired Kendall's correlation coefficient to measure the performance of the proposed algorithm. Let us suppose that two node sequences (X&Y) are correlated with similar nodes' number (n), X � (x 1 , x 2 , . . . . . . , x n ) and Y � (y 1 , y 2 , . . . , yn). One pair of two annotations (x i , y i ) and (X j , Y j )(i ≠ j) are said to be concordant if the ranking of both component agree, i.e., if both xi > xj and y i > y j or x i < x j and y i < y j . ey are said to be discordant if x i > x j and y i < y j or xi < x j and y i > y j or if x i � x j or y i � y j , the pair is neither concordant nor discordant. Kendall's τ is defined as follows:

Performance Evaluation.
In this experiment, we used the SIR and Kendall's models to verify the effectiveness of EDBC. First, we have used a toy network as an example, as shown in Figure 1, where we applied EDBC to identify the influential nodes, compared it with nine baseline algorithms, and listed the ranking results and SIR values of each node, as shown in Table 4. It can be seen that the EDBC performs well than other various raking algorithms in terms of identification of influential nodes' ranking. Figure 3 illustrates Kendall's correlation coefficient (τ) calculation results of the ten algorithms, where the ranking effects are generated via the K-shell, HITS, H-index, PageRank, BC, CC, EC, PL, and GR. In Figure 3, EDBC gets the highest Kendall's τ correlation coefficients in (physicians, e-mail, Subelij-eroroad, petsterfriendships, air-traffic control, US-powergrid, and web-spam networks. e results in the range between 0.8 and 1 such as 0.9 for physicians and web-spam, 0.95 for e-mail, Subelijeuroroad, CAIDA-project, and US-powergrid, and 1.0 for PGP algorithm and petster-friendships, respectively. Figure 3 shows the performance between ten algorithms based on the comparison of the Kendall's τ, and EDBC performs well on all kinds of networks. We note that the performance of BC measure is always the worst on all networks because BC is usually based on the definition of the shortest paths between the nodes and information in most networks which does not flow along with the shortest paths [69]. In order to further examine the performance measures of EDBC. We used the SIR model for spreading the impact of the ranked nodes, where we used a relatively small β for big networks such as PGP algorithm and CAIDA-project. Especially, we have set β � 0.01 due to the bigger value, and the propagation will occur across the whole network [70]; in this situation, it will be hard to separate the influence of different nodes. For small networks such as web-spam, US-powergrid, physicians, e-mail, Subelij-euroroad, petster-friendships, and air-traffic control, we have set β � 0.1 to estimate the influences of each node. erefore, either we achieve the propagation efficiency in the entire network for all nodes or we keep the recovery rate probability, i.e., c is equal to 1 and the time t is equal to 1000. e ranking results of the average number of infected nodes by the ten algorithms' comparison are shown in Figure 4. A more influential node can affect more nodes; therefore, an efficient algorithm can produce a curve that reduces from left to right showing that EDBC is comparatively capable of the best performance on physicians, e-mail, Subelij-euroroad, air-traffic control, US-powergrid, and web-spam networks. Performance-wise, on petster-friendships network, the GR and EDBC algorithms are approximately the same, but still, EDBC works well in other networks; it is why all the curves are drawn smoothly with a negligible variation. For CAIDA-Project, all the algorithms show similar effects, but EDBC still provides a greater spreading effect than other algorithms. Moreover, ranking results of the performance of ten mentioned algorithms on the Subelij-euroroad network are presented in Table 5, where each node is considered a seed node that has recursively infected its neighbor nodes. It can be seen that EDBC performs better than other baseline algorithms. In addition, we performed the influence comparison of the top-10 nodes, which are distinctly selected by EDBC and other various algorithms. All top-10 distinct nodes are selected as seed nodes, and the time is set to t where values' range of t varies from 1 to 20. As shown in Table 6, EDBC has highest propagation capability for all nodes, and it clearly shows that when the infection F(t) increases as time t increase, we finally get a steady value at a time t after having consecutive      time points. Table 7 shows the top-10 ranked nodes. Due to the limited space, we have only shown the top-10 nodes of PGP algorithm network. Consequently, there are ten seed nodes, and most network propagation arrives at a steadystate at time period t � 20 where we can examine the spreading effect of EDBC and all some other baseline algorithms. Moreover, Figure 5 indicates that the EDBC algorithm has a good spreading efficiency of top-10 nodes. Specifically, EDBC has better performance on the physicians, e-mail, Subelij-euroroad, air-traffic control, petster-friendships, and PGP algorithm US-Powergrid networks. In petster-friendships and CAIDA-project networks, PR and EC have the best propagation effect. And, EDBC has also better spreading efficiency than other baseline algorithms.    GR  EDBC  1251  1251  1251  1251  2562  4  960  1251  1251  338  1474  338  1533  26  136  1251  880  1408  26  1251  338  1474  1540  1533  2645  1266  194  1533  1533  26  1802  1282  1408  1540  3071  1300  338  1312  1474  1474  960  1802  1537  1408  3088  1301  41  1540  1408  1312  1034  1312  1530  1530  1577  1408  1251  26  1540  1272  253  1034  26  1266  1531  1530  588  338  1312  1548  250  1621  1935  1537  943  1533  1474  1537  1548  31  1338  250  1548  1300  3765  1537  250  1530  1530  1547  761  1338  1943  1548  4758  1540  372  1474  1537  1275 12 Complexity

Conclusion and Future Recommendations
is paper investigates the problem of influential or key node ranking from a performance evaluation's viewpoint. In view of related studies, several methods have been offered to explore how to detect the key or influential node-based centrality measures. However, these centrality measures' algorithms have their own advantages and disadvantages. In this study, we proposed an effective-based centrality method for detecting the influential nodes in complex networks. Our proposed algorithm considered K-shell, degree nodes, effective distance, and several levels of neighbor's influence or neighborhood potential. Consequently, this algorithm can be employed in any network, i.e., directed or undirected. In order to evaluate the performance and effectiveness of the proposed algorithm, we applied several types of real-world networks and used two standard evaluation criteria, SIR and Kendall's correlation coefficient τ methods, to analyze the spreading influence of ranking nodes. e experimental setup demonstrated that the proposed algorithm regarding accuracy and effectiveness is reasonable and significant as compared to the classical sorting algorithms and recently proposed several relevant algorithms. However, there persist challenging issues that need to be addressed to the quality extent of current work. For instance, adding more parameters to adjust the intensity between the nodes to yield better performance is a challenge. Onward, we plan to improve the proposed algorithm in consideration of weighted formalconcept analysis.

Conflicts of Interest
e authors declare that they have no conflicts of interest.