Structural hole oriented key node identification method for command and control network
A key node and identification method technology, applied in the direction of data exchange network, digital transmission system, electrical components, etc., can solve the problems of high algorithm complexity, high complexity, and strong topology dependence, etc., and achieve low algorithm complexity and improved The effect of precision
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0042] Example 1: First, the structure hole theory and the calculation method of the hierarchical flow betweenness to which the present invention is applied are introduced, secondly, the algorithm flow of the key node identification algorithm of the command and control network oriented to the structure hole is introduced, and finally the key node identification method of the present invention and the existing method are given. comparison.
[0043] 1. Structural Hole Theory and Hierarchical Flow Betweenness
[0044] Before describing in detail the method for identifying key nodes in the command and control network oriented to structural holes, it is necessary to introduce the structural hole theory and the calculation method of hierarchical flow betweenness adopted in the present invention.
[0045] Structural Hole Theory
[0046] The neighbor vertices of a vertex in the network are connected to each other, but sometimes the expected connection between neighbor vertices does n...
Embodiment 2
[0113] Embodiment 2: A structural hole-oriented command and control network key node identification algorithm steps:
[0114] Step1: Build the accusation network model
[0115] The command entity is abstracted into nodes, the relationship between entities is abstracted into edges, the command network model is established, and the network topology diagram is obtained, as shown in the attached figure 1 shown, and described by the graph G=(V, E), there are n nodes, m edges, V={v 1 ,v 2 ,v 3 ,…,v n} represents the node set, E={e 1 ,e 2 ,e 3 ,…,e m} represents the set of edges. The adjacency matrix of G is A=[a ij ], element a in A ij defined as:
[0116]
[0117] Step2: Calculate the betweenness of the hierarchical flow of the nodes in the accusation network.
[0118] The information amount of each node in the initialized network is unit 1. At any time, only a single node in the network sends information, and other nodes receive information. The sending node distrib...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



