Localized curvature-based combinatorial subgraph sampling for large-scale graphs
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shu, D.W. | - |
dc.contributor.author | Kim, Y. | - |
dc.contributor.author | Kwon, Junseok | - |
dc.date.accessioned | 2023-05-18T08:41:26Z | - |
dc.date.available | 2023-05-18T08:41:26Z | - |
dc.date.issued | 2023-07 | - |
dc.identifier.issn | 0031-3203 | - |
dc.identifier.issn | 1873-5142 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/66570 | - |
dc.description.abstract | This paper introduces a subgraph sampling method based on curvature to train large-scale graphs via mini-batch training. Owing to the difficulty in sampling globally optimal subgraphs from large graphs, we sample the subgraphs to minimize the distributional metric with combinatorial sampling. In particular, we define a combinatorial metric that distributionally measures the similarity between an original graph and all possible node and edge combinations of the subgraphs. Further, we prove that the subgraphs sampled using the probability model proportional to the discrete Ricci curvature (i.e., Ollivier-Ricci curvatures) of the edges can minimize the proposed metric. Moreover, as accurate calculation of the curvature on a large graph is challenging, we propose to use a localized curvature considering only 3-cycles on the graph, suggesting that this is a sufficiently approximated curvature on a sparse graph. We also show that the probability models of conventional sampling methods are related to coarsely approximated curvatures with no cycles, implying that the curvature is closely related to subgraph sampling. The experimental results confirm the feasibility of integrating the proposed curvature-based sampling method into existing graph neural networks to improve performance. © 2023 Elsevier Ltd | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Pergamon Press | - |
dc.title | Localized curvature-based combinatorial subgraph sampling for large-scale graphs | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/j.patcog.2023.109475 | - |
dc.identifier.bibliographicCitation | Pattern Recognition, v.139 | - |
dc.description.isOpenAccess | N | - |
dc.identifier.wosid | 000972515900001 | - |
dc.identifier.scopusid | 2-s2.0-85149709533 | - |
dc.citation.title | Pattern Recognition | - |
dc.citation.volume | 139 | - |
dc.type.docType | Article | - |
dc.publisher.location | 영국 | - |
dc.subject.keywordAuthor | Discrete Ricci curvature | - |
dc.subject.keywordAuthor | Subgraph sampling method | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang University All Rights Reserved.
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.