用于复杂网络中社群检测的基于连续编码的改进型多目标进化算法

Jun Fu;Yan Wang
{"title":"用于复杂网络中社群检测的基于连续编码的改进型多目标进化算法","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":"{\"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}","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

摘要

社群检测是网络科学中的一个基础领域,也是一个被广泛研究的领域。为了进行社群检测,人们提出了各种有竞争力的多目标进化算法(MOEAs)。值得注意的是,最新的连续编码(CE)方法将原来的离散问题转化为连续问题,可以实现更好的社区划分。但是,原有的 CE 忽略了节点的重要结构特征,如聚类系数(CC),导致初始解不理想,降低了社区检测的性能。因此,我们提出了一种简单的方案,有效利用节点结构特征向量来增强社群检测。具体来说,我们提出了一种基于 CE 和 CC(CE-CC)的 MOEA,称为 CECC-Net。在 CECC-Net 中,CC 向量与连续向量(即与边缘相关的连续变量 $/mathbf{x}$)进行哈达玛乘积,从而得到一个改进的初始个体。然后,将非线性变换应用于连续值个体,就能得到离散值群体分组解决方案。此外,还设计了一个相应的自适应算子,作为该方案的重要组成部分,以减轻特征向量对群体多样性的负面影响。通过消融和对比实验,验证了所提方案的有效性。在合成网络和真实世界网络上的实验结果表明,与几种最先进的基于 EA 的群落检测算法相比,所提出的算法具有很强的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Improved Continuous-Encoding-Based Multiobjective Evolutionary Algorithm for Community Detection in Complex Networks
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.70
自引率
0.00%
发文量
0
期刊最新文献
Table of Contents Front Cover IEEE Transactions on Artificial Intelligence Publication Information Table of Contents Front Cover
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1