Implementation method for discovering important users of weighting network

A weighted network and important user technology, applied in the field of network communication, can solve problems such as ignoring bridge nodes

Inactive Publication Date: 2016-07-13
NANJING UNIV OF POSTS & TELECOMM
View PDF0 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Most of the existing ones consider the role of the node's neighbors on the importance of the node, while ignoring the bridge nodes that have a huge role in promoting information dissemination

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
  • Implementation method for discovering important users of weighting network
  • Implementation method for discovering important users of weighting network
  • Implementation method for discovering important users of weighting network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0045] The invention will be described in further detail below in conjunction with the accompanying drawings.

[0046] Explanations of terms involved in the present invention include:

[0047] The so-called structural hole refers to the gap between non-redundant contacts, that is, there is no edge relationship between a pair of neighbor nodes of a node, and the node with more structural holes is more important in the network. The N-Burt algorithm includes the following steps:

[0048]a. From the network neighbor matrix A ij ,according to Calculate the degree value k of each node i ;

[0049] b. According to Q(i)=∑ v∈Γ(i) k i The formula calculates the adjacency Q of each node;

[0050] c. According to Calculate p between each pair of connected nodes ij ;

[0051] d. According to NC i =∑ j∈Γ(i) (p ij +∑ k p ik p kj ) 2 Calculate the resistance NC suffered by each node structure hole.

[0052] Propagation importance matrix of weighted network nodes It is de...

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 an implementation method for discovering important users of a weighting network. When solving the ability of different users in a network to influence each other, the method introduces second-layer neighbor node topology of a node to define expenses for maintaining an edge relation of the node, and the method comprehensively considers node bridging importance and node centrality, thereby obtaining importance of the node. The method adopts a structure hole theory to measure the importance of the node, fully considers the centrality of the node, introduces the second-layer neighbor topology of the node, and distinguishes importance of bridging points of different properties. The method comprehensively considers bridging and centrality functions of the node, thereby improving accuracy of an algorithm.

Description

technical field [0001] The invention relates to a method for realizing weighted network important user discovery, which belongs to the technical field of network communication. Background technique [0002] An important node is a small number of nodes that can have a great effect on the structure and function of the entire network compared to other nodes in the network. In recent years, scholars have proposed many indexes and algorithms on important node sorting, mainly in the following aspects: 1. The sorting method based on node neighbor nodes, such as in the document BarratA "The Architecture of Complex Weighted Networks" (Proceeding of the National Academy of Sciences, 2004, 101 (11): 3747-3752) proposed weighted degree centrality (weighted degree centrality), that is, the more nodes there are neighbor nodes, the greater its influence, the disadvantage is that only the local information of nodes is considered; :Generalizingdegreeandshortestpaths"(SocialNetworks, 2010, 3...

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): G06Q50/00H04L12/58
CPCG06Q50/01H04L51/52
Inventor 朱梓嫣顾亦然孟繁荣
Owner NANJING UNIV OF POSTS & TELECOMM
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