An Algorithm Q-PSO for Community Detection in Complex Networks

Xiao Cai, Yuan Shi, Youze Zhu, Yulu Qiao, Fang Hu
{"title":"An Algorithm Q-PSO for Community Detection in Complex Networks","authors":"Xiao Cai, Yuan Shi, Youze Zhu, Yulu Qiao, Fang Hu","doi":"10.1109/DCABES.2017.23","DOIUrl":null,"url":null,"abstract":"In this paper, based on the particle swarm optimization (PSO) algorithm, introducing the idea of modularity function optimization, a new algorithm Q-PSO for detecting community is proposed. This algorithm can identify the community structure accurately and effectively. In order to verify the performance of this algorithm, which is tested on several representative real-world networks and a set of computer-generated networks based on LFR-benchmark. The experimental results demonstrated that this algorithm can identify the communities accurately, and compared with CNM, Walktrap and infomap algorithms, the presented algorithm can acquire higher values of modularity and NMI in most networks.","PeriodicalId":446641,"journal":{"name":"2017 16th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 16th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCABES.2017.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In this paper, based on the particle swarm optimization (PSO) algorithm, introducing the idea of modularity function optimization, a new algorithm Q-PSO for detecting community is proposed. This algorithm can identify the community structure accurately and effectively. In order to verify the performance of this algorithm, which is tested on several representative real-world networks and a set of computer-generated networks based on LFR-benchmark. The experimental results demonstrated that this algorithm can identify the communities accurately, and compared with CNM, Walktrap and infomap algorithms, the presented algorithm can acquire higher values of modularity and NMI in most networks.
复杂网络中社区检测的Q-PSO算法
本文在粒子群优化(PSO)算法的基础上,引入模块化函数优化的思想,提出了一种新的群体检测算法Q-PSO。该算法能够准确有效地识别社区结构。为了验证该算法的性能,在几个具有代表性的真实网络和一组基于lfr基准的计算机生成的网络上进行了测试。实验结果表明,该算法可以准确地识别社区,与CNM、Walktrap和infomap算法相比,该算法在大多数网络中可以获得更高的模块化值和NMI值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信