This paper first analyzes how duplicated and fictional edges arise from powers of the adjacency matrix, and then designs a graph pure high-order projection (GPHP) algorithm that eliminates both types of invalid edges.
Abstract
Graph convolutional networks (GCNs) have achieved remarkable success in graph representation learning, yet they remain limited by over-smoothing and insufficient utilization of high-order topology. Existing high-order GCNs exploit multi-hop neighbors but ignore the purity of high-order neighborhoods: the high-order graphs they construct contain duplicated and fictional edges, which cause feature redundancy and false topological semantics. In this paper, we propose a pure high-order graph convolutional network (PHGCN) grounded in pure high-order neighborhoods. We first analyze how duplicated and fictional edges arise from powers of the adjacency matrix, and then design a graph pure high-order projection (GPHP) algorithm that eliminates both types of invalid edges. On this basis, we construct a multi-path GCN architecture with an attention-based fusion module to learn and combine features from pure high-order neighborhoods of different orders. Experiments on seven graph classification benchmarks (IMDB-B, IMDB-M, MUTAG, PROTEINS, NCI1, DD, and COLLAB) show that PHGCN achieves the best average ranking among the compared models, and ablation studies show that each component contributes to the final performance.
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
This work derives a theoretical characterization of the expressivity of higher-order positional encodings, proving that node-level operators induced by higher-order lifts can mix graph Laplacian frequencies in ways that scalar graph spectral filters cannot.
C. Stam, Aagrim Hoysal, Sanjukta Krishnagopal· 0 citations
A novel broad graph convolutional network (BGCN) paradigm is proposed, which completely eliminates hidden layers and instead expands the receptive field through network width, effectively circumventing the inherent limitations of over-smoothing and overfitting in existing deep and high-order GCN models.
Alex Hay-Man Ng, Xun Liu, Fang-Yuan Lei et al.· Complex & Intelligent Sy...· 0 citations
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.
This work proposes a novel Adaptive Dual-level Collaborative GNN associated with an adaptive dual-level collaborative mechanism, and shows that the ADC-GNN can inject the learned high-level information back into the node level, forming a closed-loop, bidirectional optimization process.
Wan Tang, Lu Bai, Li-Xin Cui et al.· Proceedings of the Thirty-Fi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.