Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Complex network important node sorting method based on compactness and structural hole

A complex network and important node technology, applied in the field of complex network important node sorting, to achieve the effect of accurate evaluation results

Inactive Publication Date: 2017-11-03
XIJING UNIV
View PDF0 Cites 15 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The above methods only evaluate the importance of nodes or rank nodes from a certain aspect. In fact, the importance of network nodes is not only related to the local attributes of nodes, but also closely related to their positions in the network and the degree of interdependence between nodes. relevant

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Complex network important node sorting method based on compactness and structural hole
  • Complex network important node sorting method based on compactness and structural hole
  • Complex network important node sorting method based on compactness and structural hole

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0043] In order to illustrate and verify the technical effect of the present invention, ARPA (Advanced Research Project Agency) network and Karate club social network Karate are used as specific examples for experimental verification.

[0044] refer to figure 2 , figure 2 is a schematic diagram of the ARPA network. The degree centrality method (K), the Betweenness algorithm and the neighborhood structural hole algorithm (N-Burt) are used as comparison algorithms, and the test results are shown in Table 1. Table 1 is the ranking results of node importance obtained by the present invention and the comparison algorithm. The upper part of the value in the table is the network node ID, and the lower part is the calculation result of the corresponding algorithm importance value. Among them, Cc-Burt is the compactness-based A ranking method for important nodes in complex networks with structural holes.

[0045] Table 1

[0046]

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a complex network important node sorting method based on closeness and structural holes. First, the closeness and network constraint coefficient of each node in the complex network are obtained, and then the node influence factor matrix is ​​established by using the closeness. The node influence factor On the basis of the matrix, combined with the network constraint coefficient in the structural hole theory, the structural hole influence matrix is ​​constructed. Finally, the importance calculation formula of the nodes is defined according to the structural hole influence matrix, and each node is sorted according to the calculated value. The present invention is based on the node importance value calculated by the compactness and structural holes, and the obtained node importance ranking can more accurately and effectively evaluate the importance of nodes, and can obtain ideal calculation efficiency and results for large-scale real complex networks.

Description

technical field [0001] The invention belongs to the technical field of network evaluation methods, and in particular relates to a method for sorting important nodes of complex networks based on compactness and structural holes. Background technique [0002] Node importance evaluation in complex networks is a basic problem in network analysis, and it has become a hot research topic more and more at the same time. How to determine key nodes in different networks such as power network, traffic network and virus and disease immune control process is very important. [0003] However, network critical node assessments of different sizes require different approaches. At present, the node importance based on the network structure is mainly evaluated from four aspects: the local properties of the network, the global properties, the position of the network and random walk. Among them, the local attributes of the network mainly consider the information of the node itself and its neig...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/24
CPCH04L41/12H04L41/14H04L41/142
Inventor 朱参世汪筱阳朱琳
Owner XIJING UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products