A Generalized Modularity for Computing Community Structure in Fully Signed Networks

Abstract

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.