{"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.
期刊介绍:
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.