HyperMagNet: A Magnetic Laplacian based Hypergraph Neural Network
원문 초록
In data science, hypergraphs are natural models for data exhibiting multi-way relations, whereas graphs only capture pairwise. Nonetheless, many proposed hypergraph neural networks effectively reduce hypergraphs to undirected graphs via symmetrized matrix representations, potentially losing important information. We propose an alternative approach to hypergraph neural networks in which the hypergraph is represented as a non-reversible Markov chain. We use this Markov chain to construct a complex Hermitian Laplacian matrix - the magnetic Laplacian - which serves as the input to our proposed hypergraph neural network. We study HyperMagNet for the task of node classification, and demonstrate its effectiveness over graph-reduction based hypergraph neural networks.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.