An improved game-theoretic approach to uncover overlapping communities
How can we uncover overlapping communities from complex networks to understand the inherent structures and functions? Chen et al. firstly proposed a community game (Game) to study this problem, and the overlapping communities have been discovered when the game is convergent. It is based on the assum...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Published: |
World Scientific Publishing
2017
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/46931/ |
| _version_ | 1848797430641852416 |
|---|---|
| author | Sun, Hong-Liang Ch'ng, Eugene Yong, Xi Garibaldi, Jonathan M. See, Simon Chen, Duan-Bing |
| author_facet | Sun, Hong-Liang Ch'ng, Eugene Yong, Xi Garibaldi, Jonathan M. See, Simon Chen, Duan-Bing |
| author_sort | Sun, Hong-Liang |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | How can we uncover overlapping communities from complex networks to understand the inherent structures and functions? Chen et al. firstly proposed a community game (Game) to study this problem, and the overlapping communities have been discovered when the game is convergent. It is based on the assumption that each vertex of the underlying network is a rational game player to maximize its utility. In this paper, we investigate how similar vertices affect the formation of community game. The Adamic–Adar Index (AA Index) has been employed to define the new utility function. This novel method has been evaluated on both synthetic and real-world networks. Experimental study shows that it has significant improvement of accuracy (from 4.8% to 37.6%) compared with the Game on 10 real networks. It is more efficient on Facebook networks (FN) and Amazon co-purchasing networks than on other networks. This result implicates that “friend circles of friends” of Facebook are valuable to understand the overlapping community division. |
| first_indexed | 2025-11-14T20:03:45Z |
| format | Article |
| id | nottingham-46931 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T20:03:45Z |
| publishDate | 2017 |
| publisher | World Scientific Publishing |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-469312020-05-04T19:05:01Z https://eprints.nottingham.ac.uk/46931/ An improved game-theoretic approach to uncover overlapping communities Sun, Hong-Liang Ch'ng, Eugene Yong, Xi Garibaldi, Jonathan M. See, Simon Chen, Duan-Bing How can we uncover overlapping communities from complex networks to understand the inherent structures and functions? Chen et al. firstly proposed a community game (Game) to study this problem, and the overlapping communities have been discovered when the game is convergent. It is based on the assumption that each vertex of the underlying network is a rational game player to maximize its utility. In this paper, we investigate how similar vertices affect the formation of community game. The Adamic–Adar Index (AA Index) has been employed to define the new utility function. This novel method has been evaluated on both synthetic and real-world networks. Experimental study shows that it has significant improvement of accuracy (from 4.8% to 37.6%) compared with the Game on 10 real networks. It is more efficient on Facebook networks (FN) and Amazon co-purchasing networks than on other networks. This result implicates that “friend circles of friends” of Facebook are valuable to understand the overlapping community division. World Scientific Publishing 2017-09-07 Article PeerReviewed Sun, Hong-Liang, Ch'ng, Eugene, Yong, Xi, Garibaldi, Jonathan M., See, Simon and Chen, Duan-Bing (2017) An improved game-theoretic approach to uncover overlapping communities. International Journal of Modern Physics C, 28 (8). 1750112-1-1750112-17. ISSN 1793-6586 Overlapping community detection; game theory; complex networks http://www.worldscientific.com/doi/abs/10.1142/S0129183117501121 doi:10.1142/S0129183117501121 doi:10.1142/S0129183117501121 |
| spellingShingle | Overlapping community detection; game theory; complex networks Sun, Hong-Liang Ch'ng, Eugene Yong, Xi Garibaldi, Jonathan M. See, Simon Chen, Duan-Bing An improved game-theoretic approach to uncover overlapping communities |
| title | An improved game-theoretic approach to uncover overlapping communities |
| title_full | An improved game-theoretic approach to uncover overlapping communities |
| title_fullStr | An improved game-theoretic approach to uncover overlapping communities |
| title_full_unstemmed | An improved game-theoretic approach to uncover overlapping communities |
| title_short | An improved game-theoretic approach to uncover overlapping communities |
| title_sort | improved game-theoretic approach to uncover overlapping communities |
| topic | Overlapping community detection; game theory; complex networks |
| url | https://eprints.nottingham.ac.uk/46931/ https://eprints.nottingham.ac.uk/46931/ https://eprints.nottingham.ac.uk/46931/ |