GraphReformCD: Graph Reformulation for Effective Community Detection in Real-World Graphs
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hong, Jiwon | - |
dc.contributor.author | Seo, Dong-Hyuk | - |
dc.contributor.author | Ahn, Jeewon | - |
dc.contributor.author | Kim, Sang Wook | - |
dc.date.accessioned | 2022-10-25T07:46:50Z | - |
dc.date.available | 2022-10-25T07:46:50Z | - |
dc.date.created | 2022-10-06 | - |
dc.date.issued | 2022-04 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/172613 | - |
dc.description.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. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Association for Computing Machinery, Inc | - |
dc.title | GraphReformCD: Graph Reformulation for Effective Community Detection in Real-World Graphs | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sang Wook | - |
dc.identifier.doi | 10.1145/3487553.3524240 | - |
dc.identifier.scopusid | 2-s2.0-85137530164 | - |
dc.identifier.bibliographicCitation | WWW 2022 - Companion Proceedings of the Web Conference 2022, pp.180 - 183 | - |
dc.relation.isPartOf | WWW 2022 - Companion Proceedings of the Web Conference 2022 | - |
dc.citation.title | WWW 2022 - Companion Proceedings of the Web Conference 2022 | - |
dc.citation.startPage | 180 | - |
dc.citation.endPage | 183 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Graph algorithms | - |
dc.subject.keywordPlus | Graph structures | - |
dc.subject.keywordPlus | Nearest neighbor search | - |
dc.subject.keywordPlus | Social networking (online) | - |
dc.subject.keywordPlus | Population dynamics | - |
dc.subject.keywordPlus | Clusterings | - |
dc.subject.keywordPlus | Community detection | - |
dc.subject.keywordPlus | Graph analysis | - |
dc.subject.keywordPlus | Graph reformulation | - |
dc.subject.keywordPlus | Near neighbor graph | - |
dc.subject.keywordPlus | Nearest-neighbour | - |
dc.subject.keywordPlus | Neighbor graph | - |
dc.subject.keywordPlus | Real-world graphs | - |
dc.subject.keywordPlus | Social network | - |
dc.subject.keywordPlus | Strongly connected | - |
dc.subject.keywordAuthor | clustering | - |
dc.subject.keywordAuthor | community detection | - |
dc.subject.keywordAuthor | graph reformulation | - |
dc.subject.keywordAuthor | nearest neighbor graph | - |
dc.subject.keywordAuthor | social networks | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/3487553.3524240 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.