Kolmogorov-Arnold Graph Neural Networks
원문 초록
Graph neural networks (GNNs) excel in learning from network-like data but often lack interpretability, making their application challenging in domains requiring transparent decision-making. We propose the Graph Kolmogorov-Arnold Network (GKAN), a novel GNN model leveraging spline-based activation functions on edges to enhance both accuracy and interpretability. Our experiments on five benchmark datasets demonstrate that GKAN outperforms state-of-the-art GNN models in node classification, link prediction, and graph classification tasks. In addition to the improved accuracy, GKAN's design inherently provides clear insights into the model's decision-making process, eliminating the need for post-hoc explainability techniques. This paper discusses the methodology, performance, and interpretability of GKAN, highlighting its potential for applications in domains where interpretability is crucial.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Demystifying Distributed Training of Graph Neural Networks for Link Prediction
Improving the Effective Receptive Field of Message-Passing Neural Networks
Bridging Source and Target Domains via Link Prediction for Unsupervised Domain Adaptation on Graphs
Directed Homophily-Aware Graph Neural Network
Symbolic Hyperdimensional Vectors with Sparse Graph Convolutional Neural Networks
Multi-modal Siamese Network for Entity Alignment
토론
이 논문과 연결된 포럼 글이 아직 없습니다.