https://github.com/DeMix2023/Demix
공식 코드Negative Sampling with Adaptive Denoising Mixup for Knowledge Graph Embedding
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
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>
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
Negative Sampling with Adaptive Denoising Mixup for Knowledge Graph Embedding
RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space
Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction
Node Embedding with Adaptive Similarities for Scalable Learning over Graphs
CSGDN: Contrastive Signed Graph Diffusion Network for Predicting Crop Gene-phenotype Associations
Discovering emergent connections in quantum physics research via dynamic word embeddings
A Hidden Challenge of Link Prediction: Which Pairs to Check?
EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs
EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs
Dynamic Graph Convolutional Networks Using the Tensor M-Product
Knowledge Generation -- Variational Bayes on Knowledge Graphs
Temporal Attribute Prediction via Joint Modeling of Multi-Relational Structure Evolution
Recurrent Event Network: Autoregressive Structure Inference over Temporal Knowledge Graphs
End-to-end Structure-Aware Convolutional Networks for Knowledge Base Completion
Adaptive Attentional Network for Few-Shot Knowledge Graph Completion
Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Prediction
On Generalization of Graph Autoencoders with Adversarial Training
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.