.png){kind=icon}
.png){kind=icon}
Return
Semantics-preserved Graph Siamese Representation Learning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ipm.2023.103505.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Currently, the expressive power of momentum-driven graph Siamese representation learning is mainly constrained by flawed positive selection strategies and data augmentation strategies. To solve these issues, we propose a Semantics-preserved Graph Siamese Representation Learning method named SGSRL. Firstly, we propose a local structure-aware positive selection strategy to reduce the generation of false positive samples. Specifically, the local structural similarity of nodes is obtained through the comparison between corresponding sampled subgraphs, where the anchor node's subgraph is pooled to simplify the calculation. In addition, we propose a class information-aware feature augmentation method. Compared with directly modifying the inputs of the original graph, augmentation in the feature space is more controllable and intuitive. Specifically, we design an auxiliary contrastive learning task to train a class vector generator, and then overlay the class-oriented augmentation vectors generated by this generator onto the randomly augmented feature vectors. This joint feature augmentation strategy increases the variance between positive samples without changing the semanticity of nodes. To validate the superiority of our method, we conduct experiments on five real graph datasets for both node classification and node clustering tasks. The results demonstrate that our proposed SGSRL always outperforms state-of-art baselines.
Keywords:
Momentum-driven graph siamese
representation learning
Graph positive selection
Graph feature augmentation
Journal
I
IF:
6.9
Papers:
5.2K
Citations:
1.4W