Multi-target community detection method based on k node updating and a similarity matrix
A technology of similarity matrix and detection method, which is applied in the direction of gene model, genetic rule, instrument, etc., can solve the problems of low detection accuracy of time-consuming community, inability to deal with symbolic social network, and low detection accuracy, so as to improve the detection accuracy of community , reduce useless searches, and improve detection accuracy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0036]Complex networks are an abstract description of complex systems in the real world, such as social networks, biological protein systems, and power systems can all be abstracted into complex networks. Community, also known as module, is a very common and extremely important topological attribute in complex networks. It refers to a collection of nodes whose internal connections are closer than external connections in the network. The detection of community structures in complex networks is a method or technology for mining community structures in complex networks, which is of great significance for workers in related fields to understand the structural organization forms and organizational functions in real systems. For the existing community detection technology, the commonly used technology is to establish an optimization model for a specific type of network, and solve the model by designing an optimization method, and finally obtain the network division mode, that is, the...
Embodiment 2
[0063] The multi-target community detection method based on k-node update and similarity matrix is the same as in embodiment 1, and the specific calculation formula of the similarity matrix S of the input network node described in step 3 is as follows:
[0064]
[0065] Among them, S(v i ,v j ) means node v i with node v j The similarity value between represents the element of row i and column j in the similarity matrix S; Γ + (v i ) means that with node v i The set of adjacent nodes with a positive relationship, Γ - (v i ) means that with node v i The set of adjacent nodes with negative relationships; |Γ + (v i )∩Γ + (v j )| represents node v i with node v j The number of positive neighbors shared by |Γ - (v i )∩Γ- (v j )| represents node v i with node v j The number of negative neighbors shared by each other; represents node v i degree, that is, with node v i The sum of the number of connected edges.
[0066] The invention expands the similarity f...
Embodiment 3
[0068] The multi-target community detection method based on k-node update and similarity matrix is the same as embodiment 1-2, and the k-node update strategy described in step 4 includes:
[0069] Arrange the elements in each row in the similarity matrix S in descending order, and take the first k adjacent nodes whose similarity is greater than 0, denoted as V k_neighbor , and use the community labels of these adjacent nodes to update the community labels of each individual in the population pop according to the following rules. run r t The preprocessing process of the network can be completed in one time, and the sub-community structure of the network can be obtained.
[0070]
[0071] Among them, Γ(v i ) means node v i The meaning of the formula in the curly brackets represents counting the community categories, and r is the community label value of the node. This means counting the community label values of the k nearest neighbor nodes, and obtaining the communit...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com