Method for identifying group of key nodes by utilizing generalized discount degree and k-shell in complex network

A complex network and key node technology, which is applied in the field of mining key node clusters in complex networks, can solve problems such as limited communication range, insufficient amount of disseminated information, and no consideration of communication between communicators, etc., to reduce computational complexity and suppress The effect of destructive interference

Active Publication Date: 2020-07-17
TAIYUAN UNIV OF TECH
View PDF4 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The present invention solves the simplification of existing technical indicators, high cost, limited spread range, and insufficient amount of spread information when mining complex network node...

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
  • Method for identifying group of key nodes by utilizing generalized discount degree and k-shell in complex network
  • Method for identifying group of key nodes by utilizing generalized discount degree and k-shell in complex network
  • Method for identifying group of key nodes by utilizing generalized discount degree and k-shell in complex network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0054] The present invention will be described in detail below in combination with experimental analysis.

[0055] A method for identifying a group of key nodes by combining generalized discount degree and k-shell in key node clusters of a complex network, comprising the following steps:

[0056] Step 1. Model Construction

[0057] Set up an undirected and unweighted network G=(N,M), with N nodes and M edges, and the adjacency matrix is ​​expressed as A=(A ij ) N×N , A ij is the element of the adjacency matrix, if there is a link between node i and node j then A ij = 1, otherwise A ij =0. The degree of node i in the network is

[0058] Step 2. Definition 1: The degree of a group of nodes

[0059] In a complex network, the degree value of a node is the number of nodes (neighbor nodes) that are directly linked to the node. Referring to the definition of node degree, generalized discount is used to solve the degree of a group of nodes.

[0060] The ...

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 method for identifying a group of key nodes by using generalized discount degree and k-shell in a complex network. Inspiring is carried out by the degree centrality; the concept of generalized discount degree is provided by using the concept of neighbors; and the degree centrality of a group of nodes is calculated by using the generalized discount degree, that is, the more the neighbor number of the group of nodes in the network is, the greater the influence of the group of nodes on the network is, and meanwhile, the k-shell is considered to solve the position of a single node in the network and determine the influence of the nodes on the network. According to the method, the algorithm is low in mining cost, wide in propagation range and large in propagation information amount; simulation experiments and result analysis are carried out in six real networks and compared with ten other algorithms, and it is found that the initial propagator selected through themethod is wide in distribution range, high in propagation speed and wide in propagation range.

Description

technical field [0001] The invention relates to the technical field of mining methods for key node clusters in complex networks, in particular to a method for mining a group of key nodes in key node clusters of complex networks by combining generalized discount degrees and k-shells. Background technique [0002] In recent years, with the rapid development of science and technology, social life has become more and more abundant, and all kinds of data are generated in an astonishing amount, in various forms, and in various types. How to mine effective information from such astonishing data is currently a hot topic for everyone to discuss. At the same time, complex network research has emerged as the times require, and has developed rapidly with the help of big data platforms. The mining of key node clusters is one of the important research contents in complex network data mining. [0003] The key node clusters in the network describe a kind of node collection that generally o...

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
IPC IPC(8): G06F30/18G06F16/2458G06F16/9536
CPCG06F16/2465G06F16/9536G06F2216/03
Inventor 杨云云张俊丽程兰谢珺赵明明
Owner TAIYUAN UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap