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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
SMART: Relation-Aware Learning of Geometric Representations for Knowledge Graphs
Injecting Knowledge Graphs into Large Language Models
Embedding-Based Entity Alignment Using Relation Structural Similarity
Jointly Non-Sampling Learning for Knowledge Graph Enhanced Recommendation
Knowledge Graph Embedding via Graph Attenuated Attention Networks
Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.