{"title":"An Improved Continuous-Encoding-Based Multiobjective Evolutionary Algorithm for Community Detection in Complex Networks","authors":"Jun Fu;Yan Wang","doi":"10.1109/TAI.2024.3442153","DOIUrl":null,"url":null,"abstract":"Community detection is a fundamental and widely studied field in network science. To perform community detection, various competitive multiobjective evolutionary algorithms (MOEAs) have been proposed. It is worth noting that the latest continuous encoding (CE) method transforms the original discrete problem into a continuous one, which can achieve better community partitioning. However, the original CE ignored important structural features of nodes, such as the clustering coefficient (CC), resulting in poor initial solutions and reduced the performance of community detection. Therefore, we propose a simple scheme to effectively utilize node structure feature vectors to enhance community detection. Specifically, a CE and CC-based (CE-CC) MOEA called CECC-Net is proposed. In CECC-Net, the CC vector performs the Hadamard product with a continuous vector (i.e., a concatenation of the continuous variables \n<inline-formula><tex-math>$\\mathbf{x}$</tex-math></inline-formula>\n associated with the edges), resulting in an improved initial individual. Then, applying the nonlinear transformation to the continuous-valued individual yields a discrete-valued community grouping solution. Furthermore, a corresponding adaptive operator is designed as an essential part of this scheme to mitigate the negative effects of feature vectors on population diversity. The effectiveness of the proposed scheme was validated through ablation and comparative experiments. Experimental results on synthetic and real-world networks demonstrate that the proposed algorithm has competitive performance in comparison with several state-of-the-art EA-based community detection algorithms.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"5 11","pages":"5815-5827"},"PeriodicalIF":0.0000,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on artificial intelligence","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10634576/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Community detection is a fundamental and widely studied field in network science. To perform community detection, various competitive multiobjective evolutionary algorithms (MOEAs) have been proposed. It is worth noting that the latest continuous encoding (CE) method transforms the original discrete problem into a continuous one, which can achieve better community partitioning. However, the original CE ignored important structural features of nodes, such as the clustering coefficient (CC), resulting in poor initial solutions and reduced the performance of community detection. Therefore, we propose a simple scheme to effectively utilize node structure feature vectors to enhance community detection. Specifically, a CE and CC-based (CE-CC) MOEA called CECC-Net is proposed. In CECC-Net, the CC vector performs the Hadamard product with a continuous vector (i.e., a concatenation of the continuous variables
$\mathbf{x}$
associated with the edges), resulting in an improved initial individual. Then, applying the nonlinear transformation to the continuous-valued individual yields a discrete-valued community grouping solution. Furthermore, a corresponding adaptive operator is designed as an essential part of this scheme to mitigate the negative effects of feature vectors on population diversity. The effectiveness of the proposed scheme was validated through ablation and comparative experiments. Experimental results on synthetic and real-world networks demonstrate that the proposed algorithm has competitive performance in comparison with several state-of-the-art EA-based community detection algorithms.
社群检测是网络科学中的一个基础领域,也是一个被广泛研究的领域。为了进行社群检测,人们提出了各种有竞争力的多目标进化算法(MOEAs)。值得注意的是,最新的连续编码(CE)方法将原来的离散问题转化为连续问题,可以实现更好的社区划分。但是,原有的 CE 忽略了节点的重要结构特征,如聚类系数(CC),导致初始解不理想,降低了社区检测的性能。因此,我们提出了一种简单的方案,有效利用节点结构特征向量来增强社群检测。具体来说,我们提出了一种基于 CE 和 CC(CE-CC)的 MOEA,称为 CECC-Net。在 CECC-Net 中,CC 向量与连续向量(即与边缘相关的连续变量 $/mathbf{x}$)进行哈达玛乘积,从而得到一个改进的初始个体。然后,将非线性变换应用于连续值个体,就能得到离散值群体分组解决方案。此外,还设计了一个相应的自适应算子,作为该方案的重要组成部分,以减轻特征向量对群体多样性的负面影响。通过消融和对比实验,验证了所提方案的有效性。在合成网络和真实世界网络上的实验结果表明,与几种最先进的基于 EA 的群落检测算法相比,所提出的算法具有很强的竞争力。