GraphReformCD: Graph Reformulation for Effective Community Detection in Real-World Graphs
- Authors
- Hong, Jiwon; Seo, Dong-Hyuk; Ahn, Jeewon; Kim, Sang Wook
- Issue Date
- Apr-2022
- Publisher
- Association for Computing Machinery, Inc
- Keywords
- clustering; community detection; graph reformulation; nearest neighbor graph; social networks
- Citation
- WWW 2022 - Companion Proceedings of the Web Conference 2022, pp.180 - 183
- Indexed
- SCOPUS
- Journal Title
- WWW 2022 - Companion Proceedings of the Web Conference 2022
- Start Page
- 180
- End Page
- 183
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/172613
- DOI
- 10.1145/3487553.3524240
- Abstract
- Community detection, one of the most important tools for graph analysis, finds groups of strongly connected nodes in a graph. However, community detection may suffer from misleading information in a graph, such as a nontrivial number of inter-community edges or an insufficient number of intra-community edges. In this paper, we propose GraphReformCD that reformulates a given graph into a new graph in such a way that community detection can be conducted more accurately. For the reformulation, it builds a k-nearest neighbor graph that gives a node k opportunities to connect itself to those nodes that are likely to belong to the same community together with the node. To find the nodes that belong to the same community, it employs the structural similarities such as Jaccard index and SimRank. To validate the effectiveness of our GraphReformCD, we perform extensive experiments with six real-world and four synthetic graphs. The results show that our GraphReformCD enables state-of-the-art methods to improve their accuracy significantly up to 40.6% in community detection.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/172613)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.