GTAP (Graph Topology-Aware Pre-training), a self-supervised initialization framework for within-dataset graph classification, improves over a matched GCN trained from scratch and achieves competitive accuracy against published baselines on most datasets with available results.
Abstract
Graph Convolutional Networks (GCNs) are widely used for graph-structured data, but graph pre-training still lacks simple structural objectives that can be applied when semantic annotations are unavailable. This paper proposes GTAP (Graph Topology-Aware Pre-training), a self-supervised initialization framework for within-dataset graph classification. GTAP constructs derived high-order neighborhood graphs from powers of the adjacency matrix and groups them by parity, using odd-order derived neighborhood graphs as the positive class and even-order derived neighborhood graphs as the negative class. The objective trains a lightweight GCN encoder to distinguish multi-order structural views before supervised downstream training. GTAP pre-training uses only unlabeled graph structure and node features from the benchmark dataset. The downstream classifier is then evaluated with fixed 10-fold cross-validation, with label supervision restricted to the training split of each fold. Experiments on seven public graph classification benchmarks show that GTAP improves over a matched GCN trained from scratch and achieves competitive accuracy against published baselines on most datasets with available results. The results support parity-based multi-order structural pre-training as a within-dataset unlabeled signal, while fully inductive pre-training and cross-dataset transfer remain important future work.
A Hypergraph-enhanced graph contrastive learning framework for Graph Out-Of-Distribution detection (termed HGOOD), which constructs two branches to hierarchically mine graph compact semantics in a comprehensive manner and introduces a cross-branch prototype contrast that aligns the captured graph patterns with their cr...
Xuan-Ting Fan, Chen-Yu Wang, Yue-Yue Gao et al.· Proceedings of the Thirty-Fi...· 0 citations
Similarity-guided Structural Matching Learning for Graph Dataset Condensation (SSGDC) is proposed, which efficiently reduces repository size while maintaining both task performance and structural information.
Yi-Yang Zhang, Yutong Ye, Ying-Bo Zhou et al.· Proceedings of the Thirty-Fi...· 0 citations
Can a pretrained graph model replace training and tuning a separate predictor for each dataset? Answering this requires evaluating prediction quality alongside computational cost. We present NodeGround, a node classification benchmark that puts graph foundation models (GFMs) and dataset-specific supervised learning und...
Jin-Mo Lee, Dooho Lee, Minho Jeong et al.· 0 citations
Experiments show that incorporating NC-LID-based regularization consistently improves reconstruction performance over the baseline without structural regularization and the method using hub-aware regularization, which highlights NC-LID as a useful structural signal for enhancing distance-based graph autoencoders in dyn...
Aleksandar Tomčić, Milos Savic, Milos Radovanovic· 0 citations
Graph domain adaptation (GDA) transfers knowledge from a labeled source graph to an unlabeled target graph under shifts in both node attributes and graph structure. Existing methods primarily adapt graph representations through propagation redesign, distribution alignment, or source-to-target transition modeling, but s...
Zi-Qian Liu, Yong-Xue Xu, En-Ze Zhang et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.