Cited 0 time in
Disentangling, Amplifying, and Debiasing: Learning Disentangled Representations for Fair Graph Neural Networks
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lee, Yeon-Chang | - |
| dc.contributor.author | Shin, Hojung | - |
| dc.contributor.author | Kim, Sang-Wook | - |
| dc.date.accessioned | 2025-05-23T02:30:21Z | - |
| dc.date.available | 2025-05-23T02:30:21Z | - |
| dc.date.issued | 2025-04 | - |
| dc.identifier.issn | 2159-5399 | - |
| dc.identifier.issn | 2374-3468 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/207412 | - |
| dc.description.abstract | Graph Neural Networks (GNNs) have become essential tools for graph representation learning in various domains, such as social media and healthcare. However, they often suffer from fairness issues due to inherent biases in node attributes and graph structure, leading to unfair predictions. To address these challenges, we propose a novel GNN framework, DAB-GNN, that Disentangles, Amplifies, and deBiases attribute, structure, and potential biases in the GNN mechanism. DAB-GNN employs a disentanglement and amplification module that isolates and amplifies each type of bias through specialized disentanglers, followed by a debiasing module that minimizes the distance between subgroup distributions. Extensive experiments on five datasets demonstrate that DAB-GNN significantly outperforms ten state-of-the-art competitors in terms of achieving an optimal balance between accuracy and fairness. | - |
| dc.format.extent | 9 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | Association for the Advancement of Artificial Intelligence | - |
| dc.title | Disentangling, Amplifying, and Debiasing: Learning Disentangled Representations for Fair Graph Neural Networks | - |
| dc.type | Article | - |
| dc.publisher.location | 영국 | - |
| dc.identifier.doi | 10.1609/aaai.v39i11.33308 | - |
| dc.identifier.scopusid | 2-s2.0-105003911784 | - |
| dc.identifier.bibliographicCitation | Proceedings of the AAAI Conference on Artificial Intelligence, v.39, no.11, pp 12013 - 12021 | - |
| dc.citation.title | Proceedings of the AAAI Conference on Artificial Intelligence | - |
| dc.citation.volume | 39 | - |
| dc.citation.number | 11 | - |
| dc.citation.startPage | 12013 | - |
| dc.citation.endPage | 12021 | - |
| dc.type.docType | Conference paper | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.subject.keywordPlus | Network theory (graphs) | - |
| dc.identifier.url | https://ojs.aaai.org/index.php/AAAI/article/view/33308 | - |
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-1366
COPYRIGHT © 2024 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.
