CN102611588A - Method for detecting overlapped community network based on automatic phase conversion clustering - Google Patents
Method for detecting overlapped community network based on automatic phase conversion clustering Download PDFInfo
- Publication number
- CN102611588A CN102611588A CN2012100850153A CN201210085015A CN102611588A CN 102611588 A CN102611588 A CN 102611588A CN 2012100850153 A CN2012100850153 A CN 2012100850153A CN 201210085015 A CN201210085015 A CN 201210085015A CN 102611588 A CN102611588 A CN 102611588A
- Authority
- CN
- China
- Prior art keywords
- phase
- node
- phase place
- network
- nodes
- 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.)
- Granted
Links
Images
Abstract
The invention provides a method for detecting an overlapped community network based on an automatic phase conversion clustering. By adopting the detecting method, the problems that the processing speed is slow, the complexity is high and the community structures and the number of communities need to be known in advance in a process of detecting overlapped communities are overcome. The method is realized by the steps of (1) generating network adjacency matrixes; (2) initializing; (3) updating node phases; (4) processing updated node phases; (5) judging if the updated node phases are stable; (6) counting the number of nodes in subintervals; and (7) outputting network community division results. According to the method, the step of updating the node phases is a discrete iteration process, the phase solving process is accelerated, the parallel processing capability is improved, the inherent frequencies and the known community structures of nodes do not need to be set in advance, the complexity of the network community detection is lowered, and the communities and the overlapped nodes in a network can be effectively detected.
Description
Technical field
The invention belongs to networking technology area, further relate to the overlapping community network detection method based on automatic phase transformation cluster in data mining technology field.Through the phase place discrete iteration, under the situation that does not need known community structure and community's number, can detect each community of network and the overlapping node between community effectively.
Background technology
The research that Web Community is detected comes from sociological research work; Be characterized in that the connection between the identical community interior nodes is denser; And the connection between the different communities intermediate node is more sparse; Community structure is one of the most general and most important topological attribute in the community network, the community structure of finding and disclose network help people more effectively phase-split network topological structure, understand network function, find the hiding rule in the network and predict its behavior etc.The algorithm that a lot of Web Communities are detected has been proposed at present; But most of algorithm is devoted to seek independent non-overlapping community structure, and in the real network, often occurs overlap problem between the community structure; Promptly exist some nodes to belong to the situation of two communities; Such as in community activity, a people possibly not only participate in football club but also participated in table tennis club, and this people just might be in two different communities of club.
The patent " community network method for building up and device and community discovery method and device " (number of patent application 200910135387.0, publication number CN 101877711A) of Huawei Tech Co., Ltd's application.The Web Community of this method finds that device mainly comprises merging module, similarity calculation module and community discovery community's module as a result.This method exists weak point to be; For given network, merge maximum pairing two nodes of similarity in all necessary Network Search of module at every turn, calculate the new node of merging module gained and the similarity of this new node adjacent node then; This patent application computational process is too complicated; Need the similarity between the long time computing node, the length that expends time in has reduced Web Community's detection efficiency.
People such as J.A.Almendral are being published in the overlapping community detection method that proposed a kind of oscillator synchronization Network Based in 2010 in the article " Dynamics of overlapping structures in modular networks " on the PHYSICAL REVIEW E periodical.This method is utilized Kuramoto oscillator model, and each node in the network is corresponding one by one with an oscillator, for given network topology structure; Under the situation of known community structure and community's number; The natural frequency of a certain community of setting network interior nodes is W1, and the natural frequency of all the other community's interior nodes is W2, utilizes the changing value of Kuramoto oscillator model solution phase place; Calculate the overlapping index of each node then; Draw all the other intercommunal overlapping nodes of this community and network, repeat above step, draw the overlapping node between other communities.This method exists weak point to be, for given network topology structure, must under the situation of the community structure of known network and community's number, can obtain the overlapping node between community, has limited the range of application of this method; Simultaneously, this method is through separating the changing value of differential equation phase place, when the node number of network more for a long time; Finding the solution the differential equation will become very slowly; And, increased the complex nature of the problem in the necessary before natural frequency of setting node of the changing value of finding the solution phase place, reduced community's detection efficiency.
Summary of the invention
The objective of the invention is to overcome the deficiency of prior art, propose a kind of overlapping community network detection method, detect to realize the overlapping community in the real network based on automatic phase transformation cluster.The present invention passes through constantly the more phase place of new node, and the phase place when stablizing according to each node detects each community and the overlapping node of network, thereby has realized that effectively overlapping community network detects.
Concrete steps of the present invention are following:
(1) overlapping community network to be detected is generated the adjacency matrix corresponding with this network.
(2) initialization
In [a, a] phase value scope, produce the random number with the number of network node same number at random, with the initial phase of each random number as each node.
(3) new node phase place more
With the phase place substitution equation before each node updates, obtain a new phase place after this node updates:
y＝x+C1×(M-x)+C2×(x-N)
Wherein, y is the phase place after the node updates; X is the phase place before the node updates; C1 is the Control Parameter of the closing speed of weighing the identical community of control interior nodes phase place, and C2 is for weighing the Control Parameter away from speed of the different communities of control intermediate node phase place, C1, C2 (0,1] choose in the scope; M representative and node have the average phase of all nodes before renewal of fillet; N representative and node do not have the average phase of all nodes before renewal of fillet.
(4) handle renewal posterior nodal point phase place
If when having phase value in all the node phase places after upgrading greater than the phase place of a; Choose to upgrade and be positive phase place in the posterior nodal point phase value; With phase value is that each positive node phase place multiplies each other with compression ratio r1 respectively; Making phase value is that each positive node phase place all is distributed between [a, a] phase value; If when having phase value in all the node phase places after upgrading less than the phase place of-a; Choose to upgrade and be negative phase place in the posterior nodal point phase value; Phase value is multiplied each other with compression ratio r2 respectively for each negative node phase place; Making phase value is that each node phase place of bearing all is distributed between [a, a] phase value.
(5) judge whether the phase place of upgrading posterior nodal point is stable
Phase place after each node updates and the preceding phase place of renewal are subtracted each other, obtain a difference, if this difference is less than 0; This difference is asked absolute value, in the difference of all nodes, choose a wherein maximum difference of difference, if this maximum difference is less than threshold epsilon; 0＜ε＜1 thinks that then the phase place of all nodes tends towards stability, and gets into next step; Otherwise, the phase place after each node updates is upgraded preceding phase place as this node next time, return step (3).
(6) statistics subinterval node number
When the phase stabilization of all nodes, [a, a] phase value evenly is divided into the subinterval that several length are len, the phase place of adding up each subinterval interior nodes is in the number of this subinterval scope interior nodes.
(7) output network community results
With subinterval interior nodes number greater than being divided into one group between 0 adjacent subarea; The maximum of search subinterval node number in all subintervals in this group; If this maximum is greater than threshold value T, 1≤T≤5, then interior all the subinterval corresponding nodes of this group are a community of network; Otherwise all subinterval corresponding nodes are the overlapping node of network in this group.
Compared with prior art there is following advantage in the present invention:
The first and since the present invention more the phase place of new node be the process of a discrete iteration, accelerated the phase place solution procedure; Improve parallel processing capability, simultaneously, do not needed to set in advance the natural frequency of each node; Overcome in the prior art handle slower, the complexity problem of higher.Solution node phase change process of the present invention is a parallel processing process, does not need to set in advance the natural frequency of each node, can reduce the complexity that Web Community is detected greatly, improves detection efficiency.
The second, because the present invention has introduced C1, two Control Parameter of C2, C1 controls the closing speed of identical community interior nodes phase place; C2 control different communities intermediate node phase place away from speed; Through the phase place discrete iteration, make the phase place of identical community interior nodes more and more approaching, and the phase place of different communities intermediate node more and more away from; Simultaneously the phase place of overlapping node is between the phase place of two different communities nodes, thereby detects each community of network and the overlapping node between community.The present invention has overcome when carrying out the detection of overlapping community in the prior art, the problem of necessary prior known community structure and community's number.Phase place when the present invention stablizes according to each node can detect the overlapping node between each community and community accurately.
Description of drawings
Fig. 1 is a flow chart of the present invention;
Fig. 2 is the sketch map of the present invention to the network simulation result of karate club;
Fig. 3 is the sketch map of the present invention to dolphin community network simulation result.
Embodiment
Below in conjunction with Fig. 1 practical implementation step of the present invention is done further detailed description.
Step 1. generates the network adjacency matrix
Overlapping community network to be detected is generated the adjacency matrix corresponding with this network; From network, choose two nodes arbitrarily, if between these two nodes fillet is arranged, then corresponding element is 1 in the adjacency matrix, otherwise is 0.
In the embodiment of step 1 of the present invention, overlapping community network to be detected adopts karate club network, and this club is by 34 member compositions; The corresponding node of each member, certain between the member concerns the fillet between the corresponding node, chooses two nodes arbitrarily; If between these two nodes fillet is arranged; Then corresponding element is 1 in the adjacency matrix, otherwise is 0, and it is following to obtain corresponding adjacency matrix thus:
All corresponding phase place of each node in the network, the upper bound of phase value is a, in [a, a] phase value scope, produces the random number with the number of network node same number at random, with the initial phase of each random number as each node; Wherein, the span of the upper bound a of phase value is 5≤a≤100.
Among the embodiment of step 2 of the present invention, number of network node is 34, and the upper bound a=50 of phase value is [50; 50] produce 34 random numbers in the phase value scope at random, the random number of generation be [34.871 ,-41.682 ...-33.336,9.6371], with the initial phase of each random number as each node; Be about to-34.871 initial phases, incite somebody to action-41.682 as second node initial phase as first node, and the like.
Step 3. is the new node phase place more
With the phase place substitution equation before each node updates, obtain a new phase place after this node updates:
y＝x+C1×(M-x)+C2×(x-N)
Wherein, y is the phase place after the node updates; X is the phase place before the node updates; C1 is the Control Parameter of the closing speed of weighing the identical community of control interior nodes phase place, and C2 is for weighing the Control Parameter away from speed of the different communities of control intermediate node phase place, C1, C2 (0,1] choose in the scope; M representative and node have the average phase of all nodes before renewal of fillet; N representative and node do not have the average phase of all nodes before renewal of fillet.
In the embodiment of step 3 of the present invention,, obtain a new phase place after this node updates with the phase place substitution equation before each node updates:
y＝x+C1×(M-x)+C2×(x-N)
Wherein, y is the phase place after the node updates; X is the phase place before the node updates; C1 is for weighing the Control Parameter of the closing speed of controlling identical community interior nodes phase place, and C2 is for weighing the Control Parameter away from speed of the different communities of control intermediate node phase place, C1=0.02, C2=0.005; M representative and node have the average phase of all nodes before renewal of fillet; N representative and node do not have the average phase of all nodes before renewal of fillet.
If when having phase value in all the node phase places after upgrading greater than the phase place of a; Choose to upgrade and be positive phase place in the posterior nodal point phase value; With phase value is that each positive node phase place multiplies each other with compression ratio r1 respectively; Making phase value is that each positive node phase place all is distributed between [a, a] phase value; If when having phase value in all the node phase places after upgrading less than the phase place of-a; Choose to upgrade and be negative phase place in the posterior nodal point phase value; Phase value is multiplied each other with compression ratio r2 respectively for each negative node phase place; Making phase value is that each node phase place of bearing all is distributed between [a, a] phase value; Wherein, compression ratio r1 and r2 obtain according to following formula: compression ratio r1=a/b, and compression ratio r2=-a/c, a are the upper bound of phase value, and b is for upgrading the maximum phase in all node phase places of back, and c is for upgrading the minimum phase in all node phase places of back.
In the embodiment of step 4 of the present invention; If when having phase value in all the node phase places after upgrading greater than 50 phase place; Choose to upgrade and be positive phase place in the posterior nodal point phase value; With phase value is that each positive node phase place multiplies each other with compression ratio r1 respectively, and making phase value is that each positive node phase place all is distributed between [50,50] phase value; If when having phase value in all the node phase places after upgrading less than-50 phase place; Choose to upgrade and be negative phase place in the posterior nodal point phase value; Phase value is multiplied each other with compression ratio r2 respectively for each negative node phase place; Making phase value is that each node phase place of bearing all is distributed between [50,50] phase value; Wherein, compression ratio r1 and r2 obtain according to following formula: compression ratio r1=50/b, and compression ratio r2=-50/c, b is for upgrading the maximum phase in all node phase places of back, and c is for upgrading the minimum phase in all node phase places of back.
Phase place after each node updates and the preceding phase place of renewal are subtracted each other, obtain a difference, if this difference is less than 0; This difference is asked absolute value, in the difference of all nodes, choose a wherein maximum difference of difference, if this maximum difference is less than threshold epsilon; 0＜ε＜1 thinks that then the phase place of all nodes tends towards stability, and gets into next step; Otherwise, the phase place after each node updates is upgraded preceding phase place as this node next time, return step (3).
In the embodiment of step 5 of the present invention, phase place after each node updates and the preceding phase place of renewal are subtracted each other, obtain a difference; If this difference less than 0, is asked absolute value to this difference, in the difference of all nodes, choose a wherein maximum difference of difference; If this maximum difference less than threshold value 0.001, thinks that then the phase place of all nodes tends towards stability, get into next step; Otherwise, the phase place after each node updates is upgraded preceding phase place as this node next time, return step (3).When upgrading 1300 times, the maximum of phase difference value is less than 0.001, and the phase place of all nodes tends towards stability.
When the phase stabilization of all nodes, [a, a] phase value evenly is divided into the subinterval that several length are len, the phase place of adding up each subinterval interior nodes is in the number of this subinterval scope interior nodes; Wherein, a is the upper bound of phase value, and the span of the length l en in each subinterval is 1≤len≤5.
In the embodiment of step 6 of the present invention, when the phase stabilization of all nodes, it is 5 subinterval that [50,50] phase value evenly is divided into 20 length; The subinterval is expressed as S1 respectively: [50 ,-45], S2: [45 ,-40];, S19: [40,45]; S20: it is as shown in the table that [45,50], the phase place of each subinterval interior nodes of statistics are in the number of this subinterval scope interior nodes:
| S1 | S2 | S3 | ?S4 | S5 | S6 | S7 | S8 | S9 | S10 |
| 3 | 2 | 0 | 0 | 3 | 2 | 2 | 1 | 0 | 2 |
| S11 | S12 | S13 | S14 | S15 | S16 | S17 | S18 | S19 | S20 |
| 1 | 0 | 0 | 1 | 2 | 2 | 0 | 2 | 3 | 8 |
With subinterval interior nodes number greater than being divided into one group between 0 adjacent subarea; The maximum of search subinterval node number in all subintervals in this group; If this maximum is greater than threshold value T, 1≤T≤5, then interior all the subinterval corresponding nodes of this group are a community of network; Otherwise all subinterval corresponding nodes are the overlapping node of network in this group.
In the embodiment of step 7 of the present invention, the group after subinterval interior nodes number is divided greater than 0 adjacent subinterval is: G1:{S1, S2}, G2:{S5, S6, S7, S8}, G3:{S10; S11}, G4:{S14, S15, S16}, G5:{S18, S19, S20}; Threshold value T=2, the maximum of subinterval node number is 3 in the G1 group, { 5,6,7,11,17} promptly confirms as a community of network to this group corresponding nodes; The maximum of subinterval node number is 3 in the G2 group, and this organizes corresponding nodes { 1,2,4,8,12,13; 18,22} promptly confirms as a community of network, and the maximum of subinterval node number is 2 in the G3 group, and { 3,14,20} promptly confirms as the overlapping node of network to this group corresponding nodes, and the maximum of subinterval node number is 2 in the G4 group; { 9,10,29,31,32} promptly confirms as the overlapping node of network to this group corresponding nodes, and the maximum of subinterval node number is 8 in the G5 group, and this organizes corresponding nodes { 15; 16,19,21,23,24,25,26; 27,28,30,33,34} promptly confirms as a community of network, thereby has realized the community of network to be detected is detected, and has detected each community and the overlapping node of network.
Do further description below in conjunction with 3 pairs of simulated effects of the present invention of accompanying drawing 2 accompanying drawings.
1. simulated conditions:
At CPU is to use Matlab 2009a to carry out emulation in core 22.4GHZ, internal memory 2G, the WINDOWS XP system.
2. emulation content:
Choose karate club network and dolphin community network as simulation object.Karate club network is made up of 34 nodes, and each node is represented a clubbite, certain relation between the fillet line-up of delegates between the node; The dolphin community network is made up of 62 nodes, and each node is represented a dolphin, and the fillet between the node is represented certain social relationships between the dolphin.The parameter that two networks are used in the emulation is as shown in the table:
| Network | a | C1 | C2 | ε | len | T |
| |
50 | 0.02 | 0.005 | 0.001 | 5 | 2 |
| The |
50 | 0.3 | 0.022 | 0.001 | 4 | 2 |
As shown in Figure 2 to the network simulation result's of karate club sketch map under above parameter condition: among the figure, { 5,6,7,11,17} is a community of network to oval corresponding nodes, circular corresponding nodes { 1,2,4; 8,12,13,18,22} is a community of network, triangle corresponding nodes { 3,14,20,9; 10,29,31,32} is the overlapping node of network, square corresponding nodes { 15,16,19,21,23; 24,25,26,27,28,30,33,34} is a community of network, overlapping node { 3; 14,20,9,10,29,31,32} has and is connected in real network with between two communities, has verified validity of the present invention.
As shown in Figure 3 to the sketch map of dolphin community network simulation result under above parameter condition: among the figure, { 5,6,9,13,17,22,25,26,27,31,32,41,48,54,56,57,60} is a community of network to square corresponding nodes; { 0,2,3,4,8,10,11,12,14,15,16,18,20,21,23,24,29,33,34,35,37,38,40,42,43,44,45,46,47,49,50,51,52,53,55,58,59,61} is a community of network to circular corresponding nodes; { 1,7,19,28,30,36,39} is the overlapping node of network to the triangle corresponding nodes, and { 1,7,19,28,30,36,39} has and is connected in real network with between two communities overlapping node, has verified validity of the present invention.
Can find out from above explanation, can detect each community and the overlapping node of network, realize the detection of overlapping community network based on the overlapping community network detection method of automatic phase transformation cluster.
Claims (5)
1. based on the overlapping community network detection method of automatic phase transformation cluster, concrete steps are following:
(1) overlapping community network to be detected is generated the adjacency matrix corresponding with this network;
(2) initialization
In [a, a] phase value scope, produce the random number with the number of network node same number at random, with the initial phase of each random number as each node;
(3) new node phase place more
With the phase place substitution equation before each node updates, obtain a new phase place after this node updates:
y＝x+C1×(M-x)+C2×(x-N)
Wherein, y is the phase place after the node updates; X is the phase place before the node updates; C1 is the Control Parameter of the closing speed of weighing the identical community of control interior nodes phase place, and C2 is for weighing the Control Parameter away from speed of the different communities of control intermediate node phase place, C1, C2 (0,1] choose in the scope; M representative and node have the average phase of all nodes before renewal of fillet; N representative and node do not have the average phase of all nodes before renewal of fillet;
(4) handle renewal posterior nodal point phase place
If when having phase value in all the node phase places after upgrading greater than the phase place of a; Choose to upgrade and be positive phase place in the posterior nodal point phase value; With phase value is that each positive node phase place multiplies each other with compression ratio r1 respectively; Making phase value is that each positive node phase place all is distributed between [a, a] phase value; If when having phase value in all the node phase places after upgrading less than the phase place of-a; Choose to upgrade and be negative phase place in the posterior nodal point phase value; Phase value is multiplied each other with compression ratio r2 respectively for each negative node phase place; Making phase value is that each node phase place of bearing all is distributed between [a, a] phase value;
(5) judge whether the phase place of upgrading posterior nodal point is stable
Phase place after each node updates and the preceding phase place of renewal are subtracted each other, obtain a difference, if this difference is less than 0; This difference is asked absolute value, in the difference of all nodes, choose a wherein maximum difference of difference, if this maximum difference is less than threshold epsilon; 0＜ε＜1 thinks that then the phase place of all nodes tends towards stability, and gets into next step; Otherwise, the phase place after each node updates is upgraded preceding phase place as this node next time, return step (3);
(6) statistics subinterval node number
When the phase stabilization of all nodes, [a, a] phase value evenly is divided into the subinterval that several length are len, the phase place of adding up each subinterval interior nodes is in the number of this subinterval scope interior nodes;
(7) output network community results
With subinterval interior nodes number greater than being divided into one group between 0 adjacent subarea; The maximum of search subinterval node number in all subintervals in this group; If this maximum is greater than threshold value T, 1≤T≤5, then interior all the subinterval corresponding nodes of this group are a community of network; Otherwise all subinterval corresponding nodes are the overlapping node of network in this group.
2. the overlapping community network detection method based on automatic phase transformation cluster according to claim 1; It is characterized in that the generation method of the described network adjacency matrix of step (1) is from network, to choose two nodes arbitrarily; Judge between these two nodes and whether have fillet; If exist, the element that the adjacency matrix that then generates is corresponding is 1, otherwise is 0.
3. the overlapping community network detection method based on automatic phase transformation cluster according to claim 1 is characterized in that the upper bound a span of the described phase value of step (2) is 5≤a≤100.
4. the overlapping community network detection method based on automatic phase transformation cluster according to claim 1; It is characterized in that described compression ratio r1 of step (4) and r2 obtain according to following formula: compression ratio r1=a/b, compression ratio r2=-a/c; Wherein, A is the upper bound of phase value, and b is for upgrading the maximum phase in all node phase places of back, and c is for upgrading the minimum phase in all node phase places of back.
5. the overlapping community network detection method based on automatic phase transformation cluster according to claim 1 is characterized in that the span of the length l en in said each subinterval of step (6) is 1≤len≤5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210085015.3A CN102611588B (en) | 2012-03-28 | 2012-03-28 | Method for detecting overlapped community network based on automatic phase conversion clustering |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210085015.3A CN102611588B (en) | 2012-03-28 | 2012-03-28 | Method for detecting overlapped community network based on automatic phase conversion clustering |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102611588A true CN102611588A (en) | 2012-07-25 |
| CN102611588B CN102611588B (en) | 2014-10-01 |
Family
ID=46528760
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210085015.3A Expired - Fee Related CN102611588B (en) | 2012-03-28 | 2012-03-28 | Method for detecting overlapped community network based on automatic phase conversion clustering |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102611588B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103475539A (en) * | 2013-09-01 | 2013-12-25 | 西安电子科技大学 | Symbol network community detecting method based on oscillator phase synchronization |
| CN103500168A (en) * | 2013-09-02 | 2014-01-08 | 中国矿业大学 | Method and system for discovering communities in overlapped complex networks according to topology potential |
| CN105574541A (en) * | 2015-12-14 | 2016-05-11 | 天云融创数据科技（北京）有限公司 | Compactness sorting based network community discovery method |
| CN106055568A (en) * | 2016-05-18 | 2016-10-26 | 安徽大学 | Automatic friend grouping method for social network based on single-step association adding |
| CN107153713A (en) * | 2017-05-27 | 2017-09-12 | 合肥工业大学 | Overlapping community detection method and system based on similitude between node in social networks |
| CN107391832A (en) * | 2017-07-15 | 2017-11-24 | 西安电子科技大学 | The method for realizing network reconfiguration is accurately matched using a step phase iterative data |
| CN110535681A (en) * | 2019-07-18 | 2019-12-03 | 西安电子科技大学 | Based on the parallel overlapping community detection method of open operation language OpenCL |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020036988A1 (en) * | 2000-07-31 | 2002-03-28 | Network Design Tools, Inc. | Method for designing rings in telecommunications network |
| CN101383748A (en) * | 2008-10-24 | 2009-03-11 | 北京航空航天大学 | Community division method in complex network |
| CN101877711A (en) * | 2009-04-28 | 2010-11-03 | 华为技术有限公司 | Social network establishment method and device, and community discovery method and device |
-
2012
- 2012-03-28 CN CN201210085015.3A patent/CN102611588B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020036988A1 (en) * | 2000-07-31 | 2002-03-28 | Network Design Tools, Inc. | Method for designing rings in telecommunications network |
| CN101383748A (en) * | 2008-10-24 | 2009-03-11 | 北京航空航天大学 | Community division method in complex network |
| CN101877711A (en) * | 2009-04-28 | 2010-11-03 | 华为技术有限公司 | Social network establishment method and device, and community discovery method and device |
Non-Patent Citations (2)
| Title |
|---|
| J.A.ALMENDRAL等: "Dynamics of overlapping structures in modular networks", 《PHYSICAL REVIEW E》, 23 July 2010 (2010-07-23) * |
| 王晓华等: "Phase synchronization on small-world networks with community structure", 《CHINESE PHYSICS B》, 15 February 2010 (2010-02-15) * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103475539A (en) * | 2013-09-01 | 2013-12-25 | 西安电子科技大学 | Symbol network community detecting method based on oscillator phase synchronization |
| CN103475539B (en) * | 2013-09-01 | 2016-05-25 | 西安电子科技大学 | Symbolic network community detection method based on oscillator phase synchronization |
| CN103500168A (en) * | 2013-09-02 | 2014-01-08 | 中国矿业大学 | Method and system for discovering communities in overlapped complex networks according to topology potential |
| CN103500168B (en) * | 2013-09-02 | 2017-03-15 | 中国矿业大学 | A kind of overlap complex network community discovery method and system based on Topology Potential |
| CN105574541A (en) * | 2015-12-14 | 2016-05-11 | 天云融创数据科技（北京）有限公司 | Compactness sorting based network community discovery method |
| CN106055568A (en) * | 2016-05-18 | 2016-10-26 | 安徽大学 | Automatic friend grouping method for social network based on single-step association adding |
| CN106055568B (en) * | 2016-05-18 | 2019-06-28 | 安徽大学 | A kind of automatic group technology of friend of the social networks based on single step addition group |
| CN107153713A (en) * | 2017-05-27 | 2017-09-12 | 合肥工业大学 | Overlapping community detection method and system based on similitude between node in social networks |
| CN107153713B (en) * | 2017-05-27 | 2018-02-23 | 合肥工业大学 | Overlapping community detection method and system based on similitude between node in social networks |
| CN107391832A (en) * | 2017-07-15 | 2017-11-24 | 西安电子科技大学 | The method for realizing network reconfiguration is accurately matched using a step phase iterative data |
| CN110535681A (en) * | 2019-07-18 | 2019-12-03 | 西安电子科技大学 | Based on the parallel overlapping community detection method of open operation language OpenCL |
| CN110535681B (en) * | 2019-07-18 | 2021-04-27 | 西安电子科技大学 | Open computing language OpenCL parallel-based overlapping community detection method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102611588B (en) | 2014-10-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102611588B (en) | Method for detecting overlapped community network based on automatic phase conversion clustering | |
| CN103426042B (en) | The group technology of social networks and system | |
| CN103020267B (en) | Based on the complex network community structure method for digging of triangular cluster multi-label | |
| CN104657418B (en) | A kind of complex network propagated based on degree of membership obscures corporations' method for digging | |
| CN104391907B (en) | A kind of fast path method for searching of variable resolution degree | |
| CN104466959A (en) | Power system key line identification method and system | |
| CN104010329B (en) | Based on the distributed load equalizing method for quantifying unbiased broadcast Gossip algorithm | |
| CN104519563A (en) | Hierarchical wireless sensor network time synchronization method | |
| CN106685745B (en) | A kind of constructing network topology method and device | |
| CN102355393A (en) | Oscillator phase synchronization-based network community structure partitioning method | |
| CN103500168A (en) | Method and system for discovering communities in overlapped complex networks according to topology potential | |
| CN105335438A (en) | Local shortest loop based social network group division method | |
| CN105447565A (en) | On-chip network mapping method based on discrete bat algorithm | |
| CN113422695A (en) | Optimization method for improving robustness of topological structure of Internet of things | |
| CN104700311B (en) | A kind of neighborhood in community network follows community discovery method | |
| CN103475539B (en) | Symbolic network community detection method based on oscillator phase synchronization | |
| CN104125146B (en) | A kind of method for processing business and device | |
| CN110266423B (en) | Time synchronization method based on minimum node average synchronization stage number in communication network | |
| CN113411766A (en) | Intelligent Internet of things comprehensive sensing system and method | |
| CN106780747B (en) | A kind of method that Fast Segmentation CFD calculates grid | |
| CN109361556A (en) | A kind of key node cognitive method based on node entropy and structural hole | |
| Guo et al. | Learning automata-based algorithms for solving the stochastic shortest path routing problems in 5G wireless communication | |
| CN103902547A (en) | Increment type dynamic cell fast finding method and system based on MDL | |
| Liu et al. | OUTER SYNCHRONIZATION OF DELAYED COUPLED SYSTEMS ON NETWORKS WITHOUT STRONG CONNECTEDNESS: A HIERARCHICAL METHOD. | |
| CN108898506A (en) | A kind of overlapping corporations method for digging propagated based on multi-tag |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| 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: 20141001 Termination date: 20200328 |