Negative Sampling in Knowledge Graph Representation Learning: A Review
Knowledge Graph Representation Learning (KGRL), or Knowledge Graph Embedding (KGE), is essential for AI applications such as knowledge construction and information retrieval. These models encode entities and relations into lower-dimensional vectors, supporting tasks like link prediction and recommendation systems. Training KGE models relies on both positive and negative samples for effective learning, but generating high-quality negative samples from existing knowledge graphs is challenging. The quality of these samples significantly impacts the model's accuracy. This comprehensive survey paper systematically reviews various negative sampling (NS) methods and their contributions to the success of KGRL. Their respective advantages and disadvantages are outlined by categorizing existing NS methods into six distinct categories. Moreover, this survey identifies open research questions that serve as potential directions for future investigations. By offering a generalization and alignment of fundamental NS concepts, this survey provides valuable insights for designing effective NS methods in the context of KGRL and serves as a motivating force for further advancements in the field.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph EmbeddingGraph Representation LearningInformation RetrievalKnowledge Graph EmbeddingKnowledge GraphsLink PredictionRecommendation SystemsRepresentation LearningSurveySimilar Papers 제목 키워드 기반
Negative Sampling for Contrastive Representation Learning: A Review
The learn-to-compare paradigm of contrastive representation learning (CRL), which compares positive samples with negative ones for representation learning, has achieved great success in a wide range of domains, including…
Graph LearningInformation RetrievalRepresentation LearningRetrievalAnalysis of the Impact of Negative Sampling on Link Prediction in Knowledge Graphs
Knowledge graphs are large, useful, but incomplete knowledge repositories. They encode knowledge through entities and relations which define each other through the connective structure of the graph. This has inspired met…
Knowledge Graph EmbeddingsKnowledge GraphsLink PredictionStructure Aware Negative Sampling in Knowledge Graphs
Learning low-dimensional representations for entities and relations in knowledge graphs using contrastive estimation represents a scalable and effective method for inferring connectivity patterns. A crucial aspect of con…
Contrastive LearningKnowledge GraphsRevGNN: Negative Sampling Enhanced Contrastive Graph Learning for Academic Reviewer Recommendation
Acquiring reviewers for academic submissions is a challenging recommendation scenario. Recent graph learning-driven models have made remarkable progress in the field of recommendation, but their performance in the academ…
Contrastive LearningGraph LearningIncorporating GAN for Negative Sampling in Knowledge Representation Learning
Knowledge representation learning aims at modeling knowledge graph by encoding entities and relations into a low dimensional space. Most of the traditional works for knowledge embedding need negative sampling to minimize…
Link PredictionRepresentation Learning