Graph Contrastive Learning (GCL) is a popular self-supervised learning (SSL) technique. However, mainstream GCL methods usually favor single fine-grained random augmentation schemes, which will destroy the structural integrity of the graph, and they largely ignore the topology of the graph structure, that is, multi-gra...
Shuyin Xia, Guan Wang, Cheng Tan et al.· IEEE Transactions on Pattern...· 0 citations
A novel framework called Adaptive Granular Hypergraph Generation (MGHRL) is introduced, which generates hyperedges at multiple levels of granularity through the adaptive splitting of granular-ball, effectively capturing high-order relationships based on the graph's topological structure.
Sen Zhao, Yi-Fan Guan, Jin-Yuan Ni et al.· 0 citations
Graph pooling aims to compress the graph, including both node embeddings and their underlying topological patterns, into a more compact representation. Previous works focus primarily on the overly fine-grained representation of nodes, progressively coarsening the graph by removing nodes or merging them into clusters, t...
Sen Zhao, Gao-Jie Xu, Shuyin Xia et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.