A Generalized Modularity for Computing Community Structure in Fully Signed Networks

The community structure in fully signed networks that considers both node attributes and edge signs is important in computational social science; however, its physical description still requires further exploration, and the corresponding measurement remains lacking. In this paper, we present a gener...

Full description

Saved in:
Bibliographic Details
Main Authors: Xiaochen He, Ruochen Zhang, Bin Zhu
Format: Article
Language:English
Published: Wiley 2023-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2023/8767131
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849396226477260800
author Xiaochen He
Ruochen Zhang
Bin Zhu
author_facet Xiaochen He
Ruochen Zhang
Bin Zhu
author_sort Xiaochen He
collection DOAJ
description The community structure in fully signed networks that considers both node attributes and edge signs is important in computational social science; however, its physical description still requires further exploration, and the corresponding measurement remains lacking. In this paper, we present a generalized framework of community structure in fully signed networks, based on which a variant of modularity is designed. An optimization algorithm that maximizes modularity to detect potential communities is also proposed. Experiments show that the proposed method can efficiently optimize the objective function and perform effective community detection.
format Article
id doaj-art-b4a6e4fee00746f5bba9abd52d58ad23
institution Kabale University
issn 1099-0526
language English
publishDate 2023-01-01
publisher Wiley
record_format Article
series Complexity
spelling doaj-art-b4a6e4fee00746f5bba9abd52d58ad232025-08-20T03:39:23ZengWileyComplexity1099-05262023-01-01202310.1155/2023/8767131A Generalized Modularity for Computing Community Structure in Fully Signed NetworksXiaochen He0Ruochen Zhang1Bin Zhu2School of Public Policy and AdministrationSchool of Economics and ManagementSchool of Public Health and Emergency ManagementThe community structure in fully signed networks that considers both node attributes and edge signs is important in computational social science; however, its physical description still requires further exploration, and the corresponding measurement remains lacking. In this paper, we present a generalized framework of community structure in fully signed networks, based on which a variant of modularity is designed. An optimization algorithm that maximizes modularity to detect potential communities is also proposed. Experiments show that the proposed method can efficiently optimize the objective function and perform effective community detection.http://dx.doi.org/10.1155/2023/8767131
spellingShingle Xiaochen He
Ruochen Zhang
Bin Zhu
A Generalized Modularity for Computing Community Structure in Fully Signed Networks
Complexity
title A Generalized Modularity for Computing Community Structure in Fully Signed Networks
title_full A Generalized Modularity for Computing Community Structure in Fully Signed Networks
title_fullStr A Generalized Modularity for Computing Community Structure in Fully Signed Networks
title_full_unstemmed A Generalized Modularity for Computing Community Structure in Fully Signed Networks
title_short A Generalized Modularity for Computing Community Structure in Fully Signed Networks
title_sort generalized modularity for computing community structure in fully signed networks
url http://dx.doi.org/10.1155/2023/8767131
work_keys_str_mv AT xiaochenhe ageneralizedmodularityforcomputingcommunitystructureinfullysignednetworks
AT ruochenzhang ageneralizedmodularityforcomputingcommunitystructureinfullysignednetworks
AT binzhu ageneralizedmodularityforcomputingcommunitystructureinfullysignednetworks
AT xiaochenhe generalizedmodularityforcomputingcommunitystructureinfullysignednetworks
AT ruochenzhang generalizedmodularityforcomputingcommunitystructureinfullysignednetworks
AT binzhu generalizedmodularityforcomputingcommunitystructureinfullysignednetworks