Neural Regression with Embeddings for Numerical Attribute Prediction in Knowledge Graphs

• URL: http://arxiv.org/abs/2608.26729v2
• Date: Fri, 28 Aug 2026 09:03:40 GMT
• Title: Neural Regression with Embeddings for Numerical Attribute Prediction in Knowledge Graphs
• Abstract summary: We propose a neural regression model (LitEm) that enables transductive knowledge graph embedding models to predict numerical attributes within knowledge graphs.<n> Experimental results demonstrate that LitEm achieves the best or second-best results on most attributes across FB15K-237, YAGO15K, DB15K, and Mutagenesis.
• Score: 8.284558878625838
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In recent years, transductive knowledge graph embedding models have been applied to tasks such as link prediction and query answering. Although knowledge graphs often contain rich numerical attributes, most embedding models neglect them, limiting their ability to represent real-world knowledge graphs with diverse information. In this work, we propose a neural regression model (LitEm) that enables transductive knowledge graph embedding models to predict numerical attributes within knowledge graphs. Experimental results demonstrate that LitEm achieves the best or second-best results on most attributes across FB15K-237, YAGO15K, DB15K, and Mutagenesis. Furthermore, we propose a co-training framework that jointly trains state-of-the-art transductive knowledge graph embedding models with LitEm, which improves link prediction performance mainly for bilinear models and simultaneously enables them to predict numerical attributes. In addition, the literal-awareness evaluation demonstrates that co-training helps models to encode and exploit attribute information in a "literal-aware'' manner, suggesting that the observed gains are not merely due to additional parameters. We publicly release our implementation at https://github.com/dice-group/dice-embeddings.

Related papers

• Model Graph Inductive Learning for Knowledge Graph Completion [0.0]
  Link prediction in knowledge graphs depends on the quality of learned embeddings for entities and relations.<n>We introduce Model Graph Inductive Learning (bftextMGIL), a framework that constructs a model graph by clustering entities.<n>A GNN is then applied to this model graph to produce embeddings that capture the global view of the knowledge graph.
  arXiv  Detail & Related papers  (2026-06-15T10:13:27Z)
• Knowledge Graph Enhanced Generative Multi-modal Models for Class-Incremental Learning [51.0864247376786]
  We introduce a Knowledge Graph Enhanced Generative Multi-modal model (KG-GMM) that builds an evolving knowledge graph throughout the learning process.<n>During testing, we propose a Knowledge Graph Augmented Inference method that locates specific categories by analyzing relationships within the generated text.
  arXiv  Detail & Related papers  (2025-03-24T07:20:43Z)
• From Latent to Lucid: Transforming Knowledge Graph Embeddings into Interpretable Structures with KGEPrisma [4.2427000279700025]
  We introduce a post-hoc and local explainable AI method tailored for Knowledge Graph Embedding (KGE) models.<n>Our approach directly decodes the latent representations encoded by KGE models, leveraging the smoothness of the embeddings.<n>By identifying symbolic structures, in the form of triples, within the subgraph neighborhoods of similarly embedded entities, our method translates these insights into human-understandable symbolic rules and facts.
  arXiv  Detail & Related papers  (2024-06-03T19:54:11Z)
• IRT2: Inductive Linking and Ranking in Knowledge Graphs of Varying Scale [1.3621712165154805]
  We address the challenge of building domain-specific knowledge models for industrial use cases. Our focus is on inductive link prediction models as a basis for practical tools.
  arXiv  Detail & Related papers  (2023-01-02T15:19:21Z)
• Distilling Knowledge from Self-Supervised Teacher by Embedding Graph Alignment [52.704331909850026]
  We formulate a new knowledge distillation framework to transfer the knowledge from self-supervised pre-trained models to any other student network. Inspired by the spirit of instance discrimination in self-supervised learning, we model the instance-instance relations by a graph formulation in the feature embedding space. Our distillation scheme can be flexibly applied to transfer the self-supervised knowledge to enhance representation learning on various student networks.
  arXiv  Detail & Related papers  (2022-11-23T19:27:48Z)
• A Graph-Enhanced Click Model for Web Search [67.27218481132185]
  We propose a novel graph-enhanced click model (GraphCM) for web search. We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
  arXiv  Detail & Related papers  (2022-06-17T08:32:43Z)
• Learning Representations of Entities and Relations [0.0]
  This thesis focuses on improving knowledge graph representation with the aim of tackling the link prediction task. The first contribution is HypER, a convolutional model which simplifies and improves upon the link prediction performance. The second contribution is TuckER, a relatively straightforward linear model, which, at the time of its introduction, obtained state-of-the-art link prediction performance. The third contribution is MuRP, first multi-relational graph representation model embedded in hyperbolic space.
  arXiv  Detail & Related papers  (2022-01-31T09:24:43Z)
• Prediction of Adverse Biological Effects of Chemicals Using Knowledge Graph Embeddings [5.1168938454615205]
  We show that using knowledge graph embeddings can increase the accuracy of effect prediction with neural networks. We evaluate certain characteristics of the knowledge graph embedding models to shed light on the individual model performance.
  arXiv  Detail & Related papers  (2021-12-08T22:19:16Z)
• Towards Open-World Feature Extrapolation: An Inductive Graph Learning Approach [80.8446673089281]
  We propose a new learning paradigm with graph representation and learning. Our framework contains two modules: 1) a backbone network (e.g., feedforward neural nets) as a lower model takes features as input and outputs predicted labels; 2) a graph neural network as an upper model learns to extrapolate embeddings for new features via message passing over a feature-data graph built from observed data.
  arXiv  Detail & Related papers  (2021-10-09T09:02:45Z)
• Model-Agnostic Graph Regularization for Few-Shot Learning [60.64531995451357]
  We present a comprehensive study on graph embedded few-shot learning. We introduce a graph regularization approach that allows a deeper understanding of the impact of incorporating graph information between labels. Our approach improves the performance of strong base learners by up to 2% on Mini-ImageNet and 6.7% on ImageNet-FS.
  arXiv  Detail & Related papers  (2021-02-14T05:28:13Z)
• Tucker decomposition-based Temporal Knowledge Graph Completion [35.56360622521721]
  We build a new tensor decomposition model for temporal knowledge graphs completion inspired by the Tucker decomposition of order 4 tensor. We demonstrate that the proposed model is fully expressive and report state-of-the-art results for several public benchmarks.
  arXiv  Detail & Related papers  (2020-11-16T07:05:52Z)
• Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Prediction [69.1473775184952]
  We introduce a realistic problem of few-shot out-of-graph link prediction. We tackle this problem with a novel transductive meta-learning framework. We validate our model on multiple benchmark datasets for knowledge graph completion and drug-drug interaction prediction.
  arXiv  Detail & Related papers  (2020-06-11T17:42:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.