Signed Directed Graph Contrastive Learning with Laplacian Augmentation
Graph contrastive learning has become a powerful technique for several graph mining tasks. It learns discriminative representation from different perspectives of augmented graphs. Ubiquitous in our daily life, singed-directed graphs are the most complex and tricky to analyze among various graph types. That is why singed-directed graph contrastive learning has not been studied much yet, while there are many contrastive studies for unsigned and undirected. Thus, this paper proposes a novel signed-directed graph contrastive learning, SDGCL. It makes two different structurally perturbed graph views and gets node representations via magnetic Laplacian perturbation. We use a node-level contrastive loss to maximize the mutual information between the two graph views. The model is jointly learned with contrastive and supervised objectives. The graph encoder of SDGCL does not depend on social theories or predefined assumptions. Therefore it does not require finding triads or selecting neighbors to aggregate. It leverages only the edge signs and directions via magnetic Laplacian. To the best of our knowledge, it is the first to introduce magnetic Laplacian perturbation and signed spectral graph contrastive learning. The superiority of the proposed model is demonstrated through exhaustive experiments on four real-world datasets. SDGCL shows better performance than other state-of-the-art on four evaluation metrics.
Code (0)
등록된 구현이 없습니다.
Tasks
Contrastive LearningGraph MiningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Directed Graph Contrastive Learning
Graph Contrastive Learning (GCL) has emerged to learn generalizable representations from contrastive views. However, it is still in its infancy with two concerns: 1) changing the graph structure through data augmentation…
Contrastive LearningData AugmentationNonlinear Laplacians Improve Signed-Directed Graph Learning
While signed-directed graphs have been studied using linear Laplacians in the design of graph neural networks, relatively little research has focused on developing non-linear Laplacian operators for such networks. We int…
Node ClassificationLink PredictionGraph LearningMSGNN: A Spectral Graph Neural Network Based on a Novel Magnetic Signed Laplacian
Signed and directed networks are ubiquitous in real-world applications. However, there has been relatively little work proposing spectral graph neural networks (GNNs) for such networks. Here we introduce a signed directe…
Graph Neural NetworkLink PredictionNode ClusteringStochastic Block Model+2Consistency of augmentation graph and network approximability in contrastive learning
Contrastive learning leverages data augmentation to develop feature representation without relying on large labeled datasets. However, despite its empirical success, the theoretical foundations of contrastive learning re…
Contrastive LearningData AugmentationToward General Digraph Contrastive Learning: A Dual Spatial Perspective
Graph Contrastive Learning (GCL) has emerged as a powerful tool for extracting consistent representations from graphs, independent of labeled information. However, existing methods predominantly focus on undirected graph…
Contrastive LearningNode ClassificationLink Prediction