What Do Graph Convolutional Neural Networks Learn?
원문 초록
Graph neural networks (GNNs) have gained traction over the past few years for their superior performance in numerous machine learning tasks. Graph Convolutional Neural Networks (GCN) are a common variant of GNNs that are known to have high performance in semi-supervised node classification (SSNC), and work well under the assumption of homophily. Recent literature has highlighted that GCNs can achieve strong performance on heterophilous graphs under certain "special conditions". These arguments motivate us to understand why, and how, GCNs learn to perform SSNC. We find a positive correlation between similarity of latent node embeddings of nodes within a class and the performance of a GCN. Our investigation on underlying graph structures of a dataset finds that a GCN's SSNC performance is significantly influenced by the consistency and uniqueness in neighborhood structure of nodes within a class.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
GC4NC: A Benchmark Framework for Graph Condensation on Node Classification with New Insights
Demystifying Distributed Training of Graph Neural Networks for Link Prediction
Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models
Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark
Improving the Effective Receptive Field of Message-Passing Neural Networks
Scalable Graph Generative Modeling via Substructure Sequences
토론
이 논문과 연결된 포럼 글이 아직 없습니다.