.png){kind=icon}
Return
Node attraction-facilitated evolution algorithm for community detection in networks
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-018-3267-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Network model recently has become a popular tool for studying complex systems. Detecting meaningful natural groups of nodes called communities in complex networks is an important task in network modeling and analysis. In this paper, the automatic network community detection is formulated as an optimization problem facilitated by node attraction. The basic idea is envision a network as a system of nodes where each node is attracted by its local neighbors. An evolution community detection algorithm is introduced, which employs a metric, named modularity Q as the fitness function and applies node attraction and modularity-based grouping crossover operator. The proposed algorithm faithfully captures the natural communities with high quality. Node attraction is easy to use for the speed up of the convergence of evolution algorithm to better partitions and for making the algorithm more stable. Node attraction does not require any threshold value. Experiments on synthetic and real-world networks further demonstrate the effectiveness of the proposed approach.
Keywords:
Community detection
Complex networks
Evolutionary algorithms
Node attraction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveA comparative analysis of evolutionary and memetic algorithms for community detection from signed social networks.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
ShareSaveShareSave
View more