Sep 2026· IEEE Transactions on Pattern Analysis and Machine Intelligence· Vol PP· 0 citations
Medicine
TL;DR
A subgraph-aware semantic expansion module that coordinates $k$-hop neighborhood information with LLM-generated descriptions to alleviate structural sparsity and a contrastive ontology matching mechanism resolves structural inconsistencies by computing adaptive similarity metrics between ontology embeddings and subgraph-derived semantic prototypes.
Abstract
Ontology-based Knowledge Graphs (KGs) augment entity representation through additional semantic information, facilitating link prediction for unseen entities through predefined ontology libraries. While most existing knowledge graph representation learning methods predominantly focus on co-optimizing both entities and ontologies to leverage ontological contexts, the structural-semantic discrepancies in ontology-based KGs have been largely overlooked. Through graph structure analysis, we identify two fundamental limitations: (1) structural incompatibility between entity subgraph semantics and multi-ontology mappings (1-N redundancy), and (2) missing explicit ontology link in subgraph contexts (1-0 absence). To resolve these issues, we propose a structural empowered module built upon link prediction backbones. First, we develop a subgraph-aware semantic expansion module that coordinates $k$-hop neighborhood information with LLM-generated descriptions to alleviate structural sparsity. Subsequently, a contrastive ontology matching mechanism resolves structural inconsistencies by computing adaptive similarity metrics between ontology embeddings and subgraph-derived semantic prototypes. Experimental results demonstrate that our model outperforms fourteen state-of-the-art models, maintaining robust performance across varying benchmarks and subgraph density conditions.
Constructing typed, justified semantic links between ontologies is essential for enabling interoperability across heterogeneous and interdisciplinary knowledge domains. However, manually curating such links is difficult to scale. To address this challenge, we propose an end-to-end framework for ontology network constru...
This investigation proposes the NORKE framework, a structure-aware solution for constructing KGs from normative documents that leverages the inherent normative hierarchy, to extract and formalize rules as semantically cohesive RDF triples.
E. D. de Souza, A. Gomes, J. D. dos Reis et al.· 0 citations
Ontology-driven knowledge graph construction from industrial text remains challenging due to the domain specificity of documents, the scarcity of annotated resources, and the complexity of ontology engineering workflows. This paper presents and investigates the applicability of an ontology learning pipeline that combin...
Abdelhadi Belfadel, Maxence Gagnant, Joseph Kattan et al.· 0 citations
PEARL is proposed, a Path-Entity Aligned Relational Learning framework that models paths as context-conditioned reasoning signals and employs a dual-view contrastive objective that promotes representation consistency under stochastic contextual perturbations.
This paper combines graph neural network encoders with box-embedding-based semantic losses that encourage learned representations to better satisfy ontology-derived class hierarchies, and compares this approach to both standard link prediction models and models incorporating subclass relations as graph edges.
Ontologies support shared meaning across Semantic Web applications, but selecting an appropriate ontology for reuse remains difficult because existing candidates often differ in documentation quality, semantic clarity, structural connectivity, and logical soundness. Reuse decisions are therefore frequently based on fam...
A. Dalal, Mariam Baloch, A. Lin et al.· International Journal of Sem...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.