Unsupervised Graph
Unsupervised graph representation learning aims to extract meaningful information from graph-structured data without relying on labeled examples, focusing on learning effective node and graph embeddings for various downstream tasks. Current research emphasizes robust methods that address challenges like noisy features, heterophily (dissimilar nodes connected by edges), and domain adaptation across different graphs, often employing graph neural networks (GNNs) and contrastive learning techniques. These advancements are significant because they enable the analysis of large, unlabeled graph datasets in diverse fields, including social networks, biological systems, and material science, leading to improved model performance and interpretability in applications where labeled data is scarce or expensive to obtain.
Papers
CGCL: Collaborative Graph Contrastive Learning without Handcrafted Graph Data Augmentations
Tianyu Zhang, Yuxiang Ren, Wenzheng Feng, Weitao Du, Xuecang Zhang
Augmentations in Graph Contrastive Learning: Current Methodological Flaws & Towards Better Practices
Puja Trivedi, Ekdeep Singh Lubana, Yujun Yan, Yaoqing Yang, Danai Koutra