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

Method for partitioning communities in complex dynamic network by virtue of multi-objective local search based on decomposition

A technology of complex dynamic network and community division, applied in the field of local search multi-objective complex dynamic network community division based on decomposition, can solve the problems of insufficient local search ability of genetic algorithm, and the community structure cannot well reflect the characteristics of community structure, etc. Achieve the effect of overcoming inaccurate community division and overcoming the instability of community structure

Inactive Publication Date: 2014-04-02
XIDIAN UNIV
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This method regards the dynamic network community structure detection problem as a two-objective problem, and then uses the non-dominated multi-objective genetic algorithm to optimize the two objective functions simultaneously. The objective function does not need to set the biased parameters and the number of community division modules in advance. However, due to the insufficient local search ability of the genetic algorithm, the community structure obtained when dealing with a dynamic network with high complexity cannot reflect the dynamic network well. Characteristics of the community structure in

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 partitioning communities in complex dynamic network by virtue of multi-objective local search based on decomposition
  • Method for partitioning communities in complex dynamic network by virtue of multi-objective local search based on decomposition
  • Method for partitioning communities in complex dynamic network by virtue of multi-objective local search based on decomposition

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0041] refer to figure 1 , the implementation steps of the present invention are as follows:

[0042] Step 1, input the target dynamic network DN={G 1 ,...,G t ,...G T}.

[0043] where DN represents a dynamic network sequence composed of T time period networks, and G t Represents the network on time period t, t∈(1,...,T), where T is the total number of time periods.

[0044] Step 2: Initially divide the network in the first time period.

[0045] network G 1 The community structure detection in the network is regarded as a single-objective optimization problem, and the network community structure detection method based on dense matrix calculation proposed by Gong Maoguo et al. in "Memetic algorithm for community detection in networks" ("Physical Review E", 2010) Find the community partition CR of the network on the initial time period 1 , the implementation steps are as follows:

[0046] (2a) Construct the initialization population, adopt the direct coding method to in...

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 partitioning communities in a complex dynamic network by virtue of multi-objective local search based on decomposition, and the method is mainly used for solving the problem of poor community partitioning accuracy in the course of processing the complex dynamic network in the prior art. The method is implemented through the following steps: (1) determining objective functions; (2) constructing an initial solution population, and initializing individuals in the solution population by a neighborhood real-number encoding method; (3) sequentially selecting the individuals from the solution population and then carrying out cross variation on the individuals to obtain progeny individuals; (4) updating the solution population by virtue of the progeny individuals; (5) locally searching and updating the solution population; (6) judging whether the population evolution process is terminated: if iterations reach the preset times, executing a step (7), otherwise, transferring to the step (3); and (7) selecting the optimum community partition according to the maximum module density principle. The method disclosed by the invention has the beneficial effects that two objective functions can be optimized at the same time, synchronous analysis of community partition and community evolution is realized, the community partitioning accuracy is improved, and the problem of detection of a community structure in the complex dynamic network can be solved.

Description

technical field [0001] The invention belongs to the field of complex networks, and relates to a dynamic network community division method, in particular to a decomposition-based local search multi-objective complex dynamic network community division method, which can be used to detect community structures in complex dynamic networks. Background technique [0002] Since the end of the 20th century, the rapid development of information technology represented by the internet has brought human society into the network era. In the real world, many systems exist in the form of networks, from the World Wide Web in the Internet world to the route network in the transportation system, from the VLSI in the electronic field to the large-scale power network in the power system, from the cells in the biological system From neural networks to protein interaction networks, from social networks in social relationships to collaborative networks between scientists, complex networks are everyw...

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 Patents(China)
IPC IPC(8): H04L12/28H04L12/26
Inventor 公茂果焦李成王艳辉马里佳马晶晶马文萍付宝侯田王爽
Owner XIDIAN UNIV
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