4.7 Article

An effective and scalable overlapping community detection approach: Integrating social identity model and game theory

期刊

APPLIED MATHEMATICS AND COMPUTATION
卷 390, 期 -, 页码 -

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2020.125601

关键词

Overlapping community detection; Social identity model; High-order proximities; Non-cooperative game; Stochastic gradient-ascent

资金

  1. National Key Research and Development Program of China [2019YFB1405000]
  2. National Natural Science Foundation of China [71871109, 71871233, 71801123, 91646204]
  3. Beijing Natural Science Foundation [9182015]

向作者/读者索取更多资源

The SIMGT approach, integrating social identity model and game theory, effectively detects overlapping communities in complex networks, revealing community structures accurately. By incorporating weighting, rewiring, nodes' utility functions, and non-cooperative games, SIMGT outperforms benchmark algorithms and demonstrates scalability, especially when utilizing the Jaccard coefficient for community detection.
Because of its broad real-life application, community detection (in the realm of a complex network) is an attractive challenge to many researchers. However, current methods fail to reveal the full community structure and its formation process. Thus, here we present SIMGT, an effective and Scalable approach that detects overlapping communities: Integrating social identity Model and Game Theory. Inspired by social identity theory and nodes' high-order proximities, first we weight and rewire the original network, then we associate each node with a new utility function. Next, we model community formation as a non-cooperative game among all nodes, and we regard the nodes as self-interested players. Further, we use a stochastic gradient-ascent method to update players' strategies toward different communities, and prove that our game greatly resembles and matches how a potential game works (in the classical sense in game theory), indicating that the Nash equilibrium point must exist. Finally, we implement comprehensive experiments on several synthetic and real-life networks. The results show that whatever weighting strategy we choose, SIMGT can gain better performance on community detection task. In particular, SIMGT achieves a best result when we choose the Jaccard coefficient. After comparing SIMGT with six benchmark algorithms, we obtain convincing results in terms of how well the algorithms reveal communities, as well as algorithms' scalability. (C) 2020 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据