Research map / Graph learning / Knowledge and temporal graphs
DANS-KGC: Diffusion Based Adaptive Negative Sampling for Knowledge Graph Completion
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- S²DN: Learning to Denoise Unconvincing Knowledge for Inductive Knowledge Graph Completion (AAAI 2025 · similarity 0.89)
- KGDM: A Diffusion Model to Capture Multiple Relation Semantics for Knowledge Graph Embedding (AAAI 2024 · similarity 0.87)
- Towards Global-Topology Relation Graph for Inductive Knowledge Graph Completion (AAAI 2025 · similarity 0.87)
- KGCRR: An Effective Metric-Driven Knowledge Graph Completion Framework by Designing a Novel Upper Bound Function with Adaptive Approximation to Reciprocal Rank (AAAI 2025 · similarity 0.87)
- Toward a Unified Statistical Theory of Unsupervised Pretraining and Supervised Neural Knowledge Graph Learning (NeurIPS 2026 · similarity 0.86)
- APKGC: Noise-enhanced Multi-Modal Knowledge Graph Completion with Attention Penalty (AAAI 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.