Dual Structural Consistency Preserving Community Detection on Social Networks

Community detection on social networks is a fundamental and crucial task in the research field of social computing. Here we propose
DSCPCD
—a dual structural consistency preserving community detection method to uncover the hidden community structure, which is designed regarding two criteria: 1) users interact with each other in a manner combining uncertainty and certainty; 2) original explicit network (two linked users are friends) and potential implicit network (two linked users have common friends) should have a consistent community structure, i.e.,
dual structural consistency
. Particularly,
DSCPCD
formulates each user in a social network as an individual in an evolutionary game associated with community-aware payoff settings, where the community state evolves under the guidance of replicator dynamics. To further seek each user's membership, we develop a
happiness
index to measure all users’ satisfaction towards two community structures in explicit and implicit networks, meanwhile, the dual community structural consistency between the two networks is also characterized. Specifically, each user is assumed to maximize the
happiness
bounded by the evolutionary community state. We evaluate
DSCPCD
on several real-world and synthetic datasets, and the results show that it can yield substantial performance gains in terms of detection accuracy over several baselines.