一种用于解决社区检测问题的增强进化方法

IF 2.7 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Salmi Cheikh, Bouchema Sara, Zaoui Sara
{"title":"一种用于解决社区检测问题的增强进化方法","authors":"Salmi Cheikh, Bouchema Sara, Zaoui Sara","doi":"10.1080/24751839.2021.1987076","DOIUrl":null,"url":null,"abstract":"ABSTRACT Community detection concepts can be encountered in many disciplines such as sociology, biology, and computer science, etc. Nowadays, a huge amount of data is produced by digital social networks and needs to be processed. In fact, the analysis of this data makes it possible to extract new knowledge about groups of individuals, their communication modes, and orientations. This knowledge can be exploited in marketing, security, Web usage, and many other decisional purposes. Community detection problem (CDP) is NP-hard and many algorithms have been designed to solve it but not to a satisfactory level. In this paper, we propose a hybrid heuristic approach based on a combination of genetic algorithms and tabu search that does not need any prior knowledge about the number or the size of each community to tackle the CDP. The method is efficient because it uses an enhanced encoding, which excludes redundant chromosomes while performing genetic operations. This approach is evaluated on a wide range of real-world networks. The result of experiments shows that the proposed algorithm outperforms many other algorithms according to the modularity measure.","PeriodicalId":32180,"journal":{"name":"Journal of Information and Telecommunication","volume":"6 1","pages":"83 - 100"},"PeriodicalIF":2.7000,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An enhanced evolutionary approach for solving the community detection problem\",\"authors\":\"Salmi Cheikh, Bouchema Sara, Zaoui Sara\",\"doi\":\"10.1080/24751839.2021.1987076\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT Community detection concepts can be encountered in many disciplines such as sociology, biology, and computer science, etc. Nowadays, a huge amount of data is produced by digital social networks and needs to be processed. In fact, the analysis of this data makes it possible to extract new knowledge about groups of individuals, their communication modes, and orientations. This knowledge can be exploited in marketing, security, Web usage, and many other decisional purposes. Community detection problem (CDP) is NP-hard and many algorithms have been designed to solve it but not to a satisfactory level. In this paper, we propose a hybrid heuristic approach based on a combination of genetic algorithms and tabu search that does not need any prior knowledge about the number or the size of each community to tackle the CDP. The method is efficient because it uses an enhanced encoding, which excludes redundant chromosomes while performing genetic operations. This approach is evaluated on a wide range of real-world networks. The result of experiments shows that the proposed algorithm outperforms many other algorithms according to the modularity measure.\",\"PeriodicalId\":32180,\"journal\":{\"name\":\"Journal of Information and Telecommunication\",\"volume\":\"6 1\",\"pages\":\"83 - 100\"},\"PeriodicalIF\":2.7000,\"publicationDate\":\"2021-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Information and Telecommunication\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/24751839.2021.1987076\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information and Telecommunication","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/24751839.2021.1987076","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

摘要社区检测的概念在社会学、生物学和计算机科学等许多学科中都可以遇到。如今,数字社交网络产生了大量的数据,需要进行处理。事实上,通过对这些数据的分析,可以提取关于个人群体、他们的沟通模式和取向的新知识。这些知识可以用于营销、安全、网络使用和许多其他决策目的。社区检测问题(CDP)是一个NP难问题,已经设计了许多算法来解决它,但并没有达到令人满意的水平。在本文中,我们提出了一种基于遗传算法和禁忌搜索相结合的混合启发式方法,该方法不需要任何关于每个社区的数量或大小的先验知识来解决CDP。这种方法是有效的,因为它使用了增强的编码,在进行遗传操作时排除了多余的染色体。这种方法在广泛的现实世界网络上进行了评估。实验结果表明,该算法在模块性度量方面优于其他算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An enhanced evolutionary approach for solving the community detection problem
ABSTRACT Community detection concepts can be encountered in many disciplines such as sociology, biology, and computer science, etc. Nowadays, a huge amount of data is produced by digital social networks and needs to be processed. In fact, the analysis of this data makes it possible to extract new knowledge about groups of individuals, their communication modes, and orientations. This knowledge can be exploited in marketing, security, Web usage, and many other decisional purposes. Community detection problem (CDP) is NP-hard and many algorithms have been designed to solve it but not to a satisfactory level. In this paper, we propose a hybrid heuristic approach based on a combination of genetic algorithms and tabu search that does not need any prior knowledge about the number or the size of each community to tackle the CDP. The method is efficient because it uses an enhanced encoding, which excludes redundant chromosomes while performing genetic operations. This approach is evaluated on a wide range of real-world networks. The result of experiments shows that the proposed algorithm outperforms many other algorithms according to the modularity measure.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.50
自引率
0.00%
发文量
18
审稿时长
27 weeks
×
引用
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学术官方微信