Loading...
Please wait, while we are loading the content...
Similar Documents
Subgraph Adaptive Structure-Aware Graph Contrastive Learning
| Content Provider | MDPI |
|---|---|
| Author | Chen, Zhikui Peng, Yin Yu, Shuo Cao, Chen Xia, Feng |
| Copyright Year | 2022 |
| Description | Graph contrastive learning (GCL) has been subject to more attention and been widely applied to numerous graph learning tasks such as node classification and link prediction. Although it has achieved great success and even performed better than supervised methods in some tasks, most of them depend on node-level comparison, while ignoring the rich semantic information contained in graph topology, especially for social networks. However, a higher-level comparison requires subgraph construction and encoding, which remain unsolved. To address this problem, we propose a subgraph adaptive structure-aware graph contrastive learning method (PASCAL) in this work, which is a subgraph-level GCL method. In PASCAL, we construct subgraphs by merging all motifs that contain the target node. Then we encode them on the basis of motif number distribution to capture the rich information hidden in subgraphs. By incorporating motif information, PASCAL can capture richer semantic information hidden in local structures compared with other GCL methods. Extensive experiments on six benchmark datasets show that PASCAL outperforms state-of-art graph contrastive learning and supervised methods in most cases. |
| Starting Page | 3047 |
| e-ISSN | 22277390 |
| DOI | 10.3390/math10173047 |
| Journal | Mathematics |
| Issue Number | 17 |
| Volume Number | 10 |
| Language | English |
| Publisher | MDPI |
| Publisher Date | 2022-08-24 |
| Access Restriction | Open |
| Subject Keyword | Mathematics Artificial Intelligence Graph Contrastive Learning Subgraph Learning Network Motif Unsupervised Node Classification Social Network |
| Content Type | Text |
| Resource Type | Article |
