MixKG: Mixing for harder negative samples in knowledge graph
Knowledge graph embedding~(KGE) aims to represent entities and relations into low-dimensional vectors for many real-world applications. The representations of entities and relations are learned via contrasting the positive and negative triplets. Thus, high-quality negative samples are extremely important in KGE. However, the present KGE models either rely on simple negative sampling methods, which makes it difficult to obtain informative negative triplets; or employ complex adversarial methods, which requires more training data and strategies. In addition, these methods can only construct negative triplets using the existing entities, which limits the potential to explore harder negative triplets. To address these issues, we adopt mixing operation in generating harder negative samples for knowledge graphs and introduce an inexpensive but effective method called MixKG. Technically, MixKG first proposes two kinds of criteria to filter hard negative triplets among the sampled negatives: based on scoring function and based on correct entity similarity. Then, MixKG synthesizes harder negative samples via the convex combinations of the paired selected hard negatives. Experiments on two public datasets and four classical KGE methods show MixKG is superior to previous negative sampling algorithms.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsSimilar Papers 제목 키워드 기반
Synthetic Hard Negative Samples for Contrastive Learning
Contrastive learning has emerged as an essential approach for self-supervised learning in visual representation learning. The central objective of contrastive learning is to maximize the similarities between two augmente…
Contrastive LearningRepresentation LearningSelf-Supervised LearningDropMix: Better Graph Contrastive Learning with Harder Negative Samples
While generating better negative samples for contrastive learning has been widely studied in the areas of CV and NLP, very few work has focused on graph-structured data. Recently, Mixup has been introduced to synthesize …
Contrastive LearningHard Negative Mixing for Contrastive Learning
Contrastive learning has become a key component of self-supervised learning approaches for computer vision. By learning to embed two augmented versions of the same image close to each other and to push the embeddings of …
Contrastive LearningData AugmentationInstance Segmentationobject-detection+3Improving Zero-Shot Cross-Lingual Transfer via Progressive Code-Switching
Code-switching is a data augmentation scheme mixing words from multiple languages into source lingual text. It has achieved considerable generalization performance of cross-lingual transfer tasks by aligning cross-lingua…
Cross-Lingual TransferData AugmentationModel OptimizationSentence+1ANOMIX: A Simple yet Effective Hard Negative Generation via Mixing for Graph Anomaly Detection
Graph contrastive learning (GCL) generally requires a large number of samples. The one of the effective ways to reduce the number of samples is using hard negatives (e.g., Mixup). Designing mixing-based approach for GAD …
Anomaly DetectionContrastive LearningGraph Anomaly Detection