Subgraph Adaptive Structure-Aware Graph Contrastive Learning

Zhikui Chen, Yin Peng, Shuo Yu (), Chen Cao and Feng Xia
Additional contact information
Zhikui Chen: School of Software, Dalian University of Technology, Dalian 116620, China
Yin Peng: School of Software, Dalian University of Technology, Dalian 116620, China
Shuo Yu: School of Computer Science and Technology, Dalian University of Technology, Dalian 116024, China
Chen Cao: Information Networking Institute, Carnegie Mellon University, Pittsburgh, PA 15213, USA
Feng Xia: Institute of Innovation, Science and Sustainability, Federation University Australia, Ballarat, VIC 3353, Australia

Mathematics, 2022, vol. 10, issue 17, 1-18

Abstract: 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.

Keywords: graph contrastive learning; subgraph learning; network motif; unsupervised node classification; social network (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/17/3047/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/17/3047/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:17:p:3047-:d:896524

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().