Graph Convolutional Smoothing Networks for Hierarchical Graphs
- 주제(키워드) Semi-supervised learning , Hierarchical Graphs
- 주제(DDC) 006.31
- 발행기관 아주대학교 일반대학원
- 지도교수 신현정
- 발행년도 2024
- 학위수여년월 2024. 8
- 학위명 석사
- 학과 및 전공 일반대학원 인공지능학과
- 실제URI http://www.dcollection.net/handler/ajou/000000034051
- 본문언어 영어
- 저작권 아주대학교 논문은 저작권에 의해 보호받습니다.
초록/요약
A hierarchically structured graph comprises multiple layers of interconnected graph. Hierarchical graphs are essential for understanding the structure and dynamics of complex systems across various fields such as sociology, biology, and economics. For instance, the omics graph layered by genome, proteome, disease, the financial graph layered by individual stocks, financial derivatives, global economical indicators, and the genealogy graph stratified by ancestor-descendant relationships. Common methods like Graph Convolutional Network and Graph-based Semi- Supervised Learning (GSSL) face significant limitations when applied to hierarchical graphs. GCN fail to capture hierarchical structures and are restricted in their neighbor range, while GSSL methods do not directly incorporate node attribute information despite their ability to reflect hierarchical structures through matrix separation. To address these challenges, we propose Graph Convolutional Smoothing Networks (GCSN). GCSN integrates both structural and attribute information by employing a Smoothness Factor Matrix, which allows for the adjustment of the neighborhood range of nodes in each layer. This Smoothness Factor Matrix is designed to be learnable, enabling the optimal neighborhood range for each layer to be determined during the training process. Experiments show that the proposed method outperforms the comparison methods by taking advantage of its applicability to hierarchical graphs and its flexibility of convolutional propagation using smoothing for feature propagation.
more목차
1. Introduction 1
2. Fundamentals 4
2.1 Representation of Hierarchical Graphs 6
2.2 Graph Convolutional Neural Networks 7
2.3 Graph-based Semi-supervised Learning 8
3. Proposed Method 10
3.1 Graph Convolutional Smoothing Networks 11
3.2 Graph Convolutional Smoothing Networks for Hierarchical Graphs 16
4. Experiments 20
4.1 Datasets 21
4.2 Performance Comparison for Plain Graph 25
4.3 Influence of Smoothness Parameter 33
4.4 Performance Comparison for Hierarchical Graphs 35
4.5 Influence of Intra, Inter Smoothness Parameter 39
5. Conclusion 41
References 43
