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

Social network key node discovery method and system based on network decomposition

A key node and social network technology, which is applied in the field of social network key node discovery methods and systems, can solve the problems of poor pertinence in node deletion, unreasonable node return strategy, etc., and achieve efficient results in discovery

Active Publication Date: 2018-11-16
CHINA UNIV OF MINING & TECH
View PDF5 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In view of the above analysis, the present invention aims to provide a method and system for discovering key nodes in social networks based on network decomposition, which solves the problem that in the existing method for discovering key nodes based on network decomposition, the deletion of nodes is not very targeted and ignores the problems between neighboring nodes. The impact of connected edges on the network's destructive ability, unreasonable node replacement strategy, and the need to set parameters

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
  • Social network key node discovery method and system based on network decomposition
  • Social network key node discovery method and system based on network decomposition
  • Social network key node discovery method and system based on network decomposition

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0044] Such as figure 1 As shown, this embodiment provides a method for discovering key nodes in a social network based on network decomposition, including:

[0045] S101. Given a social network with a node size of N, calculate the centrality value of each node in the social network; select multiple nodes to form a set of candidate key nodes;

[0046] The method for selecting candidate key nodes includes the following steps:

[0047] 1) Calculate the centrality value of each node in the social network;

[0048] Among them, the calculation formula of social network node centrality value is:

[0049] Among them, C(v i ) is social network node v i The centrality value of D(v i ) for node v i degree value, U(i) is the node v i The set of neighbor nodes of D(v j ) is the neighbor node v j The degree value of RLink(v i) for node v i The number of edges between all neighbor nodes of .

[0050] The above formula is used to calculate the social network node centrality val...

Embodiment 2

[0067] This example also provides a system for discovering key nodes in a social network based on network decomposition, including: a node centrality value calculation module 210 , a node deletion module 220 , a node replacement module 230 , and a connected branch search module 240 .

[0068] The node centrality value calculation module 210 calculates the centrality value of each node in the network according to a given social network with a node size of N, using a node centrality value calculation method.

[0069] Specifically, the mathematical model of the node centrality value calculation module 210 is:

[0070] Among them, C(v i ) is social network node v i The centrality value of D(v i ) for node v i degree value, U(i) is the node v i The set of neighbor nodes of D(v j ) is the neighbor node v j The degree value of RLink(v i ) for node v i The number of edges between all neighbor nodes of .

[0071] The node deletion module 220 is connected with the node centra...

Embodiment 3

[0078] This embodiment relates to the RoadEU network. The key node discovery method of the social network based on network decomposition discovers the key nodes of the network. The information of the RoadEU network is shown in Table 1. The network contains 1177 nodes and 1417 edges.

[0079] Table 1: Network RoadEU details

[0080] network

node

side

RoadEU

1177

1417

[0081] Discovering the key nodes of the example network RoadEU using the network decomposition-based social network key node discovery method specifically includes the following steps:

[0082] 1) Use the node centrality index to calculate the centrality value of each node in the RoadEU network, and some calculation results are shown in Table 2.

[0083] Table 2: Centrality values ​​of some nodes in the network RoadEU

[0084]

[0085] 2) Delete the node with the largest node centrality value and put it into the candidate key node set S. In the current network, node 7 has ...

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 present invention relates to a social network key node discovery method and system based on network decomposition, belonging to the technical field of network analysis. The method comprises the steps of: primarily determining a candidate key node set according to the central value of each node in the network, and determining the key nodes of the social network according to the communicating branch node quantity of the candidate key nodes in the network. The social network key node discovery method and system overcome the influence of the connection sides between the adjacent nodes on the network destroy capacity, design more accurate node central indexes, select more reasonable node replacing policy, do not need parameter arrangement, and are more efficient and accurate in social network key node discovery.

Description

technical field [0001] The invention relates to the technical field of network analysis, in particular to a method and system for discovering key nodes of a social network based on network decomposition. Background technique [0002] Key node discovery is an important part of social network analysis, and its purpose is to find a set of nodes as small as possible, so that after deleting these nodes, the network can be destroyed to the greatest extent. With the development of the Internet and big data, the scale of the network is showing a trend of increasing sharply. Key nodes of social networks have found important application prospects in network protection and preventing the spread of viruses. [0003] There are two main types of existing methods for discovering key nodes in social networks based on network decomposition: one is based on ring removal strategy, and the other is based on centrality indicators. In the node deletion stage, the algorithm based on the ring remo...

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): H04L29/08H04L12/24H04L12/26
CPCH04L41/0813H04L41/12H04L43/16H04L67/1061
Inventor 王志晓席景科袁冠孟凡荣牛强芮晓彬杜长江
Owner CHINA UNIV OF MINING & TECH
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

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