.png){kind=icon}
.png){kind=icon}
Return
Multiobjective Optimization and Local Merge for Clustering Attributed Graphs
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2018.2889413.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Methods for detecting the community structure in complex networks have mainly focused on network topology, neglecting the rich content information often associated with nodes. In the last few years, the compositional dimension contained in many real-world networks has been recognized fundamental to find network divisions which better reflect group organization. In this paper, we propose a multiobjective genetic framework which integrates the topological and compositional dimensions to uncover community structure in attributed networks. The approach allows to experiment different structural measures to search for densely connected communities, and similarity measures between attributes to obtain high intracommunity feature homogeneity. An efficient and efficacious post-processing local merge procedure enables the generation of high quality solutions, as confirmed by the experimental results on both synthetic and real-world networks, and the comparison with several state-of-the-art methods.
Keywords:
Optimization
Genetic algorithms
Entropy
Density measurement
Cybernetics
Complex networks
Genetics
Attributed graphs
community detection
genetic algorithms
multiobjective optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W