A Hypergraph Neural Network Framework for Learning Hyperedge-Dependent Node Embeddings
원문 초록
In this work, we introduce a hypergraph representation learning framework called Hypergraph Neural Networks (HNN) that jointly learns hyperedge embeddings along with a set of hyperedge-dependent embeddings for each node in the hypergraph. HNN derives multiple embeddings per node in the hypergraph where each embedding for a node is dependent on a specific hyperedge of that node. Notably, HNN is accurate, data-efficient, flexible with many interchangeable components, and useful for a wide range of hypergraph learning tasks. We evaluate the effectiveness of the HNN framework for hyperedge prediction and hypergraph node classification. We find that HNN achieves an overall mean gain of 7.72% and 11.37% across all baseline models and graphs for hyperedge prediction and hypergraph node classification, respectively.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Wasserstein Hypergraph Neural Network
Devil's Hand: Data Poisoning Attacks to Locally Private Graph Learning Protocols
iN2V: Bringing Transductive Node Embeddings to Inductive Graphs
Weak Supervision for Real World Graphs
Directed Semi-Simplicial Learning with Applications to Brain Activity Decoding
Multi-modal Siamese Network for Entity Alignment
토론
이 논문과 연결된 포럼 글이 아직 없습니다.