Cited by 94Explainable Artificial Intelligence (XAI)Semantic Web and OntologiesAdvanced Graph Neural Networks

On the Integration of Knowledge Graphs into Deep Learning Models for a More Comprehensible AI—Three Challenges for Future Research

Open access
Futia, Giuseppe, Vetrò, Antonio·2020·Information

Abstract

Deep learning models contributed to reaching unprecedented results in prediction and classification tasks of Artificial Intelligence (AI) systems. However, alongside this notable progress, they do not provide human-understandable insights on how a specific result was achieved. In contexts where the impact of AI on human life is relevant (e.g., recruitment tools, medical diagnoses, etc.), explainability is not only a desirable property, but it is -or, in some cases, it will be soon-a legal requirement. Most of the available approaches to implement eXplainable Artificial Intelligence (XAI) focus on technical solutions usable only by experts able to manipulate the recursive mathematical functions in deep learning algorithms. A complementary approach is represented by symbolic AI, where symbols are elements of a lingua franca between humans and deep learning. In this context, Knowledge Graphs (KGs) and their underlying semantic technologies are the modern implementation of symbolic AI—while being less flexible and robust to noise compared to deep learning models, KGs are natively developed to be explainable. In this paper, we review the main XAI approaches existing in the literature, underlying their strengths and limitations, and we propose neural-symbolic integration as a cornerstone to design an AI which is closer to non-insiders comprehension. Within such a general direction, we identify three specific challenges for future research—knowledge matching, cross-disciplinary explanations and interactive explanations.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/info11020122

Cites

50 of 50 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Combining symbolic and subsymbolic approaches into neuro-symbolic systems shows significant promise by exploiting complementary strengths.

    “More recently, a combination of symbolic and subsymbolic approaches based on artificial neural networks, variously known as neuro-symbolic or neural-symbolic (henceforth NS) systems, has shown significant promise in exploiting the complementary strengths of individual approaches [20,28].”

    From Explainable AI (XAI): Core Ideas, Techniques, and Solutions (2023) · cites this paper as [20]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 5

  1. Ding, X.; Zhang, Y.; Liu, T.; Duan, J. Deep learning for event-driven stock prediction. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial intelligence, Buenos Aires, Argentina, 25-31 July 2015.
  2. Banerjee, S. A Semantic Web Based Ontology in the Financial Domain. In Proceedings of World Academy of Science, Engineering and Technology; World Academy of Science, Engineering and Technology (WASET): Paris, France, 2013; Number 78, p. 1663.
  3. Goodfellow, I.; Bengio, Y.; Courville, A. Deep Learning; MIT Press: Cambridge, MA, USA, 2016.
  4. Rumelhart, D.E. Parallel distributed processing: Explorations in the microstructure of cognition. Learn. Intern. Represent. Error Propag. 1986, 1, 318-362.
  5. Hall, P.; Gill, N. An Introduction to Machine Learning Interpretability-Dataiku Version; O'Reilly Media, Incorporated: Sebastopol, CA, USA, 2018.

Cited by

Sorted by citations

Authors
Futia, G., & Vetrò, A.
Affiliations
Politecnico di Torino (IT)
Corresponding author
Futia, Giuseppe
Venue
Information
Publisher
MDPI AG
Published
2020-02-22
Volume
11
Issue
2
Pages
122
ISSN
2078-2489 (ISSN-L)
OpenAlex
W3008128620
Cited by
94
References
50
Citations by year
2026: 3 · 2025: 17 · 2024: 17 · 2023: 22 · 2022: 20 · 2021: 10 · 2020: 5
FWCI
5.59
Type
journal article
Language
en
Open access
Locations
  • Information (publishedVersion, cc-by)
  • PORTO@Iris (submittedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
  • Physical Sciences › Computer Science › Artificial Intelligence › Semantic Web and Ontologies
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
Keywords
knowledge graphs, explainable AI, neural-symbolic integration, symbolic AI, knowledge matching, interactive explanations, semantic technologies

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review