Embedding Method for Knowledge Graph with Densely Defined Ontology

• URL: http://arxiv.org/abs/2504.02889v1
• Date: Wed, 02 Apr 2025 14:43:47 GMT
• Title: Embedding Method for Knowledge Graph with Densely Defined Ontology
• Authors: Takanori Ugai,
• Abstract summary: This study proposes a KGE model, TransU, designed for knowledge graphs with well-defined models that incorporate relationships between properties.<n>We present experimental results using a standard dataset and a practical dataset.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Knowledge graph embedding (KGE) is a technique that enhances knowledge graphs by addressing incompleteness and improving knowledge retrieval. A limitation of the existing KGE models is their underutilization of ontologies, specifically the relationships between properties. This study proposes a KGE model, TransU, designed for knowledge graphs with well-defined ontologies that incorporate relationships between properties. The model treats properties as a subset of entities, enabling a unified representation. We present experimental results using a standard dataset and a practical dataset.

Related papers

• A Graph Perspective to Probe Structural Patterns of Knowledge in Large Language Models [52.52824699861226]
  Large language models have been extensively studied as neural knowledge bases for their knowledge access, editability, reasoning, and explainability.<n>We quantify the knowledge of LLMs at both the triplet and entity levels, and analyze how it relates to graph structural properties such as node degree.
  arXiv  Detail & Related papers  (2025-05-25T19:34:15Z)
• ReaLitE: Enrichment of Relation Embeddings in Knowledge Graphs using Numeric Literals [6.014443576489523]
  Most knowledge graph embedding (KGE) methods tailored for link prediction focus on the entities and relations in the graph.<n>We propose ReaLitE, a novel relation-centric KGE model that dynamically aggregates and merges entities' numerical attributes with the embeddings of the connecting relations.
  arXiv  Detail & Related papers  (2025-04-01T14:38:22Z)
• 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)
• DGNN: Decoupled Graph Neural Networks with Structural Consistency between Attribute and Graph Embedding Representations [62.04558318166396]
  Graph neural networks (GNNs) demonstrate a robust capability for representation learning on graphs with complex structures. A novel GNNs framework, dubbed Decoupled Graph Neural Networks (DGNN), is introduced to obtain a more comprehensive embedding representation of nodes. Experimental results conducted on several graph benchmark datasets verify DGNN's superiority in node classification task.
  arXiv  Detail & Related papers  (2024-01-28T06:43:13Z)
• Graph Relation Distillation for Efficient Biomedical Instance Segmentation [80.51124447333493]
  We propose a graph relation distillation approach for efficient biomedical instance segmentation. We introduce two graph distillation schemes deployed at both the intra-image level and the inter-image level. Experimental results on a number of biomedical datasets validate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2024-01-12T04:41:23Z)
• A Comprehensive Study on Knowledge Graph Embedding over Relational Patterns Based on Rule Learning [49.09125100268454]
  Knowledge Graph Embedding (KGE) has proven to be an effective approach to solving the Knowledge Completion Graph (KGC) task. Relational patterns are an important factor in the performance of KGE models. We introduce a training-free method to enhance KGE models' performance over various relational patterns.
  arXiv  Detail & Related papers  (2023-08-15T17:30:57Z)
• Knowledge Graph Contrastive Learning Based on Relation-Symmetrical Structure [36.507635518425744]
  We propose a knowledge graph contrastive learning framework based on relation-symmetrical structure, KGE-SymCL. Our framework mines symmetrical structure information in KGs to enhance the discriminative ability of KGE models.
  arXiv  Detail & Related papers  (2022-11-19T16:30:29Z)
• KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction [0.0]
  We introduce a new entity/relation embedding layer that learns to differentiate distinctive entity and relation types. We show that further pre-training the language models with this additional embedding layer using the triples extracted from the knowledge graph, followed by the standard fine-tuning phase sets a new state-of-the-art performance for the link prediction task on the benchmark datasets.
  arXiv  Detail & Related papers  (2022-11-04T20:38:12Z)
• A Representation Learning Framework for Property Graphs [33.04077644004356]
  We propose PGE, a graph representation learning framework that incorporates both node and edge properties into the graph embedding procedure. We show how PGE achieves better embedding results than the state-of-the-art graph embedding methods on benchmark applications such as node classification and link prediction over real-world datasets.
  arXiv  Detail & Related papers  (2022-06-27T10:36:57Z)
• Jointly Learning Knowledge Embedding and Neighborhood Consensus with Relational Knowledge Distillation for Entity Alignment [9.701081498310165]
  Entity alignment aims at integrating heterogeneous knowledge from different knowledge graphs. Recent studies employ embedding-based methods by first learning representation of Knowledge Graphs and then performing entity alignment. We propose a Graph Convolutional Network (GCN) model equipped with knowledge distillation for entity alignment.
  arXiv  Detail & Related papers  (2022-01-25T02:47:14Z)
• RelWalk A Latent Variable Model Approach to Knowledge Graph Embedding [50.010601631982425]
  This paper extends the random walk model (Arora et al., 2016a) of word embeddings to Knowledge Graph Embeddings (KGEs) We derive a scoring function that evaluates the strength of a relation R between two entities h (head) and t (tail) We propose a learning objective motivated by the theoretical analysis to learn KGEs from a given knowledge graph.
  arXiv  Detail & Related papers  (2021-01-25T13:31:29Z)
• Tensor Graph Convolutional Networks for Multi-relational and Robust Learning [74.05478502080658]
  This paper introduces a tensor-graph convolutional network (TGCN) for scalable semi-supervised learning (SSL) from data associated with a collection of graphs, that are represented by a tensor. The proposed architecture achieves markedly improved performance relative to standard GCNs, copes with state-of-the-art adversarial attacks, and leads to remarkable SSL performance over protein-to-protein interaction networks.
  arXiv  Detail & Related papers  (2020-03-15T02:33:21Z)
• Relational Message Passing for Knowledge Graph Completion [78.47976646383222]
  We propose a relational message passing method for knowledge graph completion. It passes relational messages among edges iteratively to aggregate neighborhood information. Results show our method outperforms stateof-the-art knowledge completion methods by a large margin.
  arXiv  Detail & Related papers  (2020-02-17T03:33:41Z)

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.