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

Dynamic social network community structure evolution method based on incremental clustering

A technology of community structure and incremental clustering, applied in dynamic social network community division, dynamic social network community structure evolution method and system field based on incremental clustering, can solve problems such as reducing clustering quality

Inactive Publication Date: 2016-04-06
UNIV OF ELECTRONICS SCI & TECH OF CHINA
View PDF0 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Based on the characteristic that the network changes little at adjacent moments in the dynamic network, the incremental clustering method can quickly calculate the community structure of the network by only processing the changed nodes or edges, and is used in large-scale networks, but this method will Reduce the quality of clustering

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
  • Dynamic social network community structure evolution method based on incremental clustering
  • Dynamic social network community structure evolution method based on incremental clustering
  • Dynamic social network community structure evolution method based on incremental clustering

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0054] Example 1 simulation data

[0055] The dynamic social network community evolution method based on incremental clustering in the present invention is used to complete the dynamic community division of the two data sets of SYN-FIX and SYN-VAR and to discover their evolution rules. The SYN-FIX dataset is a dynamic dataset with a fixed number of nodes. This dataset includes 128 nodes assigned to 4 communities. Each community includes 32 nodes, the average degree of nodes in this data set is 16, and z edges are equally shared among different nodes. Edges are independent of each other, and there is a higher probability of an edge between two nodes in the same community, and a lower probability of an edge between two nodes in different communities. The whole network is divided into 10 moments.

[0056] image 3 (a) is a comparison diagram of the change of modularity after the community division of the data set SYN-FIX (z=3) at different times between the present invention ...

example 2

[0060] Example 2 real data

[0061] Enronemail dataset

[0062] The Enron email data set is a data set of employees of Enron Corporation in the United States using email communication, in which each employee's email account is a node, and the behavior of sending / sending emails between employees is an edge. The present invention uses the mail sending situation of Enron Company in 2001 as a data set, which includes 898 nodes and 5674 edges. The present invention divides the enron mail data set into 12 time points according to 12 months in 2001, selects the nodes with the top 30% of node MP values ​​as the core nodes, and installs the steps described in this section to socially divide the Enron mail data set .

[0063] Figure 6 (a) is a comparison diagram of the modularity change after the community division of the Enronemail data set at different times by the present invention and the FacetNet method. As can be seen from the figure, the present invention calculates and divide...

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 discloses a dynamic social network community structure evolution method based on incremental clustering to solve the problems of community structure detection and communication evolution tracking in a large scale network. The method comprises a step of extracting the core node of a whole network to form a core sub graph, a step of running a hierarchical clustering algorithm on the core sub graph at a time t=0 to obtain the initial structure of a core community, and using an extended algorithm on the above basis to obtain the community structure of the whole network, and a step of using an incremental clustering algorithm to obtain the core community structure of the whole network at present time according to the dynamic evolution condition of an adjacent time network at a time t which is larger than 0 and extending the core community structure to obtain a whole community structure. Through introducing the core sub graph, the incremental calculation in the whole network is avoided, the processing speed is accelerated, and thus the method is suitable for the community discovery in the large scale network. In addition, through introducing the concept of a community structure shift, the large error of the community structure after long time evolution is avoided, and the accuracy of community evolution tracking is improved.

Description

technical field [0001] The present invention relates to the fields of data mining and complex network analysis, in particular to a dynamic social network community division method, specifically a dynamic social network community structure evolution method and system based on incremental clustering. Background technique [0002] With the development of information science and technology, network data in various fields is increasing exponentially, such as more and more mail networks in mail communication, telephone communication networks accumulated in telephone communication networks, protein networks in the field of biological sciences, etc. Wait. Research on these network data can help relevant personnel to analyze network characteristics and achieve the purpose of making full use of these networks. [0003] Among various types of complex networks, there are some networks that evolve with time. For example, in recent years, more and more researchers use graph theory to stu...

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/00
Inventor 刘瑶刘峤秦志光其他发明人请求不公开姓名
Owner UNIV OF ELECTRONICS SCI & TECH OF CHINA
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