Numerical Literals in Link Prediction: A Critical Examination of Models and Datasets
Link Prediction(LP) is an essential task over Knowledge Graphs(KGs), traditionally focussed on using and predicting the relations between entities. Textual entity descriptions have already been shown to be valuable, but models that incorporate numerical literals have shown minor improvements on existing benchmark datasets. It is unclear whether a model is actually better in using numerical literals, or better capable of utilizing the graph structure. This raises doubts about the effectiveness of these methods and about the suitability of the existing benchmark datasets. We propose a methodology to evaluate LP models that incorporate numerical literals. We propose i) a new synthetic dataset to better understand how well these models use numerical literals and ii) dataset ablations strategies to investigate potential difficulties with the existing datasets. We identify a prevalent trend: many models underutilize literal information and potentially rely on additional parameters for performance gains. Our investigation highlights the need for more extensive evaluations when releasing new models and datasets.
Code (1)
Tasks
Knowledge GraphsLink PredictionSimilar Papers 제목 키워드 기반
A Survey on Knowledge Graph Embeddings with Literals: Which model links better Literal-ly?
Knowledge Graphs (KGs) are composed of structured information about a particular domain in the form of entities and relations. In addition to the structured information KGs help in facilitating interconnectivity and inte…
Entity LinkingKnowledge Graph EmbeddingsKnowledge GraphsLink Prediction+2Inference over Unseen Entities, Relations and Literals on Knowledge Graphs
In recent years, knowledge graph embedding models have been successfully applied in the transductive setting to tackle various challenging tasks including link prediction, and query answering. Yet, the transductive setti…
Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsLink PredictionIncorporating Literals into Knowledge Graph Embeddings
Knowledge graphs, on top of entities and their relationships, contain other important elements: literals. Literals encode interesting properties (e.g. the height) of entities that are not captured by links between entiti…
Entity EmbeddingsKnowledge Graph EmbeddingsKnowledge GraphsLink PredictionLearning Chain Of Thoughts Prompts for Predicting Entities, Relations, and even Literals on Knowledge Graphs
Knowledge graph embedding (KGE) models perform well on link prediction but struggle with unseen entities, relations, and especially literals, limiting their use in dynamic, heterogeneous graphs. In contrast, pretrained l…
Knowledge Graph EmbeddingKnowledge GraphsLink PredictionDifferentiable Rule Induction with Learned Relational Features
Rule-based decision models are attractive due to their interpretability. However, existing rule induction methods often result in long and consequently less interpretable rule models. This problem can often be attributed…