An Enhanced Multi-Objective Evolutionary Algorithm with Decomposition for Signed Community Detection Problem

Mayasa M. Abdulrahman, Amenah Dahim Abood, B. Attea
{"title":"An Enhanced Multi-Objective Evolutionary Algorithm with Decomposition for Signed Community Detection Problem","authors":"Mayasa M. Abdulrahman, Amenah Dahim Abood, B. Attea","doi":"10.1109/AiCIS51645.2020.00017","DOIUrl":null,"url":null,"abstract":"Community detection is useful for better understanding of the structure of complex networks, and aids in the extraction of required information from such networks. Community detection problem can be modelled as an NP-hard combinatorial optimization problem. Many optimization algorithms (both single -objective and multi-objectives) have been implemented to address community detection problem, where the first objective is usually representing the maximization of the internal connections, while the second objective represents the minimization of the external connections between the communities or clusters. In this research, an enhanced mutation operator is proposed for improving the search performance of multi-objective evolutionary algorithm with decomposition (MOEA/D), based on the types of the connections between the nodes. The proposed algorithm was evaluated based on a set of five benchmark datasets, in terms of Normalized Mutual Information (NMI), Weighted NMI (WNMI), Signed Modularity (Qs), and Error rate (Error). The results showed that our proposed enhanced algorithm has attained the best position as compared to the standard version of MOEA/D, and other state of art research papers.","PeriodicalId":388584,"journal":{"name":"2020 2nd Annual International Conference on Information and Sciences (AiCIS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 2nd Annual International Conference on Information and Sciences (AiCIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AiCIS51645.2020.00017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Community detection is useful for better understanding of the structure of complex networks, and aids in the extraction of required information from such networks. Community detection problem can be modelled as an NP-hard combinatorial optimization problem. Many optimization algorithms (both single -objective and multi-objectives) have been implemented to address community detection problem, where the first objective is usually representing the maximization of the internal connections, while the second objective represents the minimization of the external connections between the communities or clusters. In this research, an enhanced mutation operator is proposed for improving the search performance of multi-objective evolutionary algorithm with decomposition (MOEA/D), based on the types of the connections between the nodes. The proposed algorithm was evaluated based on a set of five benchmark datasets, in terms of Normalized Mutual Information (NMI), Weighted NMI (WNMI), Signed Modularity (Qs), and Error rate (Error). The results showed that our proposed enhanced algorithm has attained the best position as compared to the standard version of MOEA/D, and other state of art research papers.
签名社区检测问题的一种改进多目标分解进化算法
社区检测有助于更好地理解复杂网络的结构,并有助于从这些网络中提取所需的信息。社区检测问题可以建模为NP-hard组合优化问题。许多优化算法(单目标和多目标)已经实现来解决社区检测问题,其中第一个目标通常表示内部连接的最大化,而第二个目标表示社区或集群之间外部连接的最小化。本研究提出了一种基于节点间连接类型的增强突变算子,以提高多目标分解进化算法(MOEA/D)的搜索性能。基于标准化互信息(NMI)、加权互信息(WNMI)、签名模块化(Qs)和错误率(Error)五个基准数据集对该算法进行了评估。结果表明,与标准版本的MOEA/D和其他先进的研究论文相比,我们提出的增强算法达到了最佳位置。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信