Overlapping community discovery method based on node influence

A discovery method and overlapping community technology, applied in the field of overlapping community discovery, can solve the problem of lack of randomness of COPRA algorithm and the consideration of node influence

Inactive Publication Date: 2017-07-14
HARBIN ENG UNIV
View PDF0 Cites 16 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0020] The purpose of the present invention is to provide an overlapping community discovery method based on node influence, which can solve the problems of the randomness of the COPRA algorithm in the label propagation class overlapping community discovery algorithm and the lack of consideration of node influence in the calculation process.

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
  • Overlapping community discovery method based on node influence
  • Overlapping community discovery method based on node influence
  • Overlapping community discovery method based on node influence

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0070] The present invention will be further described below with examples in conjunction with the drawings.

[0071] Combine figure 1 , Computing node influence is realized through the following steps:

[0072] Step 1. Use the k-shell decomposition algorithm to find the k of each node in the network s value;

[0073] Step 2: Count the neighbors and the number of each node in the network;

[0074] Step 3: Determine whether it is an isolated node, if the influence of the isolated node is 0; if it is not an isolated node, proceed to step 4.

[0075] Step 4. Define the contribution coefficient of node v's neighbor node u to its influence as follows:

[0076]

[0077] Where N + (v) is the set of node v and its neighbor nodes. Traverse each node and calculate the contribution coefficient of the node and its neighbor nodes.

[0078] Step 5, comprehensively consider the k of the node s The value (global influence), the degree of the node (local influence) and the contribution degree of neighbo...

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 provides an overlapping community discovery method based on node influence. On the basis of a k-shell decomposition algorithm, three classes of factors, including the global influence and the partial influence of a node and the contribution degree of a neighbour node are comprehensively considered on a full scale. On the basis of the influence, nodes are updated in a descending order, the propagation characteristics of social network information are conformed, and algorithm randomness is lowered. When an affiliation coefficient is calculated, the impact of the influence of the neighbour node is considered, and the own affiliation tendency of the node and the own influence of the node are considered. On an aspect of setting an overlapping threshold value and the like, the node influence is fused, a reasonable threshold value is set for each node. The randomness of an original algorithm can be lowered, and a high-quality community structure is mined.

Description

Technical field [0001] The invention relates to an overlapping community discovery method. Background technique [0002] In nature and human society, there are many real networks that can be described as complex networks. For example, the information flow network, the metabolic system network and the protein network in the biological world. The most common complex network is a social network formed by individual users and their relationships (such relationships may be relatives, colleagues, friends, etc.). In short, a social network is the network between users, users and users. A network of relationships. People hope that through effective and quantitative data mining and analysis, the hidden information and laws can be revealed, which greatly promotes the research boom of social networks. [0003] With the deepening of research, people gradually discovered that social networks not only have small-world and scale-free characteristics, but also have network cluster structure cha...

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): G06F17/30G06Q50/00
CPCG06F16/9024G06F2216/03G06Q50/01
Inventor 董宇欣印桂生张载熙王红滨杨楠陈福坤侯莎兰方合冯梦园刘红丽
Owner HARBIN ENG UNIV
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