XLoCoFC: A Fast Fuzzy Community Detection Approach Based on Expandable Local Communities Through Max-Membership Degree Propagation

IF 4.5 2区 计算机科学 Q1 COMPUTER SCIENCE, CYBERNETICS
Uttam K. Roy;Pranab K. Muhuri;Sajib K. Biswas
{"title":"XLoCoFC: A Fast Fuzzy Community Detection Approach Based on Expandable Local Communities Through Max-Membership Degree Propagation","authors":"Uttam K. Roy;Pranab K. Muhuri;Sajib K. Biswas","doi":"10.1109/TCSS.2024.3392069","DOIUrl":null,"url":null,"abstract":"Fuzzy community detection (FCD) aims to reveal the community structure by allocating quantitative values to nodes across different communities. This article proposes a fast FCD approach called the Expandable Local Community based Fuzzy Community (XLoCoFC) detection method based on max-membership degree propagation (max-MDP) and normalized peripheral similarity index (\n<inline-formula><tex-math>$ \\boldsymbol{n}\\mathbf{P}\\mathbf{S}\\mathbf{I}$</tex-math></inline-formula>\n). Initially, nodes having comparatively higher \n<inline-formula><tex-math>$ \\boldsymbol{n}\\mathbf{P}\\mathbf{S}\\mathbf{I}$</tex-math></inline-formula>\n values are considered as topologically dominating nodes and selected as seeds. For an initial community, called local community, seed’s \n<inline-formula><tex-math>$ \\boldsymbol{n}\\mathbf{P}\\mathbf{S}\\mathbf{I}$</tex-math></inline-formula>\n values from the respective neighbors’ peripheries are utilized as the neighbors’ membership degrees. Then an iterative process propagates max-membership degrees from nodes to nodes, and \n<inline-formula><tex-math>$ \\boldsymbol{n}\\mathbf{P}\\mathbf{S}\\mathbf{I}$</tex-math></inline-formula>\n values are used as factors in the propagation. In this propagation, local communities having more dominating nodes expand and others contract. The propagation process converges very quickly. Such simplicity in its design makes our proposed XLoCoFC approach to be very fast in finding community structures on large networks. Time complexity of the proposed approach is \n<inline-formula><tex-math>$ \\boldsymbol{O}\\left(\\boldsymbol{n}\\boldsymbol{d}^{2}\\times \\mathbf{lo}\\mathbf{g}_{2} \\boldsymbol{d}+\\mathbf{k}\\mathbf{l}\\mathbf{q}\\right)$</tex-math></inline-formula>\n which is significantly less than the majority of the FCD algorithms, for whom it is either \n<inline-formula><tex-math>$ \\boldsymbol{O}\\left(\\boldsymbol{n}^{2}\\right)$</tex-math></inline-formula>\n or more. Moreover, XLoCoFC has no dependence on any network feature. It does not require tuning of any parameter which may impact its output. To demonstrate the working of the proposed XLoCoFC approach, we conduct extensive performance analysis comparatively by executing a set of existing approaches on several popular real-life and synthetic networks with number of nodes ranging from 24 to 1134 890. Evaluation of the results considering the accuracy and quality metrics as well as a group MCDM technique clearly establishes the superiority of our approach over others.","PeriodicalId":13044,"journal":{"name":"IEEE Transactions on Computational Social Systems","volume":"11 5","pages":"6022-6037"},"PeriodicalIF":4.5000,"publicationDate":"2024-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computational Social Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10550008/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

Abstract

Fuzzy community detection (FCD) aims to reveal the community structure by allocating quantitative values to nodes across different communities. This article proposes a fast FCD approach called the Expandable Local Community based Fuzzy Community (XLoCoFC) detection method based on max-membership degree propagation (max-MDP) and normalized peripheral similarity index ( $ \boldsymbol{n}\mathbf{P}\mathbf{S}\mathbf{I}$ ). Initially, nodes having comparatively higher $ \boldsymbol{n}\mathbf{P}\mathbf{S}\mathbf{I}$ values are considered as topologically dominating nodes and selected as seeds. For an initial community, called local community, seed’s $ \boldsymbol{n}\mathbf{P}\mathbf{S}\mathbf{I}$ values from the respective neighbors’ peripheries are utilized as the neighbors’ membership degrees. Then an iterative process propagates max-membership degrees from nodes to nodes, and $ \boldsymbol{n}\mathbf{P}\mathbf{S}\mathbf{I}$ values are used as factors in the propagation. In this propagation, local communities having more dominating nodes expand and others contract. The propagation process converges very quickly. Such simplicity in its design makes our proposed XLoCoFC approach to be very fast in finding community structures on large networks. Time complexity of the proposed approach is $ \boldsymbol{O}\left(\boldsymbol{n}\boldsymbol{d}^{2}\times \mathbf{lo}\mathbf{g}_{2} \boldsymbol{d}+\mathbf{k}\mathbf{l}\mathbf{q}\right)$ which is significantly less than the majority of the FCD algorithms, for whom it is either $ \boldsymbol{O}\left(\boldsymbol{n}^{2}\right)$ or more. Moreover, XLoCoFC has no dependence on any network feature. It does not require tuning of any parameter which may impact its output. To demonstrate the working of the proposed XLoCoFC approach, we conduct extensive performance analysis comparatively by executing a set of existing approaches on several popular real-life and synthetic networks with number of nodes ranging from 24 to 1134 890. Evaluation of the results considering the accuracy and quality metrics as well as a group MCDM technique clearly establishes the superiority of our approach over others.
XLoCoFC:基于通过最大成员度传播的可扩展本地社群的快速模糊社群检测方法
模糊社区检测(FCD)旨在通过为不同社区的节点分配定量值来揭示社区结构。本文提出了一种基于最大成员度传播(max-MDP)和归一化外围相似性指数($ \boldsymbol{n}\mathbf{P}\mathbf{S}\mathbf{I}$)的快速 FCD 方法,即基于模糊社区的可扩展本地社区(XLoCoFC)检测方法。最初,具有相对较高 $\boldsymbol{n}\mathbf{P}\mathbf{S}\mathbf{I}$ 值的节点被视为拓扑主导节点,并被选为种子节点。对于一个被称为本地社区的初始社区,种子的 $ \boldsymbol{n}\mathbf{P}\mathbf{S}\mathbf{I}$ 值从各自邻居的外围被用作邻居的成员度。然后,一个迭代过程将最大成员度从节点传播到节点,$ \boldsymbol{n}\mathbf{P}\mathbf{S}\mathbf{I}$值被用作传播中的因子。在这个传播过程中,拥有更多支配节点的局部群落会扩大,而其他群落则会缩小。传播过程收敛得非常快。这种简单的设计使我们提出的 XLoCoFC 方法在大型网络中寻找群落结构时非常快速。所提方法的时间复杂度为 $\boldsymbol{O}\left(\boldsymbol{n}\boldsymbol{d}^{2}\times\mathbf{lo}\mathbf{g}_{2}+(\mathbf{k}\mathbf{l}\mathbf{q}\right)$,这比大多数 FCD 算法都要少得多,对它们来说,要么是 $ \boldsymbol{O}left(\boldsymbol{n}^{2}\right)$,要么更多。此外,XLoCoFC 不依赖于任何网络特征。它不需要调整任何可能影响其输出的参数。为了证明所提出的 XLoCoFC 方法的工作原理,我们在几个流行的真实网络和合成网络上执行了一系列现有方法,节点数从 24 到 1134 890 不等,从而进行了广泛的性能比较分析。根据准确性和质量指标以及分组 MCDM 技术对结果进行的评估清楚地证明了我们的方法优于其他方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Computational Social Systems
IEEE Transactions on Computational Social Systems Social Sciences-Social Sciences (miscellaneous)
CiteScore
10.00
自引率
20.00%
发文量
316
期刊介绍: IEEE Transactions on Computational Social Systems focuses on such topics as modeling, simulation, analysis and understanding of social systems from the quantitative and/or computational perspective. "Systems" include man-man, man-machine and machine-machine organizations and adversarial situations as well as social media structures and their dynamics. More specifically, the proposed transactions publishes articles on modeling the dynamics of social systems, methodologies for incorporating and representing socio-cultural and behavioral aspects in computational modeling, analysis of social system behavior and structure, and paradigms for social systems modeling and simulation. The journal also features articles on social network dynamics, social intelligence and cognition, social systems design and architectures, socio-cultural modeling and representation, and computational behavior modeling, and their applications.
×
引用
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学术官方微信