SubGEC adds a KL-regularized Gaussian embedding to subgraph contrastive learning with Wasserstein and Gromov-Wasserstein distances, improving node classification on several heterophilic graphs.
In: International Conference on Machine Learning (2020)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Subgraph Gaussian Embedding Contrast for Self-Supervised Graph Representation Learning
SubGEC adds a KL-regularized Gaussian embedding to subgraph contrastive learning with Wasserstein and Gromov-Wasserstein distances, improving node classification on several heterophilic graphs.