Beyond Triplet Plausibility: Relation Set Completion in Knowledge Graphs
arXiv:2606. 29860v1 Announce Type: new Abstract: Knowledge graphs (KGs) organize real-world knowledge as triplets and underpin many downstream applications.
arXiv:2609. 03487v1 Announce Type: cross Abstract: Knowledge graph embedding (KGE) demonstrates its effectiveness for predicting missing links in knowledge graphs (KGs) by projecting entities and relations into a low-dimensional vector space.
arXiv:2606. 29860v1 Announce Type: new Abstract: Knowledge graphs (KGs) organize real-world knowledge as triplets and underpin many downstream applications.
arXiv:2606. 16509v1 Announce Type: new Abstract: Link prediction in knowledge graphs fundamentally depends on the quality of learned embeddings for entities and relations.
Knowledge graphs (KGs) organize real-world knowledge as triplets and underpin many downstream applications. Due to their inherent incompleteness, knowledge graph completion (KGC) is widely studied and is typically formulated as triplet prediction, with link prediction as the dominant paradigm.
arXiv:2505.23442v2 Announce Type: replace Abstract: Knowledge graphs (KGs) provide structured representations of entities and relations, and underpin data management and Web applications such as sear...
arXiv:2606. 27967v1 Announce Type: new Abstract: Real-world knowledge graphs are often incomplete, lacking many valid facts.
arXiv:2606. 03365v1 Announce Type: new Abstract: Embedding models (KGEMs) constitute the main link prediction approach to complete knowledge graphs.
arXiv:2506.05626v3 Announce Type: replace Abstract: Real-world knowledge can take various forms, including structured, semi-structured, and unstructured data. Among these, Knowledge Graphs (KGs) are...
arXiv:2510. 09711v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) have recently emerged as a powerful paradigm for Knowledge Graph Completion (KGC), offering strong reasoning and generalization capabilities beyond traditional embedding-based approaches.
The paper introduces ImbalancE, an inference‑time latent search method that mitigates degree imbalance bias in Knowledge Graph Embedding models. It targets the problematic prediction of target entities with much lower degrees than anchor entities, a common issue in recommender systems and other applications. Experiments on benchmark datasets show that ImbalancE improves predictions on the most imbalanced triples compared to conventional methods.
The paper introduces LitEm, a neural regression model that allows transductive knowledge graph embedding models to predict numerical attributes. LitEm achieves top or near‑top performance on most attributes across datasets such as FB15K‑237, YAGO15K, DB15K, and Mutagenesis. A co‑training framework further improves link prediction for bilinear models while enabling them to predict numerical attributes, demonstrating literal‑aware encoding of attribute information.
arXiv:2608.30652v1 Announce Type: new Abstract: Embedding methods have become popular due to their scalability on link prediction and/or triple classification tasks on Knowledge Graphs (KGs). Embeddi...
arXiv:2606. 29180v1 Announce Type: new Abstract: A Knowledge Graph (KG) represents facts as structured triples and is widely used to organize relational knowledge across diverse domains.