CN109802857A - A kind of local community discovery method based on node propagation performance - Google Patents
A kind of local community discovery method based on node propagation performance Download PDFInfo
- Publication number
- CN109802857A CN109802857A CN201910021685.0A CN201910021685A CN109802857A CN 109802857 A CN109802857 A CN 109802857A CN 201910021685 A CN201910021685 A CN 201910021685A CN 109802857 A CN109802857 A CN 109802857A
- Authority
- CN
- China
- Prior art keywords
- node
- community
- propagation performance
- added
- steps
- 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.)
- Pending
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to the community discovery fields in complex network, specifically disclose a kind of local community discovery method based on node propagation performance, on the one hand a kind of central method of measurement nodes is proposed, the connection between the degree of node itself and its surrounding neighbours is comprehensively considered to measure the centrality of node, chooses the start node that the maximum node of local propagation performance is expanded as community.On the other hand vertex ticks is introduced in community's process of expansion, guarantees that the start node of each community's expansion is not other neighbor nodes expanded and finished community.The invention avoids the phenomenon that a large amount of overlapping nodes, community divides accuracy height, suitable for various types of networks in community's partition process.
Description
Technical field
The present invention relates to the community discovery fields in complex network, and in particular to a kind of office based on node propagation performance
Portion's community discovery method.
Background technique
Community structure is an important structure feature in complex network, is concerned in recent years.Studies have shown that community
Structure often has close ties with the institutional framework of whole network and functional character, finds the community structure in network to announcement net
The population characteristic and structure feature of network have meaning of crucial importance.
Community structure is exactly the grouping of nodes, wherein the connection between group interior nodes is more close, group and group
Between node contacts it is more sparse.Node in same community has similar feature and function in a network, in whole network
In have specific effect.Community structure in research complex network is for analyzing complex network topologies, deeply understanding network
Individual behavior has very important significance in function and prediction network, has very extensive application prospect.
Community discovery algorithm can be roughly divided into two types at present, the society based on global community discovery algorithm and based on part
Area finds algorithm, wherein more and more concerns that the community discovery algorithm based on part obtains.The community of local part at present
It was found that there is also accuracy is not high for algorithm, it is easy to appear a large amount of overlapping nodes in community's process of expansion, results in redundancy community
The shortcomings that.
Summary of the invention
Technical problem solved by the invention is that accuracy is not high in current local community discovery algorithm, community's partition process
It is middle the problem of a large amount of overlapping nodes lead to redundancy community occur.
The technology that the present invention solves above-mentioned technical problem is as follows: a kind of community discovery method based on node propagation performance,
Specifically includes the following steps:
S1, input network topology structure G (V, E), wherein V is the set of network node, and E is the set of network edge；
S2, the propagation performance σ (i) for calculating all nodes in network, initialize all vertex ticks；
S3, set S is added in the maximum node of local propagation performance；
S4, start node progress community's expansion that the node in set S is expanded as community is chosen；
It modifies after S5, community's expansion to the label of nodes；
S6, judge whether the node in set S meets termination condition, if so then execute step S4, otherwise enter step S7；
S7, judge whether nodes all meet termination condition, if then exporting division result, otherwise to being unsatisfactory for item
The affiliated community of part node is judged；
S8, judge the affiliated community of residue of network organization node.
The beneficial effects of the present invention are: the invention proposes the concept of node propagation performance, Lai Hengliang nodes
Propagation performance chooses the start node that the maximum node of local propagation performance is expanded as community.It is protected in community's process of expansion
The start node for demonstrate,proving each community is not the neighbor node of other communities.It solves in community's process of expansion because of a large amount of overlapping nodes
Caused redundancy community, improves arithmetic accuracy.
Detailed description of the invention
Fig. 1 is general flow chart of the present invention.
Fig. 2 is that F value calculates schematic diagram in the present invention.
Specific embodiment
The principle and features of the present invention will be described below with reference to the accompanying drawings, and the given examples are served only to explain the present invention, and
It is non-to be used to limit the scope of the invention.
As shown in Figure 1, a kind of local community based on node propagation performance finds method, comprising the following steps:
S1, input network topology structure G (V, E), wherein V indicates the set of nodes, and E indicates the collection of network edge
It closes；
S2, the propagation performance σ (i) for calculating all nodes in network, initialize all vertex ticks；
Step S2 specifically includes the following steps:
S21, all node propagation performance σ (i) of network are calculated are as follows:
N (i) is the number of the neighbours of node i in formula (1), and σ (i, j) is that the neighbor node j of node i is only passing through node
The neighbor node number of node i is at most reached under the premise of the neighbor node of i.
All vertex ticks are false by S22, initialization all vertex ticks of network.
S3, set S is added in the maximum node of local propagation performance；
Step S3 specifically includes the following steps:
S31, node and compared with the propagation performance of its surrounding neighbours node by propagation performance descending successively choose
Compared with, if the node propagation performance be greater than surrounding neighbours node propagation performance if be added into set S.
S4, start node progress community's expansion that the node in set S is expanded as community is chosen.
Step S4 specifically includes the following steps:
S41, the start node for selecting the node that propagation performance is maximum and labeled as false in set S to expand as community,
Surrounding neighbours node is sequentially added into community and calculates the F value before and after being added, if the F value after being added is greater than the F value before being added,
Community is added in node, is otherwise added without.The calculation method of F value are as follows:
In formula (2), as shown in Fig. 2, in the embodiment of the present inventionFor degree inside community C,For the community outside C degree
Number.
It modifies after S5, community's expansion to the label of nodes.
Step S5 specifically includes the following steps:
S51, it will expand and finish community's internal node label true is changed to by false, be false's by its surrounding markings
The label of neighbor node is changed to temp.
S6, judge whether the node in set S meets termination condition, if so then execute step S4, otherwise enter step S7.
Step S6 specifically includes the following steps:
S61, judge whether there are also the nodes labeled as false otherwise to execute step if so then execute step S4 in set S
Rapid S6.
S7, judge whether nodes all meet termination condition, if then exporting division result, otherwise to being unsatisfactory for item
The affiliated community of part node is judged.
Step S7 specifically includes the following steps:
S71, judge that whether all vertex ticks if then export community division result, are otherwise held all for true in network
Row step S8.
Judge the affiliated community of remaining node in network.
Step S8 specifically includes the following steps:
It S81, is not that the node of true is added to the F of judgement addition front and back in its all neighbours community by label in network
Value, is added community for the node if the F value of community is greater than the F value that preceding community is added after being added, and label is changed to true, Mei Gejie
Point can belong to multiple communities simultaneously.
It is obvious to a person skilled in the art that invention is not limited to the details of the above exemplary embodiments, do not having
In the case where spirit or essential attributes of the invention, the present invention can be realized in other specific forms.Therefore, no matter from
Which point is seen, should all regard example as exemplary, and be non-limiting, the scope of the present invention is by appended claims
Rather than above description limits, it is intended that by all changes that come within the meaning and range of equivalency of the claims capsule
It includes in the present invention.Any reference signs in the claims should not be construed as limiting the involved claims.
Claims (8)
1. a kind of local community based on node propagation performance finds method, which comprises the following steps:
S1, input network topology structure G (V, E), wherein V is the set of network node, and E is the set of network edge；
S2, the propagation performance σ (i) for calculating all nodes in network, initialize all vertex ticks；
S3, set S is added in the maximum node of local propagation performance；
S4, start node progress community's expansion that the node in set S is expanded as community is chosen；
It modifies after S5, community's expansion to the label of nodes；
S6, judge whether the node in set S meets termination condition, if so then execute step S4, otherwise enter step S7；
S7, judge whether nodes all meet termination condition, if then exporting division result, if otherwise executing S8；
S8, judge the affiliated community of remaining node in network.
2. the local community according to claim 1 based on node propagation performance finds method, which is characterized in that the step
Rapid S2 specifically includes the following steps:
S21, calculate node propagation performance σ (i) are as follows:
N (i) is the number of the neighbor node of node i in formula (1), and σ (i, j) is that the neighbor node j of node i is only passing through node
The neighbor node number of node i is at most reached under the premise of the neighbor node of i.
All vertex ticks are false by S22, all vertex ticks of initialization.
3. the local community according to claim 1 based on node propagation performance finds method, which is characterized in that the step
Rapid S3 specifically includes the following steps:
S31, it node and is compared with the propagation performance of its surrounding neighbours node by propagation performance descending successively choose, if
The propagation performance that the propagation performance of the node is greater than surrounding neighbours node is then added into set S.
4. the local community according to claim 1 based on node propagation performance finds method, which is characterized in that the step
Rapid S4 specifically includes the following steps:
S41, the start node for selecting the node that propagation performance is maximum and labeled as false in set S to expand as community, will be all
Neighbor node is enclosed to sequentially add community and calculate the F value that front and back is added, it, will section if the F value after being added is greater than the F value before being added
Community is added in point, is otherwise added without, fitness function F formula are as follows:
In formula (2)For degree inside community C,For degree outside community C.
5. the local community according to claim 1 based on node propagation performance finds method, which is characterized in that the step
Rapid S5 specifically includes the following steps:
S51, it will expand and finish community's internal node label and be changed to true, the neighbor node for being false by its surrounding markings
Label is changed to temp.
6. the local community according to claim 1 based on node propagation performance finds method, which is characterized in that the step
Rapid S6 specifically includes the following steps:
S61, judge otherwise to execute S6 whether also labeled as the node of false if so then execute S4 in set S.
7. the local community according to claim 1 based on node propagation performance finds method, which is characterized in that the step
Rapid S7 specifically includes the following steps:
S71, judge that whether all vertex ticks are all for true in network, if then output is as a result, no then follow the steps S8.
8. the local community according to claim 1 based on node propagation performance finds method, which is characterized in that the step
Rapid S8 specifically includes the following steps:
S81, by label in network it is not that the node of true is added in its all neighbours community the F value that front and back is added in judgement, if
The F value of community is greater than the F value that preceding community is added then by node addition community after addition, and label is changed to true, and each node can
Belong to multiple communities simultaneously.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910021685.0A CN109802857A (en) | 2019-01-10 | 2019-01-10 | A kind of local community discovery method based on node propagation performance |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910021685.0A CN109802857A (en) | 2019-01-10 | 2019-01-10 | A kind of local community discovery method based on node propagation performance |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109802857A true CN109802857A (en) | 2019-05-24 |
Family
ID=66557075
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910021685.0A Pending CN109802857A (en) | 2019-01-10 | 2019-01-10 | A kind of local community discovery method based on node propagation performance |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109802857A (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108073944A (en) * | 2017-10-18 | 2018-05-25 | 南京邮电大学 | A kind of label based on local influence power propagates community discovery method |
| US20180183681A1 (en) * | 2015-04-16 | 2018-06-28 | Nec Laboratories America, Inc. | Behavior-based community detection in enterprise information networks |
-
2019
- 2019-01-10 CN CN201910021685.0A patent/CN109802857A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180183681A1 (en) * | 2015-04-16 | 2018-06-28 | Nec Laboratories America, Inc. | Behavior-based community detection in enterprise information networks |
| CN108073944A (en) * | 2017-10-18 | 2018-05-25 | 南京邮电大学 | A kind of label based on local influence power propagates community discovery method |
Non-Patent Citations (3)
| Title |
|---|
| ALIREZA LOUNI等: "A two-stage algorithm to estimate the source of information diffusion in social media networks", 《2014 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS（INFOCOM WKSHPS）》 * |
| 朱家磊: "复杂社交网络中社区发现算法研究", 《中国优秀硕士学位论文全文数据库（电子期刊）》 * |
| 王梓权: "基于局部扩张的复杂网络社区发现算法研究", 《中国优秀硕士学位论文全文数据库（电子期刊）》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Itzkovitz et al. | Subgraphs in random networks | |
| Zhang et al. | Modularity optimization in community detection of complex networks | |
| CN109005055B (en) | Complex network information node importance evaluation method based on multi-scale topological space | |
| CN108051035B (en) | The pipe network model recognition methods of neural network model based on gating cycle unit | |
| Barrat et al. | Rate equation approach for correlations in growing network models | |
| CN103325061B (en) | A kind of community discovery method and system | |
| CN106951524A (en) | Overlapping community discovery method based on node influence power | |
| CN104750731B (en) | A kind of method and device obtaining whole user portrait | |
| CN109829337A (en) | A kind of method, system and the equipment of community network secret protection | |
| CN113780436B (en) | Complex network key node identification method based on comprehensive degree | |
| CN103500168B (en) | A kind of overlap complex network community discovery method and system based on Topology Potential | |
| CN108809697B (en) | Social network key node identification method and system based on influence maximization | |
| CN110705045B (en) | Link prediction method for constructing weighted network by utilizing network topology characteristics | |
| CN105162654B (en) | A kind of link prediction method based on local community information | |
| Bezerra et al. | Modeling NoC traffic locality and energy consumption with Rent's communication probability distribution | |
| CN105740199A (en) | Time sequence power estimation device and method of network on chip | |
| Ghose et al. | Generalizable cross-graph embedding for gnn-based congestion prediction | |
| CN110135565A (en) | Realize the assessment system of performance on the integrated for neural network algorithm | |
| Xu et al. | Power-law graphs have minimal scaling of Kemeny constant for random walks | |
| CN108287866A (en) | Community discovery method based on node density in a kind of large scale network | |
| Ma et al. | An improved label propagation algorithm based on node importance and random walk for community detection | |
| CN112105081A (en) | High-precision wireless positioning method based on improved biophysical optimization algorithm | |
| CN104424369A (en) | Time sequence estimation method for FPGA (field programmable gate array) post-mapping net list | |
| CN109802857A (en) | A kind of local community discovery method based on node propagation performance | |
| Li et al. | The epidemic model based on the approximation for third-order motifs on networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190524 |
|
| WD01 | Invention patent application deemed withdrawn after publication |