Skip to content

Graph Neural Networks for Analyzing the Semantic Web – Reasoning about Linked Data

Aug 2026 · Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Neural Networks

Abstract

The Semantic Web, characterized by linked data and intricate relationships between entities, presents significant challenges for traditional database systems. Existing graph databases often struggle to effectively perform complex reasoning tasks over this data. This paper proposes a novel approach utilizing Graph Neural Networks (GNNs) to address this limitation. We leverage GNNs to learn embeddings of linked data entities and their associated relationships, transforming them into a format conducive to reasoning. These learned embeddings enable capabilities such as inference, query expansion, and knowledge graph completion. The core contribution lies in applying GNNs directly to the complexities of the Semantic Web, offering a powerful and flexible framework for reasoning over linked data. We explore the architecture of the GNN model, discuss the training process, and outline potential applications. The proposed method offers a promising direction for enhancing the intelligence and analytical capabilities of Semantic Web technologies.

View source

Similar papers

Locality-Preserving Graph Laplacian Manifold Learning Based Model Predictive Control for Three-Phase Inverters

This article presents a model predictive control (MPC) strategy for three-phase inverters based on locality preserving projections (LPPs). Unlike conventional machine learning–based MPC approaches that rely on predefined or high-dimensional input features, the proposed LPP-MPC automatically extracts compact, informative representations by preserving the data’s intrinsic geometric structure. This dimensionality reduction enables fast linear control-law evaluation with computational complexity O(1), making the controller well-suited for real-time implementation. Experimental results demonstrate that the LPP-MPC achieves lower total harmonic distortion (THD) and reduced tracking error compared to quadratic-programming MPC under both linear and nonlinear load conditions, and the proposed controller maintains consistently lower THD throughout load transients than other methods such as two-degree-of-freedom MPC. Compared to existing model-free MPC and deep learning neural network, the LPP-MPC has the lowest THD and root mean square error with the least computational time owing to its efficient linear structure and strong generalization capability.

Jianwu Zeng, Lizheng Cheng, V. Winstead et al. · 1 citation

Related blog posts