https://github.com/zknus/hamiltonian-gnn
공식 코드Node Embedding from Neural Hamiltonian Orbits in Graph Neural Networks
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
Link Prediction is a task in graph and network analysis where the goal is to predict missing or future connections between nodes in a network. Given a partially observed network, the goal of link prediction is to infer which links are most likely to be added or missing based on the observed connections and the structure of the network.
<span style="color:grey; opacity: 0.6">( Image credit: Inductive Representation Learning on Large Graphs )</span>
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
Node Embedding from Neural Hamiltonian Orbits in Graph Neural Networks
AutoGEL: An Automated Graph Neural Network with Explicit Link Information
NAFS: A Simple yet Tough-to-beat Baseline for Graph Representation Learning
Understanding Negative Sampling in Graph Representation Learning
FILDNE: A Framework for Incremental Learning of Dynamic Networks Embeddings
Graph Embedding on Biomedical Networks: Methods, Applications, and Evaluations
Hierarchical Graph Representation Learning with Differentiable Pooling
Embedding Entities and Relations for Learning and Inference in Knowledge Bases
GNNExplainer: Generating Explanations for Graph Neural Networks
GNNExplainer: Generating Explanations for Graph Neural Networks
Multiple Run Ensemble Learning with Low-Dimensional Knowledge Graph Embeddings
GRAPE for Fast and Scalable Graph Processing and random walk-based Embedding
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.