CN105471637B - A kind of complex network node importance appraisal procedure and system - Google Patents
A kind of complex network node importance appraisal procedure and system Download PDFInfo
- Publication number
- CN105471637B CN105471637B CN201510813049.3A CN201510813049A CN105471637B CN 105471637 B CN105471637 B CN 105471637B CN 201510813049 A CN201510813049 A CN 201510813049A CN 105471637 B CN105471637 B CN 105471637B
- Authority
- CN
- China
- Prior art keywords
- node
- importance
- kernel
- iteration
- value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 80
- 238000000354 decomposition reaction Methods 0.000 claims abstract description 58
- 238000011156 evaluation Methods 0.000 claims abstract description 38
- 230000008569 process Effects 0.000 claims abstract description 24
- 238000004364 calculation method Methods 0.000 claims description 26
- 208000021907 Central cloudy dystrophy of François Diseases 0.000 description 10
- 238000010586 diagram Methods 0.000 description 10
- 230000000295 complement effect Effects 0.000 description 5
- 230000001186 cumulative effect Effects 0.000 description 5
- 238000005315 distribution function Methods 0.000 description 5
- 230000008859 change Effects 0.000 description 4
- 235000005156 Brassica carinata Nutrition 0.000 description 3
- 244000257790 Brassica carinata Species 0.000 description 3
- 241001481833 Coryphaena hippurus Species 0.000 description 3
- 230000007423 decrease Effects 0.000 description 3
- 239000013598 vector Substances 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 238000005295 random walk Methods 0.000 description 2
- 230000007480 spreading Effects 0.000 description 2
- 208000035473 Communicable disease Diseases 0.000 description 1
- 101000911753 Homo sapiens Protein FAM107B Proteins 0.000 description 1
- 102100026983 Protein FAM107B Human genes 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000002401 inhibitory effect Effects 0.000 description 1
- 238000003012 network analysis Methods 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/142—Network analysis or design using statistical or mathematical methods
Landscapes
- Physics & Mathematics (AREA)
- Algebra (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Pure & Applied Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
A kind of complex network node importance appraisal procedure of present invention offer and system, this method include：K nuclear decomposition is carried out to given complex network, preserves the iterative information in decomposable process and each node Ks values；According to the iterative information and each node Ks values, the K core iteration factors of each node are calculated；According to the K core iteration factors of node, the importance of complex network node is calculated.The present invention makes full use of the iterative information during K nuclear decomposition, can accurately, meticulously evaluate the importance of complex network node, and this method time complexity is relatively low, and rapid evaluation can be carried out to large-scale complex network, adaptable.
Description
Technical Field
The invention belongs to the technical field of complex network analysis, relates to a complex network node importance evaluation method and system, and particularly relates to a complex network node importance evaluation method and system based on a K-kernel iteration factor.
Background
The importance of accurately measuring the nodes in the complex network has very important significance and effect on the aspects of preventing network attacks, preventing infectious diseases from spreading in crowds, inhibiting the spreading of gossip in the society and the like. The node importance evaluation method can be roughly divided into three categories: a locality approach, a global approach and a random walk based approach. The node degree is a typical locality method. The locality method is generally simple in calculation and low in complexity, but the importance of the nodes in the whole network is hardly reflected by neglecting the global structure information of the network. The larger the network size, the more obvious the drawbacks of the localized approach. Typical global methods include feature vectors, compactness, betweenness, and the like. Although the global method can accurately evaluate the importance of the nodes, the complexity is high due to the need of calculating the information such as the shortest path between the nodes, and the like, and the method is not suitable for large-scale complex networks. Typical random walk methods include PageRank, leader rank, HITS and the like, and these methods also evaluate the importance of complex network nodes from a global perspective, are high in complexity, and are mainly directed to directed networks.
Kitsak et al, in an article "Identification of fluent peers in complex networks" published in the journal of Nature Physics 2010, indicate that the importance of a node depends on its position in the entire network, and propose a complex network node importance evaluation method based on K-kernel decomposition. The method can quickly evaluate the importance of the nodes, has low complexity and can be suitable for large-scale networks. However, the biggest defect of the method is that many nodes are endowed with the same Ks value, and the importance of the nodes cannot be further distinguished.
In recent years, a plurality of scholars expand and improve the K nucleus decomposition method, so that the application range is wider and the accuracy is better. However, up to now, all improvements to the K-kernel decomposition method neglect iterative information generated in the decomposition process, and the information has very important function and significance for node importance evaluation. Assuming that two nodes have the same Ks value, according to Kitsak's theory, the two nodes have the same importance. The importance of a node depends on its location throughout the network. If they are not deleted in the same iteration, indicating that the two nodes are located differently from the network core node, they should have different importance. If the iterative information generated in the K kernel decomposition process is fully utilized, the importance of the nodes with the same Ks value can be further distinguished.
Disclosure of Invention
In view of the above-mentioned disadvantage that the conventional node importance evaluation method based on K-kernel decomposition ignores the iterative information, the present invention aims to provide a method and a system for evaluating the importance of a complex network node, which are used to solve the problems that the conventional node importance evaluation method based on K-kernel decomposition ignores the iterative information and the importance of nodes with the same Ks value cannot be effectively distinguished.
To achieve the above and other related objects, the present invention provides a method for evaluating importance of a complex network node, including:
performing K-kernel decomposition on a given complex network, and storing iteration information in the decomposition process and a Ks value of each node;
calculating a K core iteration factor of each node according to the iteration information and the Ks value of each node;
and calculating the importance of each node according to the K kernel iteration factor.
Preferably, the method for calculating the node K kernel iteration factor includes:wherein,for any node n in a complex networkiK kernel iteration factor of (1); k is a node n in the K kernel decomposition processi(iv) the assigned Ks value; m is the total number of iterative operations with the value of K in the K kernel decomposition process; in these m iterations, node niRemoved at the nth iteration, 1 ≦ n ≦ m.
Preferably, the method for calculating the node importance includes:wherein,for any node n in a complex networkiThe importance of (c);is a node niK kernel iteration factor of (1);is a node niA value of (d); n is a radical ofiIs a node niThe neighbor node set of (2); n isjIs a node niNeighbor node of nj∈Ni；Is a node njK kernel iteration factor of (1);is a node njThe value of (a).
The invention also provides a system for evaluating the importance of the complex network node, which comprises the following components:
the K core decomposition module is used for performing K core decomposition on the given complex network and storing iteration information in the decomposition process and the Ks value of each node;
the node K kernel iteration factor calculation module is connected with the K kernel decomposition module and is used for calculating the K kernel iteration factor of each node according to iteration information generated by K kernel decomposition and the Ks value of each node;
and the node importance calculation module is connected with the node K core iteration factor calculation module and calculates the importance of each node according to the K core iteration factor.
Preferably, the calculation function of the node K kernel iteration factor calculation module is:wherein,for any node n in a complex networkiK kernel iteration factor of (1); k is a node n in the K kernel decomposition processi(iv) the assigned Ks value; m is the total number of iterative operations with the value of K in the K kernel decomposition process; in these m iterations, node niRemoved at the nth iteration, 1 ≦ n ≦ m.
Preferably, the calculation function of the node importance calculation module is:wherein,for any node n in a complex networkiThe importance of (c);is a node niK kernel iteration factor of (1);is a node niA value of (d); n is a radical ofiIs a node niThe neighbor node set of (2); n isjIs a node niNeighbor node of nj∈Ni；Is a node njK kernel iteration factor of (1);is a node njThe value of (a).
As described above, the method and system for evaluating the importance of a complex network node according to the present invention have the following advantages:
the invention fully utilizes the iteration information in the K kernel decomposition process, and can effectively distinguish the importance of the nodes with the same Ks value. The node K kernel iteration factor is a global index, and the node degree is a local index. The invention has lower time complexity, can quickly and effectively process large-scale complex network data and has strong adaptability.
Drawings
Fig. 1 is a schematic flow chart of a complex network node importance evaluation method according to the present invention.
Fig. 2 is a schematic structural diagram of a complex network node importance evaluation system according to the present invention.
Fig. 3 is a schematic diagram of the topology of a simple example network.
Fig. 4 is a diagram of the complementary cumulative distribution function CCDF of the network shown in fig. 3.
FIG. 5 is a diagram of the complementary cumulative distribution function CCDF for a Karate club network.
Fig. 6 is a diagram illustrating a complementary cumulative distribution function CCDF of the Dolphin network.
FIG. 7 is a diagram of the complementary cumulative distribution function CCDF of the NetScience network.
Fig. 8 is a schematic diagram of a variation of a degree of discrimination index of different node importance evaluation methods when an n parameter of an LFR network generator varies.
Fig. 9 is a schematic diagram of a variation of the discrimination index of the method for evaluating the importance of different nodes when the μ parameter of the LFR network generator varies.
Fig. 10 is a schematic diagram of a variation of the degree of distinction index of different node importance evaluation methods when the k parameter of the LFR network generator varies.
Fig. 11 is a schematic diagram of a change of a discrimination index of a method for evaluating importance of different nodes when a γ parameter of an LFR network generator changes.
Description of the element reference numerals
S1-S3
200 node importance evaluation system
210K nuclear decomposition module
220 node K kernel iteration factor calculation module
230 node importance calculation module
Detailed Description
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention.
Please refer to the attached drawings. It should be noted that the drawings provided in the present embodiment are only for illustrating the basic idea of the present invention, and the components related to the present invention are only shown in the drawings rather than drawn according to the number, shape and size of the components in actual implementation, and the type, quantity and proportion of the components in actual implementation may be changed freely, and the layout of the components may be more complicated.
The present invention will be described in detail with reference to the accompanying drawings.
The invention provides a method for evaluating the importance of a complex network node, which comprises the following steps of:
and S1, performing K-kernel decomposition on the given complex network, and storing iteration information in the decomposition process and the Ks value of each node.
And S2, calculating the K core iteration factor of each node according to the iteration information and the Ks value of each node.
Further, the method for calculating the node K kernel iteration factor comprises the following steps:wherein,for any node n in a complex networkiK kernel iteration factor of (1); k is a node n in the K kernel decomposition processi(iv) the assigned Ks value; m is the total number of iterative operations with the value of K in the K kernel decomposition process; in these m iterations, node niRemoved at the nth iteration, 1 ≦ n ≦ m. Wherein the value refers to the number of nodes that are most adjacent around each node.
And S3, calculating the importance of each node according to the K kernel iteration factor.
Further, the method for calculating the node importance comprises the following steps:wherein,for any node n in a complex networkiThe importance of (c);is a node niK kernel iteration factor of (1);is a node niA value of (d); n is a radical ofiIs a node niThe neighbor node set of (2); n isjIs a node niNeighbor node of nj∈Ni；Is a node njK kernel iteration factor of (1);is a node njThe value of (a).
The protection scope of the present invention is not limited to the execution sequence of the steps of the complex network node importance evaluation method based on the K-kernel iteration factor, and all the node importance evaluation methods after any form of deformation according to the principle of the present invention are included in the protection scope of the present invention.
The invention also provides a complex network node importance evaluation system which can realize the complex network node importance evaluation method, but the realization device of the complex network node importance evaluation method comprises but is not limited to the complex network node importance evaluation system.
As shown in fig. 2, the complex network node importance evaluation system 200 includes: the system comprises a K core decomposition module 210, a node K core iteration factor calculation module 220 and a node importance calculation module 230.
The K-kernel decomposition module 210 performs K-kernel decomposition on the input complex network, and stores iteration information in the decomposition process and Ks values of each node.
The node K-core iteration factor calculation module 220 is connected to the K-core decomposition module 210, and calculates a K-core iteration factor of each node according to iteration information generated by K-core decomposition and the Ks value of each node. Further, the calculation function of the node K kernel iteration factor calculation module is as follows:
wherein,for any node n in a complex networkiK kernel iteration factor of (1); k is a node n in the K kernel decomposition processi(iv) the assigned Ks value; nuclear decomposition of m is KThe process median value is the total number of iterative operations of k; in these m iterations, node niRemoved at the nth iteration, 1 ≦ n ≦ m.
The node importance calculating module 230 is connected to the node K-core iteration factor calculating module 220, and calculates the importance of each node according to the K-core iteration factor of the node. Further, the calculation function of the node importance calculation module is as follows:
wherein,for any node n in a complex networkiThe importance of (c);is a node niK kernel iteration factor of (1);is a node niA value of (d); n is a radical ofiIs a node niThe neighbor node set of (2); n isjIs a node niNeighbor node of nj∈Ni；Is a node njK kernel iteration factor of (1);is a node njThe value of (a).
In view of the defect that iteration information is ignored in the node importance evaluation technology based on K-kernel decomposition, the invention provides a method and a system for evaluating the importance of complex network nodes, which are used for solving the problems that iteration information is ignored in the existing node importance evaluation method based on K-kernel decomposition, the importance of nodes with the same Ks value cannot be effectively distinguished, and the like. The invention fully utilizes the iteration information in the K kernel decomposition process, and can effectively distinguish the importance of the nodes with the same Ks value. The node K kernel iteration factor is a global index, and the node degree is a local index. The invention has lower time complexity, can quickly and effectively process large-scale complex network data and has strong adaptability.
The present invention will be described in further detail with reference to the following examples and the accompanying drawings.
Example one
In this embodiment, a simple example network is taken as an example, and the importance evaluation method of the complex network node provided by the present invention is used for evaluating the importance of the network node. The topology of an exemplary network is shown in fig. 3, which contains 17 nodes. In this embodiment, the node importance evaluation of the exemplary network shown in fig. 3 by using the complex network node importance evaluation method specifically includes the following steps:
1) and performing K-core decomposition on the given example network, and storing iteration information in the decomposition process and the Ks value of each node. The K-core decomposition information for the example network is shown in table 1.
Table 1: k-core decomposition information for example networks
| Degree of value | Iteration numbering | Removing nodes | Node Ks value |
| 1 | 1 | 1,2,3,5,9,14,17 | 1 |
| 1 | 2 | 4,16 | 1 |
| 2 | 1 | 6 | 2 |
| 2 | 2 | 7,8,15 | 2 |
| 3 | 1 | 10,11,12,13 | 3 |
2) And calculating the K core iteration factor of each node according to the iteration information generated by the K core decomposition and the Ks value of each node. According to the K-core iteration factor calculation method of the present invention, the calculated K-core iteration factors of the exemplary network nodes are shown in table 2.
Table 2: k-kernel iteration factor for an example network node
| Node numbering | K kernel iteration factor | Node numbering | K kernel iteration factor |
| 1 | 1.5 | 10 | 6.0 |
| 2 | 1.5 | 11 | 6.0 |
| 3 | 1.5 | 12 | 6.0 |
| 4 | 2.0 | 13 | 6.0 |
| 5 | 1.5 | 14 | 1.5 |
| 6 | 3.0 | 15 | 4.0 |
| 7 | 4.0 | 16 | 2.0 |
| 8 | 4.0 | 17 | 1.5 |
| 9 | 1.5 |
3) And calculating the importance of each node according to the K kernel iteration factor of the node. The importance of the exemplary network nodes calculated according to the node importance calculation method of the present invention is shown in table 3.
Table 3: importance of an example network node
| Node numbering | Importance of | Node numbering | Importance of |
| 1 | 9.3333 | 10 | 127.3333 |
| 2 | 6.3333 | 11 | 102.0000 |
| 3 | 6.3333 | 12 | 114.0000 |
| 4 | 15.6667 | 13 | 114.0000 |
| 5 | 9.3333 | 14 | 37.3333 |
| 6 | 27.6667 | 15 | 63.3333 |
| 7 | 68.0000 | 16 | 16.6667 |
| 8 | 61.3333 | 17 | 4.6667 |
| 9 | 13.3333 |
As can be seen from table 3, almost all example network nodes are given different importance. The importance evaluation method of the complex network node can well distinguish the importance of the example network node, thereby proving the effectiveness of the invention.
Example two
In the embodiment, an example network, a real network and a manual network are taken as examples, and the complex network node importance assessment method provided by the invention is used for node importance assessment of the network and compared with other typical node importance assessment methods. Typical methods of selection include: node degree method (abbreviated as d), traditional K-shell decomposition (abbreviated as KS), mixed degree decomposition (abbreviated as MDD), minimum K-shell method (abbreviated as min-KS), shortest distance method (abbreviated as KS-K), and extended neighbor core method (abbreviated as C) for the following reasonsnc+). The method is abbreviated as KS-IF. In order to better evaluate the performance of various importance evaluation methods, a discrimination index M is introduced here. The discrimination index is defined as follows:
wherein R is a rank vector of network node importance, n is the total rank number of the vector R, n isrIs the number of nodes in the r-th level. If all the nodes are in the same importance level, the value of the discrimination index M is 0, and the corresponding evaluation method cannot distinguish the importance of each node. If each importance level only contains 1 node, and the value of the discrimination index M is 1, the corresponding evaluation method can effectively discriminate the importance of each node and has the strongest discrimination capability.
First, the example network shown in fig. 3 is selected, the importance of the example network nodes is evaluated by the 7 methods, the nodes are sorted according to the importance, and the sorting result is shown in table 4. Each column of Table 4 corresponds to a method of importance assessment, with nodes of the same level having the same importance and "others" representing all nodes remaining. As can be seen from table 4, the method (KS-IF) of the present invention can accurately and finely distinguish the importance of the network nodes, and the number of nodes per importance level is at most 2, compared to the other 6 typical methods.
Table 4: ranking results of example network node importance
In order to further explain the performance of the method, 8 real networks with different scales are selected, and the discrimination indexes M of the 7 importance evaluation methods are analyzed and compared. These 8 real networks include: karate club network, Dolphin network, Jazz network, NetScience network, E-mail network, Blogs network, PGP network, and Enron network. Table 5 shows the ability of the 7 importance assessment methods to differentiate the importance of the 8 real network nodes. It can be seen that: the method (KS-IF) of the invention allows to obtain maximum division values of the zones for the 8 real networks. Compared with other 6 node importance evaluation methods, the method provided by the invention can more carefully and accurately identify the importance of the real network node.
Table 5: capability of different importance evaluation methods for distinguishing importance of real network nodes
To further illustrate the performance of the method of the present invention, the results of Table 5 are shown using the complementary cumulative distribution function CCDF. Fig. 4 to 7 show CCDF of 4 networks, i.e., an example network, a Karate club network, a Dolphin network, and a NetScience network, respectively. According to the principle of CCDF, if the number of nodes in the same importance level is larger, the CCDF will decrease faster, otherwise, the CCDF will decrease slowly along the diagonal. As can be seen from fig. 4 to 7, the CCDF of the method (KS-IF) of the present invention decreases slowly along the diagonal, which shows that the method of the present invention can distinguish the difference in importance between the network nodes well.
In order to further illustrate the performance of the method of the present invention, an artificial complex network is generated by means of an LFR network generator, and the method of the present invention is evaluated using the artificial complex network. The LFR network generator has 4 important parameters, which are the node size n (number of nodes), the average node degree k (average degree of nodes), the community structure mixing parameter μ (mismatch parameter of community structure), and the power-law distribution γ (power-law of hierarchy distribution). The change of the 4 parameters will affect the topology of the artificially complex network. Fig. 8 to 11 show the change of the discrimination index M of different node importance evaluation methods when 1 parameter is kept changed for the 4 parameters and the remaining 3 parameters are not changed. It can be seen that: the method (KS-IF) of the invention allows to obtain maximum segmentation index values for said artificially complex network. Compared with other 3 node importance evaluation methods, the method provided by the invention can more carefully and accurately identify the node importance of the artificial complex network.
By combining the specific contents of the invention and the first embodiment and the second embodiment, the invention carries out K-core decomposition on a given complex network, and stores iteration information in the decomposition process and a Ks value of each node; calculating a K core iteration factor of each node according to the iteration information and the Ks value of each node; and calculating the importance of the complex network node according to the K core iteration factor of the node.
The invention fully utilizes the iteration information in the K kernel decomposition process, and can effectively distinguish the importance of the nodes with the same Ks value. The invention considers global index and local index at the same time, and carries out comprehensive and objective evaluation on the importance of the node based on the K kernel iteration factor and degree information of the node. The invention has lower time complexity, can quickly and effectively process large-scale complex network data and has strong adaptability.
In conclusion, the present invention effectively overcomes various disadvantages of the prior art and has high industrial utilization value.
The foregoing embodiments are merely illustrative of the principles and utilities of the present invention and are not intended to limit the invention. Any person skilled in the art can modify or change the above-mentioned embodiments without departing from the spirit and scope of the present invention. Accordingly, it is intended that all equivalent modifications or changes which can be made by those skilled in the art without departing from the spirit and technical spirit of the present invention be covered by the claims of the present invention.
Claims (2)
1. A method for evaluating the importance of a complex network node is characterized by comprising the following steps:
performing K-kernel decomposition on a given complex network, and storing iteration information in the decomposition process and a Ks value of each node, wherein the iteration information comprises a value, an iteration number and a removed node;
calculating a K-core iteration factor of each node according to the iteration information and the Ks value of each node, wherein the calculation method of the K-core iteration factor of each node comprises the following steps:
wherein,for any node n in a complex networkiK kernel iteration factor of (1); k is a node n in the K kernel decomposition processi(iv) the assigned Ks value; m is the total number of iterative operations with the value of K in the K kernel decomposition process; in these m iterations, node niN is removed when the iteration is performed for the nth time, wherein n is more than or equal to 1 and less than or equal to m;
calculating the importance of each node according to the K-kernel iteration factor, wherein the calculation method of the node importance comprises the following steps:
wherein,for any node n in a complex networkiThe importance of (c);is a node niK kernel iteration factor of (1);is a node niA value of (d); n is a radical ofiIs a node niThe neighbor node set of (2); n isjIs a node niNeighbor node of nj∈Ni；Is a node njK kernel iteration factor of (1);is a node njValue of (A)。
2. A complex network node importance evaluation system, the complex network node importance evaluation system comprising:
the K core decomposition module is used for performing K core decomposition on a given complex network and storing iteration information in the decomposition process and a Ks value of each node, wherein the iteration information comprises a value, an iteration number and a removed node;
the node K kernel iteration factor calculation module is connected with the K kernel decomposition module and used for calculating the K kernel iteration factor of each node according to the iteration information generated in the K kernel decomposition process and the Ks value of each node, and the calculation method of the node K kernel iteration factor comprises the following steps:
wherein,for any node n in a complex networkiK kernel iteration factor of (1); k is a node n in the K kernel decomposition processi(iv) the assigned Ks value; m is the total number of iterative operations with the value of K in the K kernel decomposition process; in these m iterations, node niN is removed when the iteration is performed for the nth time, wherein n is more than or equal to 1 and less than or equal to m;
the node importance calculation module is connected with the node K core iteration factor calculation module and calculates the importance of each node according to the K core iteration factor, and the node importance calculation method comprises the following steps:
wherein,for any node n in a complex networkiThe importance of (c);is a node niK kernel iteration factor of (1);is a node niA value of (d); n is a radical ofiIs a node niThe neighbor node set of (2); n isjIs a node niNeighbor node of nj∈Ni；Is a node njK kernel iteration factor of (1);is a node njThe value of (a).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510813049.3A CN105471637B (en) | 2015-11-20 | 2015-11-20 | A kind of complex network node importance appraisal procedure and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510813049.3A CN105471637B (en) | 2015-11-20 | 2015-11-20 | A kind of complex network node importance appraisal procedure and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105471637A CN105471637A (en) | 2016-04-06 |
| CN105471637B true CN105471637B (en) | 2018-09-07 |
Family
ID=55608951
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510813049.3A Expired - Fee Related CN105471637B (en) | 2015-11-20 | 2015-11-20 | A kind of complex network node importance appraisal procedure and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105471637B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106445685B (en) * | 2016-09-21 | 2019-05-14 | 华中科技大学 | A kind of efficient distributed extensive Dynamic Graph k core maintaining method |
| CN107292751B (en) * | 2017-05-31 | 2021-04-02 | 杭州师范大学 | Method and device for mining node importance in time sequence network |
| CN107316102A (en) * | 2017-06-02 | 2017-11-03 | 天津大学 | A kind of seaway pivotal port analysis method being layered based on complex network |
| CN109034562B (en) * | 2018-07-09 | 2021-07-23 | 中国矿业大学 | Social network node importance evaluation method and system |
| CN109104307B (en) * | 2018-07-27 | 2021-06-04 | 电子科技大学 | Key node sensing method of dynamic data link network |
| CN109886556B (en) * | 2019-01-25 | 2022-04-22 | 中国电子科技集团公司第三十研究所 | Autonomous system importance evaluation method based on structure and function characteristics |
| CN110909173A (en) * | 2019-11-13 | 2020-03-24 | 河海大学 | Non-overlapping community discovery method based on label propagation |
| CN111008311B (en) * | 2019-12-25 | 2023-07-21 | 中国人民解放军国防科技大学 | Complex network node importance assessment method and device based on neighborhood weak connection |
| CN111814339A (en) * | 2020-07-13 | 2020-10-23 | 齐鲁工业大学 | Complex network-based workshop process industry key node identification method and system |
| CN112087488B (en) * | 2020-08-03 | 2023-08-25 | 山东浪潮科学研究院有限公司 | Method, device, equipment and medium for determining important cloud robot nodes |
| CN115643179A (en) * | 2022-12-23 | 2023-01-24 | 上海蜜度信息技术有限公司 | Block chain node propagation influence measuring method and system, storage medium and terminal |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101976245A (en) * | 2010-10-09 | 2011-02-16 | 吕琳媛 | Sequencing method of node importance in network |
| CN104462260A (en) * | 2014-11-21 | 2015-03-25 | 深圳大学 | Community search algorithm based on k-kernel |
| CN104992266A (en) * | 2015-06-15 | 2015-10-21 | 广东电网有限责任公司电力调度控制中心 | Method of determining power grid node importance degree and system thereof |
-
2015
- 2015-11-20 CN CN201510813049.3A patent/CN105471637B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101976245A (en) * | 2010-10-09 | 2011-02-16 | 吕琳媛 | Sequencing method of node importance in network |
| CN104462260A (en) * | 2014-11-21 | 2015-03-25 | 深圳大学 | Community search algorithm based on k-kernel |
| CN104992266A (en) * | 2015-06-15 | 2015-10-21 | 广东电网有限责任公司电力调度控制中心 | Method of determining power grid node importance degree and system thereof |
Non-Patent Citations (2)
| Title |
|---|
| 《Identifying influential nodes in complex networks》;Duanbing Chen等;《Physica A: Statistical Mechanics and its Applications》;20120215;第391卷(第4期);第1777-1787页 * |
| 《虚拟社交网络中节点重要度分析》;王昊翔等;《上海交通大学学报》;20130731;第47卷(第7期);第1055-1059页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105471637A (en) | 2016-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105471637B (en) | A kind of complex network node importance appraisal procedure and system | |
| Walsh | Search in a small world | |
| Fortunato et al. | Community structure in graphs | |
| Shen et al. | Mining frequent graph patterns with differential privacy | |
| Li et al. | Effective identification of essential proteins based on priori knowledge, network topology and gene expressions | |
| CN102214169B (en) | The offer method and device of key word information and target information | |
| Chung et al. | Computing heat kernel pagerank and a local clustering algorithm | |
| CN103929330B (en) | Domain name service method for evaluating quality and system | |
| Gustafsson et al. | Comparison and validation of community structures in complex networks | |
| O'Brien et al. | Locally estimating core numbers | |
| Wu et al. | Counting triangles in large graphs by random sampling | |
| CN104504583B (en) | The evaluation method of grader | |
| Xu et al. | Finding overlapping community from social networks based on community forest model | |
| Ma et al. | Decomposition‐based multiobjective evolutionary algorithm for community detection in dynamic social networks | |
| Yoon et al. | A community-based sampling method using DPL for online social networks | |
| Namtirtha et al. | Semi-global triangular centrality measure for identifying the influential spreaders from undirected complex networks | |
| Nathan et al. | A dynamic algorithm for updating katz centrality in graphs | |
| Laassem et al. | Label propagation algorithm for community detection based on Coulomb’s law | |
| CN107133274A (en) | A kind of distributed information retrieval set option method based on figure knowledge base | |
| Ma et al. | An improved label propagation algorithm based on node importance and random walk for community detection | |
| Yang et al. | Identifying influential nodes through an improved k-shell iteration factor model | |
| CN113065037A (en) | Label propagation community detection method and device based on density peak optimization | |
| Hartman et al. | Assessing the suitability of network community detection to available meta-data using rank stability | |
| Li et al. | Centroid-based multiple local community detection | |
| CN106777416B (en) | The other version comparison method present of schematic diagram based on topological relation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180907 Termination date: 20211120 |