Cargando…
Knowledge graph augmentation: consistency, immutability, reliability, and context
A knowledge graph is convenient for storing knowledge in artificial intelligence applications. On the other hand, it has some shortcomings that need to be improved. These shortcomings can be summarised as the inability to automatically update all the knowledge affecting a piece of knowledge when it...
Autor principal: | |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
PeerJ Inc.
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10495951/ https://www.ncbi.nlm.nih.gov/pubmed/37705668 http://dx.doi.org/10.7717/peerj-cs.1542 |
_version_ | 1785105003312054272 |
---|---|
author | Takan, Savaş |
author_facet | Takan, Savaş |
author_sort | Takan, Savaş |
collection | PubMed |
description | A knowledge graph is convenient for storing knowledge in artificial intelligence applications. On the other hand, it has some shortcomings that need to be improved. These shortcomings can be summarised as the inability to automatically update all the knowledge affecting a piece of knowledge when it changes, ambiguity, inability to sort the knowledge, inability to keep some knowledge immutable, and inability to make a quick comparison between knowledge. In our work, reliability, consistency, immutability, and context mechanisms are integrated into the knowledge graph to solve these deficiencies and improve the knowledge graph’s performance. Hash technology is used in the design of these mechanisms. In addition, the mechanisms we have developed are kept separate from the knowledge graph to ensure that the functionality of the knowledge graph is not impaired. The mechanisms we developed within the scope of the study were tested by comparing them with the traditional knowledge graph. It was shown graphically and with t-test methods that our proposed structures have higher performance in terms of update and comparison. It is expected that the mechanisms we have developed will contribute to improving the performance of artificial intelligence software using knowledge graphs. |
format | Online Article Text |
id | pubmed-10495951 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2023 |
publisher | PeerJ Inc. |
record_format | MEDLINE/PubMed |
spelling | pubmed-104959512023-09-13 Knowledge graph augmentation: consistency, immutability, reliability, and context Takan, Savaş PeerJ Comput Sci Algorithms and Analysis of Algorithms A knowledge graph is convenient for storing knowledge in artificial intelligence applications. On the other hand, it has some shortcomings that need to be improved. These shortcomings can be summarised as the inability to automatically update all the knowledge affecting a piece of knowledge when it changes, ambiguity, inability to sort the knowledge, inability to keep some knowledge immutable, and inability to make a quick comparison between knowledge. In our work, reliability, consistency, immutability, and context mechanisms are integrated into the knowledge graph to solve these deficiencies and improve the knowledge graph’s performance. Hash technology is used in the design of these mechanisms. In addition, the mechanisms we have developed are kept separate from the knowledge graph to ensure that the functionality of the knowledge graph is not impaired. The mechanisms we developed within the scope of the study were tested by comparing them with the traditional knowledge graph. It was shown graphically and with t-test methods that our proposed structures have higher performance in terms of update and comparison. It is expected that the mechanisms we have developed will contribute to improving the performance of artificial intelligence software using knowledge graphs. PeerJ Inc. 2023-08-16 /pmc/articles/PMC10495951/ /pubmed/37705668 http://dx.doi.org/10.7717/peerj-cs.1542 Text en © 2023 Takan https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Computer Science) and either DOI or URL of the article must be cited. |
spellingShingle | Algorithms and Analysis of Algorithms Takan, Savaş Knowledge graph augmentation: consistency, immutability, reliability, and context |
title | Knowledge graph augmentation: consistency, immutability, reliability, and context |
title_full | Knowledge graph augmentation: consistency, immutability, reliability, and context |
title_fullStr | Knowledge graph augmentation: consistency, immutability, reliability, and context |
title_full_unstemmed | Knowledge graph augmentation: consistency, immutability, reliability, and context |
title_short | Knowledge graph augmentation: consistency, immutability, reliability, and context |
title_sort | knowledge graph augmentation: consistency, immutability, reliability, and context |
topic | Algorithms and Analysis of Algorithms |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10495951/ https://www.ncbi.nlm.nih.gov/pubmed/37705668 http://dx.doi.org/10.7717/peerj-cs.1542 |
work_keys_str_mv | AT takansavas knowledgegraphaugmentationconsistencyimmutabilityreliabilityandcontext |