Unsupervised Graph Structure Learning Based on Optimal Graph Topology Modeling and Adaptive Data Augmentation

Abstract

Graph neural networks (GNNs) are effective for structured data analysis but face reduced learning accuracy due to noisy connections and the necessity for explicit graph structures and labels. This requirement constrains their usability in diverse graph-based applications. In order to address these issues, considerable research has been directed toward graph structure learning that aims to denoise graph structures concurrently and refine GNN parameters. However, existing graph structure learning approaches encounter several challenges, including dependence on label information, underperformance of learning algorithms, insufficient data augmentation methods, and limitations in performing downstream tasks. We propose Uogtag, an unsupervised graph structure learning framework to address these challenges. Uogtag optimizes graph topology through the selection of suitable graph learners for the input data and incorporates contrastive learning with adaptive data augmentation, enhancing the learning and applicability of graph structures for downstream tasks. Comprehensive experiments on various real-world datasets demonstrate Uogtag’s efficacy in managing noisy graphs and label scarcity.

Keywords

• graph neural networks
• unsupervised learning
• graph structure learning
• contrastive learning on graphs