Grad-Align: Gradual Network Alignment via Graph Neural Networks (Student Abstract)
- Authors
- Park, Jinduk; Tran, Cong; Shin, Won-Yong; Cao, Xin
- Issue Date
- Jun-2022
- Citation
- Proceedings of the AAAI Conference on Artificial Intelligence, v.36, no.11, pp 13027 - 13028
- Pages
- 2
- Journal Title
- Proceedings of the AAAI Conference on Artificial Intelligence
- Volume
- 36
- Number
- 11
- Start Page
- 13027
- End Page
- 13028
- URI
- https://yscholarhub.yonsei.ac.kr/handle/2021.sw.yonsei/6768
- DOI
- 10.1609/aaai.v36i11.21650
- ISSN
- 2159-5399
2374-3468
- Abstract
- <jats:p>Network alignment (NA) is the task of finding the correspondence of nodes between two networks. Since most existing NA methods have attempted to discover every node pair at once, they may fail to utilize node pairs that have strong consistency across different networks in the NA task. To tackle this challenge, we propose Grad-Align, a new NA method that gradually discovers node pairs by making full use of either node pairs exhibiting strong consistency or prior matching information. Specifically, the proposed method gradually aligns nodes based on both the similarity of embeddings generated using graph neural networks (GNNs) and the Tversky similarity, which is an asymmetric set similarity using the Tversky index applicable to networks with different scales. Experimental evaluation demonstrates that Grad-Align consistently outperforms state-of-the-art NA methods in terms of the alignment accuracy. Our source code is available at https://github.com/jindeok/Grad-Align.</jats:p>
- Files in This Item
-
- Appears in
Collections - College of Science > 이과대학 수학 > 1. Journal Articles
Items in Scholar Hub are protected by copyright, with all rights reserved, unless otherwise indicated.