<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Review of automatic and semi-automatic creation of knowledge graphs from structured and unstructured data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Auritë Bytyçi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lorik Ramosaj</string-name>
          <email>lorik.ramosaj@student.uni-pr.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Eliot Bytyçi</string-name>
          <email>eliot.bytyci@uni-pr.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Prishtina “Hasan Prishtina”</institution>
          ,
          <addr-line>Prishtina, 10000, Kosovo</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>In today's data-driven world, data storage and information extraction are key processes where the focus of researchers and industries is centralized. While relational databases are widely used, knowledge graphs have emerged as a cutting-edge idea and have begun to compete with them as a result of utilization from renowned companies. Nevertheless, creating knowledge graphs is a time-consuming process that needs domain experts' support. This motivated us to research automatic or semi-automatic creation of knowledge graphs from structured or unstructured data. To do that and comprehend the newest advancements in this field, we have analyzed papers published in the recent five years in well-known libraries such as ACM, IEEE, Springer Link, and ScienceDirect. The analysis takes into account the process of building knowledge graphs, which encompasses the steps involved in managing unstructured texts, defining nodes and relationships between them, and developing ontologies. Moreover, widely used machine learning algorithms including support vector machines, neural networks, random forests, and logistic regression, and other algorithms such as K-Means, TF-IDF, BERT, and skip-gram, the usage of graph database platform Neo4j and Python scripting language, were considered. Conclusive to the study, there exist some semi-automatic approaches but the fully automatic ones remain as ideas.</p>
      </abstract>
      <kwd-group>
        <kwd>1 Knowledge graph</kwd>
        <kwd>machine learning</kwd>
        <kwd>automatic creation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        An enormous amount of data, in terms of large
velocity and large volume, is being produced
worldwide [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], with an estimated daily data
production of 2.5 billion terabytes [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Using data
analysis for various data architectures, especially
ones that accelerate machine learning, it is
possible to identify efficient ways to turn this
volume of data into knowledge. On the other
hand, this diverse data ecosystem has been a key
point in the transition from standard machine
architecture to other specialized architectures,
aiming for satisfactory efficiency, particularly the
effective use of available resources. Nevertheless,
even though hardware architecture and machine
learning algorithms are crucial components of
resource efficiency, a smart combination of both
is required to accomplish this efficient use of
resources [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        A novel idea, called a knowledge graph,
emerged as a result of the entire process.
Considering that sensors may extract a lot of data
that needs to be analyzed, knowledge graphs are
suitable for application in a variety of contexts.
One such context could be automated driving,
where data analysis conclusions from an initial
state of datasets offer less semantic and poorer
structure than the application of knowledge
graphs. Knowledge graphs could be used to
represent driving scenes and thus concluding that
knowledge graphs are more sophisticated in
capturing different relations between entities in
driving scenarios [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Other examples of
knowledge graphs application alongside sensors
include augmenting weather sensor data with
remote knowledge graphs [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Yet another
example is sensor usage to detect consumers'
health indicators to obtain a large amount of data
for knowledge graph creation based on food
science and industry [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        The Internet of Things (IoT) data is an
adequate illustration of the tremendous explosion
of data and the usage of knowledge graphs. The
network of physical objects known as the IoT
includes tools, instruments, cars, buildings, and
other things equipped with electronics, circuits,
software, sensors, and network connectivity,
allowing these objects to gather and share data [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
The IoT data segment is expanding rapidly, and
according to Statista, there will be 25.44 billion
IoT devices in use worldwide by 2030, a
prediction based on forecasts made by
DataSphere and StorageSphere showing that IoT
data is the fastest-growing data segment [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Data
produced needs to be stored somewhere and today
we mainly use cloud storage to store this
enormous quantity of data as the most adaptable
and convenient approach [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        The increasing demand for knowledge graphs
in various domains has led to the need for methods
to try to generate them automatically. Experts
frequently manually construct domain-specific
knowledge graphs, which process can be
timeconsuming and error-prone. Furthermore, manual
creation may not be possible in large-scale or
quickly evolving domains where the volume of
information is excessively vast to be done by
hand. This served as motivation to check recent
developments involving the automatic or
semiautomatic generation of knowledge graphs [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>The remainder of the paper is organized as
follows: Section 2 explains the rationale of
relational databases and their relation to
knowledge graphs, while Section 3 describes the
methodological approach used in the review and
Section 4 presents a detailed analysis of the
obtained papers. In Section 5, the paper is
concluded.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Relational databases knowledge graphs and</title>
      <sec id="sec-2-1">
        <title>In the 1970s, research at IBM and the</title>
        <p>
          University of California Berkeley led to the
development of relational databases. They were
initially a response to rising expenses for
implementing and maintaining sophisticated
systems [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. Edgar Codd was the first to advance
the idea of a relational model [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. He proposed
an idea where in a data table, the rows correspond
to unique things (such as students), and the
columns to numerous qualities (such as student
ID, first name, last name, and GPA) [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ].
        </p>
        <p>
          The fundamental principle of relational
database architecture has two advantages: it
reduces the amount of storage space required for
the database and it allows the management of one
or more relationships between collection items
[
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. Structured data, which easily fits in
wellorganized tables, performs well in these
databases. As opposed to that, relational databases
have trouble working with unstructured and
distributed data, due to the difficulty of linking
their tables across a distributed system [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
Relational databases are usually used by
businesses and often for transactions that require
great precision. They thus support ACID
(atomicity, consistency, isolation, and durability)
constraints [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. Moreover, their popularity can
be attributed to the relational data model's
simplicity and adaptability, which enable
effective and efficient data management. Due to
the relational data model's straightforward and
dependable data management capabilities,
healthcare organizations can store and access
data; such as patient demographics, medical
histories, test results and treatment records. Thus,
relational databases are used in medical
informatics to support the confidentiality and
security of sensitive patient information by
providing robust access control methods. The
advantages of using relational databases also
extend to the field of GIS (Geographic
Information Systems), including consistent data
management and analysis, real-time data querying
(especially in route planning), location-based
services, and spatial data analysis [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. Another
benefit of using relational databases is to manage
financial data, such as transaction records,
portfolio holdings, and market data [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ].
        </p>
        <p>
          Since Euler introduced Graph Theory as a
novel mathematical idea in 1735, graphs have
played a significant role in computational
sciences and mathematics [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. Given that the
focus of our work is on evaluating certain entities
and the relationships that they have with one
another, incorporating graph application into
different approaches could be quite beneficial
when considering the analogy of associating
entities to nodes and relationships to edges. That
choice is further strengthened by the notion that
knowledge graphs possess methods for
largescale data extraction from many sources of data.
Moreover, standard relational procedures (such as
join, union, etc.) employed in other No-SQL
models are empowered by specialized graph
query languages by providing the possibility of
finding entities connected by various paths of
different lengths [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ].
        </p>
        <p>
          Since their big debut in 2012, when Google
used their knowledge graph, knowledge graphs
have seen extensive use in both industry and
academia [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. Google Knowledge Graph has
been followed by further announcements of
knowledge graphs by Airbnb [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ], Amazon [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ],
Microsoft [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ], LinkedIn [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] and Facebook [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ],
among others. Applications for data
representation as graphs can be found in a wide
range of fields, including food science and
industry [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], medicine and healthcare [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ],
economics, banking, and finance [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ] and plenty
others. Knowledge graphs use the nodes and
edges technique of items and interactions
providing intuitive abstraction in a variety of
domains [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ]. The use of ontologies, a tangible
representation of a term's meaning within the
context of usage in the computational setting,
lends support to this positive argument [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ].
        </p>
        <p>
          Some aspects of knowledge graph structure are
very important for data mining and knowledge
discovery usage. Considering a graph-based
database, knowledge discovery is further
improved and the results derived from specific
cases show significantly good benefits with the
main focus on a novel approach using knowledge
graphs and machine learning [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ].
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Methodology</title>
      <sec id="sec-3-1">
        <title>Our research is based on recommendations</title>
        <p>
          from Prisma [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ] and follows their checklist for
performing a systematic review. The search was
conducted in four libraries: IEEExplore,
ScienceDirect, Springer Link and ACM digital
library. The query used for the search was:
(“databases” OR “relations databases”) AND
“knowledge graphs” AND “automatic” AND
“creation”. With this query we intended to locate
any relevant papers that would explain generation
of knowledge graphs, automatically or semi
automatically from tabular data or relational
databases. Due to recency of the topic, we have
decided to limit the search to the last five years,
resulting in a period from 2017 until December
2022, when the search was concluded.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Thus, the strategy used has identified 1027</title>
        <p>potential papers in all four libraries. In
IEEExplore search resulted in 232 papers, while
in Springer Link the search resulted in 288 papers.
In ScienceDirect and ACM digital library the
searches resulted in 342 papers and 165 papers,
respectively. Diagram presented in Figure 1
explains the selection process.</p>
        <p>After the initial collection of the papers, the
selection process started. Initially the collection
was checked for duplicates that might have come
up in different libraries. After that books and book
chapters were removed from the collection,
followed by surveys and reviews. The selection
concentrated in Journal and Conference papers,
since those would report the most recent progress
in the field. The selection process continued with
the procedure of selecting the most appropriate
papers by reviewing each paper on the keywords
and abstracts. If the reviewer had doubt, another
reviewer would help to filter and select or not the
paper. That concluded the first round of the
reviews, which resulted in 56 papers selected. The
second round involved reading the whole paper
and deciding whether the paper is still interesting
and fits to the criteria defined in the beginning of
the review. A final table with all selected papers
was created. The table was filled with different
characteristics of the papers, such as: domain,
methodology used, conclusions and future
suggestions of the authors.</p>
        <p>The final 21 papers chosen for the review were
analyzed in depth and their analysis is presented
in Section 3. Papers were selected by consensus
of the reviewers and their analysis described also
according to the overall consensus. It should be
noted that we were not able to find online 2 papers
as complete documents, therefore we were not
able to include them, resulting in 19 papers to be
analyzed.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Research analysis of the selected</title>
      <p>papers</p>
    </sec>
    <sec id="sec-5">
      <title>4.1. Meta data analysis</title>
      <sec id="sec-5-1">
        <title>Preliminary findings regarding the quantity of</title>
        <p>the papers published and reviewed by the study,
are presented in Figure 2. Even though there was
a drop-down tendency, in papers reviewed, which
we believe was due to unforeseen worldwide
situations, the trend kept growing for the future.
This we believe is related to the growing usage of
knowledge graphs in different domains</p>
      </sec>
      <sec id="sec-5-2">
        <title>As per venues of the paper presentations,</title>
        <p>presented in Figure 3, one specific conference
stands out: International joint conference on
knowledge graphs. Nevertheless, there are also
well-established journals present such as The
Semantic Web, Expert Systems with Applications
and Journal of Biomedical Semantics, which we
believe relates to the domain of the research.</p>
      </sec>
      <sec id="sec-5-3">
        <title>The most used research domain, in the</title>
        <p>
          analyzed papers, is medicine [
          <xref ref-type="bibr" rid="ref29 ref40 ref42 ref45">29, 40, 42, 45</xref>
          ] and
education [
          <xref ref-type="bibr" rid="ref34 ref35 ref39 ref46">34, 35, 39, 46</xref>
          ], followed by research
conducted with graphs in research papers [
          <xref ref-type="bibr" rid="ref32 ref38">32, 38</xref>
          ],
followed by other diverse domains [
          <xref ref-type="bibr" rid="ref30 ref31 ref32 ref33 ref36 ref37 ref41 ref43 ref44 ref47">30, 31, 32, 33,
36, 37, 41, 43, 44, 47</xref>
          ] as shown in Figure 4.
        </p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Thorough paper analysis</title>
      <p>
        Researchers in [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ] suggest that by bypassing
nearly completely the supervision of knowledge
extraction in a biomedical application, it can be
generalized for other domains as well. Yet,
another semi supervised knowledge graph
creation was proposed by [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ] but for a different
industry, welding. Knowledge graph creation in
[
        <xref ref-type="bibr" rid="ref34">34</xref>
        ] was performed with the combination of
manual and automatic methods, while authors in
[
        <xref ref-type="bibr" rid="ref36">36</xref>
        ] focus on creating biodiversity knowledge
graphs in semi-automatic fashion, with usage of
data mining.
      </p>
      <p>
        Few other authors such as [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ] suggest
construction of an automatic tool for knowledge
graph creation in retails, and similarly authors in
[
        <xref ref-type="bibr" rid="ref35">35</xref>
        ] suggest automatic construction methods.
      </p>
      <p>
        In several papers, a crucial part of the process
involves handling unstructured texts. One
approach involves using information extraction to
retrieve facts from text, with each fact comprising
a subject, predicate, and object [
        <xref ref-type="bibr" rid="ref29 ref34">29, 34</xref>
        ], while
other strategies include using knowledge
extraction techniques to extract information from
unstructured texts [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ]. Moreover, there are
approaches that incorporate unstructured data
from free texts as data subject to extraction of
electronic medical records of patients for vector
representation [
        <xref ref-type="bibr" rid="ref40">40</xref>
        ] and using unstructured texts as
input that is transformed into cognitive script
understandable by humans for the development of
a computing model for a graph-based repository
[
        <xref ref-type="bibr" rid="ref42">42</xref>
        ]. Entities and relationships between them in
the dataset are among the important beginning
points in the knowledge graph creation procedure.
Entity linking, which allows the linking of text
spans to previously known entities, is described in
some papers as the first step in the construction of
knowledge graphs [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ] and managing mappings
between cells and entities in a knowledge graph
[
        <xref ref-type="bibr" rid="ref44">44</xref>
        ]. Besides entity linking, information
extraction is another crucial component in
building knowledge graphs, involving extracted
entities and relationships [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ] alongside the
preprocessing phase that includes a model with
entities and relationships for knowledge graph
[
        <xref ref-type="bibr" rid="ref36">36</xref>
        ]. Developing a neural architecture for the
identification of entities and relationships
between them in order to construct knowledge
graphs [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ], carrying out manual analysis for
detected entities [
        <xref ref-type="bibr" rid="ref40">40</xref>
        ], executing Cypher
statements to create entities with properties and
corresponding relationships after they have been
generated with Python that was applied to
cognitive scripts [
        <xref ref-type="bibr" rid="ref42">42</xref>
        ] and using named entity
recognition to create more machine-readable
sentences [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ] are other important approaches
used in the remaining papers. Two other relevant
concepts mentioned and used are: data cleaning
which identifies anomalies from existing data and
newly imputed values [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ] and provides
possibility of achieving an effective form of data
expression when data cleaning of triple data is
applied [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ], and handling synonyms -creating a
lexical redirection table to keep track of synonym
relationships between tags [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ], enriching
knowledge graph with synonyms [
        <xref ref-type="bibr" rid="ref36">36</xref>
        ] and
associating synonyms between product types and
attribute values [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ]. Important aspect of
knowledge graph creation are ontologies, too, and
several approaches have been used in the papers:
using many ontologies for knowledge graph
creation that are created for particular tasks in
order to model the general knowledge, connect
datatype properties with classes with the same
name and produce upper level schema [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ], as a
comprehensive suite in the architecture consisting
of taxonomy enrichment and relation discovery
[
        <xref ref-type="bibr" rid="ref31">31</xref>
        ] and particular ontology facilitated by
automatic class suggestions at the sentence
annotation stage [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ]. Other strategies employed
include constructing the knowledge graph
ontology using Protégé tool [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ], using the
prefixed structure of the DISK ontology to
transform sentences into readable texts [
        <xref ref-type="bibr" rid="ref43">43</xref>
        ], et
cetera. Utilizing an ontology that was suggested
in another article is a different strategy [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ],
whereas some papers don’t mention any specific
ontologies [
        <xref ref-type="bibr" rid="ref35 ref36 ref38 ref42">35, 36, 38, 42</xref>
        ].
      </p>
      <p>
        According to our research, most of the papers
that dealt with generation of graphs from tabular
data / relational databases, used machine learning
algorithms such as logistic regression [
        <xref ref-type="bibr" rid="ref31 ref40">31, 40</xref>
        ],
random forest [
        <xref ref-type="bibr" rid="ref31 ref40 ref46">31, 40, 46</xref>
        ], support vector
machine [
        <xref ref-type="bibr" rid="ref31 ref40 ref46">31, 40, 46</xref>
        ], neural networks (mainly to
train the respective models) [
        <xref ref-type="bibr" rid="ref33 ref35 ref38 ref43 ref46">33, 35, 38, 43, 46</xref>
        ],
and other algorithms [
        <xref ref-type="bibr" rid="ref30 ref32 ref34 ref39 ref41">30, 32, 34, 39, 41</xref>
        ]. They
have been an important aspect of knowledge
graph creation, used as a trained model for future
predictions [
        <xref ref-type="bibr" rid="ref40">40</xref>
        ], helping manual processes on
knowledge graph creation [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ], building the
ontology [
        <xref ref-type="bibr" rid="ref41">41</xref>
        ], integrating data from multiple
sources to create an unified knowledge
representation (with the help of semantic web
technologies) [
        <xref ref-type="bibr" rid="ref46">46</xref>
        ], and providing analytical
functionality [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ]. Alongside machine learning
algorithms, K-means algorithm is used in
Knowledge Graph embeddings algorithm [
        <xref ref-type="bibr" rid="ref43">43</xref>
        ]
and also finds an important role in creating the
knowledge graph from extracted concepts and
relationships using natural language processing
[
        <xref ref-type="bibr" rid="ref34">34</xref>
        ], while natural language processing (among
the most famous mentioned are TF-IDF [
        <xref ref-type="bibr" rid="ref34 ref39">34, 39</xref>
        ],
BERT and skip-gram [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ]) and mining the data
are found to be very useful for identifying spans
and other necessary elements that need to be
provided in order to create a knowledge graph.
Other algorithms used involve cognitive scripting
to define knowledge graph representation [
        <xref ref-type="bibr" rid="ref42">42</xref>
        ],
entity linking [
        <xref ref-type="bibr" rid="ref29 ref32 ref44">29, 32, 44</xref>
        ] and Viterbi algorithm
[
        <xref ref-type="bibr" rid="ref33">33</xref>
        ]. Some papers might have performed manual
conversion from relational databases to
knowledge graphs [
        <xref ref-type="bibr" rid="ref46">46</xref>
        ] or no specific algorithm
was mentioned [
        <xref ref-type="bibr" rid="ref37 ref47">37, 47</xref>
        ].
      </p>
      <p>
        Knowledge storage is another essential
component of the process of the creation of
knowledge graphs [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ]. In some of the
publications we examined, Neo4j is a unique
graph database platform [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ] used as a storage
tool that in some cases incorporates the
visualization process [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ] with the D3.js
visualization tool from Neo4j used to complete
the visualization. Loading the original data,
specifying the data into the document elements,
determining the scope of components, and setting
attributes to control the transition and change
process of the elements are the steps of using
D3.js based on the data document to address the
limitation of data presentation [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ]. Another paper
refers to Neo4j as a non-relational graph store, a
structured repository for the extracted knowledge
[
        <xref ref-type="bibr" rid="ref42">42</xref>
        ]. The nodes in a graph store are connected by
relationships between other nodes in the domain,
which are all machine-readable entities [
        <xref ref-type="bibr" rid="ref42">42</xref>
        ]. It
contains the characteristics of the entities and their
relationships as a key-value pair to describe
specific pieces of information, as an essential
component of knowledge graph storing and
visualization [
        <xref ref-type="bibr" rid="ref42">42</xref>
        ].
      </p>
      <p>
        The use of Python, is a significant finding from
the papers we analyzed, too. Python was used to
create an innovative program that produces
Cypher statements from a cognitive script to
create nodes and edges in Neo4j [
        <xref ref-type="bibr" rid="ref42">42</xref>
        ]. In a
different study, during the creation of a
knowledge graph by utilizing a pre-created
ontology two Python libraries are used [
        <xref ref-type="bibr" rid="ref37">37</xref>
        ]. The
first one is the Osmium Python library, which is
used to retrieve all OSM nodes from the newest
OSM dumbs, while the other library, known as
RDFlib, is responsible for creating RDF triples.
4.3.
      </p>
    </sec>
    <sec id="sec-7">
      <title>Limitations of the review</title>
      <sec id="sec-7-1">
        <title>Knowledge graphs have seen a recent increase</title>
        <p>in usage by major players in industry and thus also
a vast number of papers are dealing with them in
the last few years. This makes the review even
harder, especially taking into account the number
of fields dealing with knowledge graphs.</p>
        <p>Even though we have used major libraries to
retrieve the number of papers, we might have
missed any of the other relevant papers from other
different online databases. Moreover,
nonEnglish papers were not included in the review,
and we were not able to retrieve a couple of them
as mentioned in the methodology part.</p>
        <p>Despite the limitations, to the best of our
knowledge, the majority of interesting papers for
this review were retrieved in the last five years.
Those papers were classified and analyzed to
identify a few interesting aspects tackled by the
researchers related to knowledge graphs.
4.4.</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>Future challenge directions</title>
      <sec id="sec-8-1">
        <title>Regarding future research, although many of</title>
        <p>
          the papers discuss enhancing their models, it is
noteworthy that BERT is mentioned in few of the
papers [
          <xref ref-type="bibr" rid="ref32 ref35 ref38 ref42">32, 35, 38, 42</xref>
          ] as the way forward.
Nevertheless, GPT-3 is seen as a possibility to use
for the pre-trained models, too [
          <xref ref-type="bibr" rid="ref42">42</xref>
          ].
        </p>
      </sec>
    </sec>
    <sec id="sec-9">
      <title>5. Conclusion</title>
      <p>Machine learning algorithms, along with
semantic data mining, deep reinforcement
learning, crowdsourcing, and natural language
processing methods, are heavily utilized in the
building of knowledge graphs. Even though some
papers suggest semi-automatic and automatic
methods for producing knowledge graphs, manual
methods are less popular because of their
shortcomings, which include the inability to easily
combine data from various sources into a single
knowledge graph, the potential for bias in
knowledge graph creation, and the requirement
for ongoing maintenance.</p>
      <p>Applications for knowledge graphs can be
found in a variety of industries, including
education, metallurgy, healthcare, and the food
sector, as depicted in Figure 4 from the reviewed
papers. The results obtained in the publications
studied for this review show that it is possible to
extract important data and relationships from
these created knowledge graphs by using machine
learning methods, underpinned by the observation
that a majority of the scrutinized papers employ at
least one variant of machine learning algorithms
in their analyses. Another conclusion that can be
inferred is that knowledge graphs can be
effectively and usefully constructed when the data
and relationships in a knowledge graph are
properly structured, utilizing well-designed
ontologies and cutting-edge algorithms.</p>
    </sec>
    <sec id="sec-10">
      <title>6. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Morik</surname>
            ,
            <given-names>Katharina.</given-names>
          </string-name>
          <article-title>"Machine Learning under Resource Constraints."</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Reddy</surname>
            , AV Rama Krishna,
            <given-names>T. Murali</given-names>
          </string-name>
          <string-name>
            <surname>Krishna</surname>
            , and
            <given-names>J. Mohan</given-names>
          </string-name>
          <string-name>
            <surname>Kumar</surname>
          </string-name>
          .
          <article-title>"A Short Review on News Articles Clustering."</article-title>
          <source>Mathematical Statistician and Engineering Applications</source>
          <volume>71</volume>
          .1 (
          <year>2022</year>
          ):
          <fpage>167</fpage>
          -
          <lpage>172</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Halilaj</surname>
          </string-name>
          ,
          <string-name>
            <surname>Lavdim</surname>
          </string-name>
          , et al.
          <article-title>"Knowledge graphs for automated driving</article-title>
          .
          <source>" 2022 IEEE Fifth International Conference on Artificial Intelligence</source>
          and
          <article-title>Knowledge Engineering (AIKE)</article-title>
          . IEEE,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <surname>Jiantao</surname>
          </string-name>
          , et al.
          <article-title>"Augmenting weather sensor data with remote knowledge graphs." IGARSS 2022-2022 IEEE International Geoscience and Remote Sensing Symposium</article-title>
          . IEEE,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Min</surname>
          </string-name>
          ,
          <string-name>
            <surname>Weiqing</surname>
          </string-name>
          , et al.
          <article-title>"Applications of knowledge graphs for food science</article-title>
          and
          <source>industry." Patterns 3</source>
          .5 (
          <year>2022</year>
          ):
          <fpage>100484</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Gokhale</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bhat</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Bhat</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2018</year>
          ).
          <article-title>Introduction to IOT</article-title>
          .
          <source>International Advanced Research Journal in Science, Engineering and Technology</source>
          ,
          <volume>5</volume>
          (
          <issue>1</issue>
          ),
          <fpage>41</fpage>
          -
          <lpage>44</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Trikha</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          (
          <year>2010</year>
          ).
          <article-title>A journey from floppy disk to cloud storage</article-title>
          .
          <source>International Journal on Computer Science and Engineering</source>
          ,
          <volume>2</volume>
          (
          <issue>4</issue>
          ),
          <fpage>1449</fpage>
          -
          <lpage>1452</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gu</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Gao</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          (
          <year>2020</year>
          ).
          <article-title>Multi-source knowledge integration based on machine learning algorithms for domain ontology</article-title>
          .
          <source>Neural Computing and Applications</source>
          ,
          <volume>32</volume>
          ,
          <fpage>235</fpage>
          -
          <lpage>245</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Seltzer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2008</year>
          ).
          <article-title>Beyond relational databases</article-title>
          .
          <source>Communications of the ACM</source>
          ,
          <volume>51</volume>
          (
          <issue>7</issue>
          ),
          <fpage>52</fpage>
          -
          <lpage>58</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Codd</surname>
            ,
            <given-names>E. F.</given-names>
          </string-name>
          (
          <year>1983</year>
          ).
          <article-title>A relational model of data for large shared data banks</article-title>
          .
          <source>Communications of the ACM</source>
          ,
          <volume>26</volume>
          (
          <issue>1</issue>
          ),
          <fpage>64</fpage>
          -
          <lpage>69</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Strawn</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Strawn</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          (
          <year>2016</year>
          ).
          <article-title>Relational databases: Codd, Stonebraker, and Ellison</article-title>
          .
          <source>IT Professional</source>
          ,
          <volume>18</volume>
          (
          <issue>2</issue>
          ),
          <fpage>63</fpage>
          -
          <lpage>65</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Morris</surname>
            ,
            <given-names>P. J.</given-names>
          </string-name>
          (
          <year>2005</year>
          ).
          <article-title>Relational database design and implementation for biodiversity informatics</article-title>
          .
          <source>The Academy of Natural Sciences1900 Ben Franklin Parkway</source>
          , Philadelphia.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Leavitt</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          (
          <year>2010</year>
          ).
          <article-title>Will NoSQL databases live up to their promise?</article-title>
          .
          <source>Computer</source>
          ,
          <volume>43</volume>
          (
          <issue>2</issue>
          ),
          <fpage>12</fpage>
          -
          <lpage>14</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Tan</surname>
            ,
            <given-names>K. S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Egenhofer</surname>
            ,
            <given-names>M. J.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Laurentijn</surname>
            ,
            <given-names>R. J. G.</given-names>
          </string-name>
          (
          <year>1994</year>
          ).
          <source>Relational Databases in Geographic Information Systems. Geographical Systems</source>
          ,
          <volume>1</volume>
          (
          <issue>1</issue>
          ),
          <fpage>1</fpage>
          -
          <lpage>16</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Seeber</surname>
            ,
            <given-names>R. J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Johnson</surname>
            ,
            <given-names>D. W.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Thompson</surname>
            ,
            <given-names>G. L.</given-names>
          </string-name>
          (
          <year>1998</year>
          ).
          <source>Relational Databases in Financial Management. Financial Management</source>
          ,
          <volume>27</volume>
          (
          <issue>1</issue>
          ),
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Trudeau</surname>
            ,
            <given-names>R.J</given-names>
          </string-name>
          . Introduction to Graph Theory; Courier Corporation: North Chelmsford, MA, USA,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Hogan</surname>
          </string-name>
          ,
          <string-name>
            <surname>Aidan</surname>
          </string-name>
          , et al.
          <source>Knowledge Graphs</source>
          . Springer,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Shaoxiong</surname>
          </string-name>
          ,
          <string-name>
            <surname>Ji</surname>
          </string-name>
          , et al.
          <article-title>"A survey on knowledge graphs: Representation, acquisition, and applications." IEEE transactions on neural networks and learning systems (</article-title>
          <year>2021</year>
          ):
          <fpage>494</fpage>
          -
          <lpage>514</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Chiticariu</surname>
            , Laura,
            <given-names>Yunyao</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>and Frederick</given-names>
          </string-name>
          <string-name>
            <surname>Reiss</surname>
          </string-name>
          .
          <article-title>"Rule-based information extraction is dead! long live rule-based information extraction systems!."</article-title>
          <source>Proceedings of the 2013 conference on empirical methods in natural language processing</source>
          .
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Hitzler</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <article-title>"Modeling with ontology design patterns: Chess games as a worked example." Ontology Engineering with Ontology Design Patterns: Foundations and Applications 25 (</article-title>
          <year>2016</year>
          ):
          <fpage>3</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Skjaeveland</surname>
            ,
            <given-names>Martin G.</given-names>
          </string-name>
          , et al.
          <article-title>"Practical ontology pattern instantiation, discovery, and maintenance with reasonable ontology templates." The Semantic Web-ISWC</article-title>
          <year>2018</year>
          : 17th International Semantic Web Conference, Monterey, CA, USA, October 8-
          <issue>12</issue>
          ,
          <year>2018</year>
          , Proceedings,
          <source>Part I 17</source>
          . Springer International Publishing,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Heindorf</surname>
          </string-name>
          ,
          <string-name>
            <surname>Stefan</surname>
          </string-name>
          , et al.
          <article-title>"Vandalism detection in wikidata."</article-title>
          <source>Proceedings of the 25th ACM International on Conference on Information and Knowledge Management</source>
          .
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Page</surname>
          </string-name>
          ,
          <string-name>
            <surname>Lawrence</surname>
          </string-name>
          , et al.
          <article-title>The PageRank citation ranking: Bringing order to the web</article-title>
          .
          <source>Stanford InfoLab</source>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Rajabi</surname>
            , Enayat, and
            <given-names>Somayeh</given-names>
          </string-name>
          <string-name>
            <surname>Kafaie</surname>
          </string-name>
          .
          <article-title>"Knowledge Graphs and Explainable AI in Healthcare</article-title>
          .
          <source>" Information</source>
          <volume>13</volume>
          .10 (
          <year>2022</year>
          ):
          <fpage>459</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Shuai.</given-names>
          </string-name>
          <article-title>"On the Analysis of Large Integrated Knowledge Graphs for Economics, Banking and</article-title>
          <string-name>
            <surname>Finance." EDBT</surname>
          </string-name>
          /ICDT Workshops.
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>Angles</surname>
            ,
            <given-names>Renzo.</given-names>
          </string-name>
          "
          <source>The Property Graph Database Model." AMW</source>
          .
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <surname>Muñoz</surname>
            ,
            <given-names>Emir.</given-names>
          </string-name>
          <article-title>Knowledge graph mining with latent shape graphs</article-title>
          .
          <source>Diss. NUI Galway</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <surname>Page</surname>
            ,
            <given-names>Matthew J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joanne</surname>
            <given-names>E.</given-names>
          </string-name>
          <string-name>
            <surname>McKenzie</surname>
          </string-name>
          ,
          <string-name>
            <surname>Patrick M. Bossuyt</surname>
            , Isabelle Boutron, Tammy C. Hoffmann,
            <given-names>Cynthia D.</given-names>
          </string-name>
          <string-name>
            <surname>Mulrow</surname>
          </string-name>
          , Larissa Shamseer et al.
          <article-title>"The PRISMA 2020 statement: an updated guideline for reporting systematic reviews." Systematic reviews 10</article-title>
          , no.
          <issue>1</issue>
          (
          <year>2021</year>
          ):
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <surname>Kroll</surname>
            , Hermann, Jan Pirklbauer, and
            <given-names>WolfTilo</given-names>
          </string-name>
          <string-name>
            <surname>Balke</surname>
          </string-name>
          .
          <article-title>"A toolbox for the nearlyunsupervised construction of digital library knowledge graphs." 2021 ACM/IEEE Joint Conference on Digital Libraries (JCDL)</article-title>
          . IEEE,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <surname>Baifan</surname>
          </string-name>
          , et al.
          <article-title>"Scaling usability of ML analytics with knowledge graphs: exemplified with a Bosch welding case</article-title>
          .
          <source>" The 10th International Joint Conference on Knowledge Graphs</source>
          .
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <surname>Dong</surname>
            ,
            <given-names>Xin</given-names>
          </string-name>
          <string-name>
            <surname>Luna</surname>
          </string-name>
          , et al.
          <article-title>"Autoknow: Selfdriving knowledge collection for products of thousands of types."</article-title>
          <source>Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining</source>
          .
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <surname>Oelen</surname>
            , Allard,
            <given-names>Markus</given-names>
          </string-name>
          <string-name>
            <surname>Stocker</surname>
            , and
            <given-names>Sören</given-names>
          </string-name>
          <string-name>
            <surname>Auer</surname>
          </string-name>
          .
          <article-title>"Crowdsourcing scholarly discourse annotations</article-title>
          .
          <source>" 26th International Conference on Intelligent User Interfaces</source>
          .
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <surname>Deng</surname>
          </string-name>
          ,
          <string-name>
            <surname>Jianfeng</surname>
          </string-name>
          , et al.
          <article-title>"Research on event logic knowledge graph construction method of robot transmission system fault diagnosis." IEEE Access 10 (</article-title>
          <year>2022</year>
          ):
          <fpage>17656</fpage>
          -
          <lpage>17673</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <surname>Bai</surname>
            , Junhua, and
            <given-names>Lei</given-names>
          </string-name>
          <string-name>
            <surname>Che</surname>
          </string-name>
          .
          <article-title>"Construction and Application of Database Micro-course Knowledge Graph Based on Neo4j."</article-title>
          <source>The 2nd International Conference on Computing and Data Science</source>
          .
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <surname>Su</surname>
            , Ying,
            <given-names>and Yong</given-names>
          </string-name>
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          .
          <article-title>"Automatic construction of subject knowledge graph based on educational big data</article-title>
          .
          <source>" Proceedings of the 2020 The 3rd International Conference on Big Data and Education</source>
          .
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <surname>Sharafeldeen</surname>
            , Dina,
            <given-names>Alsayed</given-names>
          </string-name>
          <string-name>
            <surname>Algergawy</surname>
          </string-name>
          , and
          <string-name>
            <surname>Birgitta</surname>
          </string-name>
          König-Ries.
          <article-title>"Towards knowledge graph construction using semantic data mining."</article-title>
          <source>Proceedings of the 21st International Conference on Information Integration and Web-based Applications &amp; Services</source>
          .
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <surname>Dsouza</surname>
          </string-name>
          ,
          <string-name>
            <surname>Alishiba</surname>
          </string-name>
          , et al.
          <article-title>"Worldkg: A worldscale geographic knowledge graph."</article-title>
          <source>Proceedings of the 30th ACM International Conference on Information &amp; Knowledge Management</source>
          .
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <surname>Trivedi</surname>
            , Ishdutt, and
            <given-names>Sudhan</given-names>
          </string-name>
          <string-name>
            <surname>Majhi</surname>
          </string-name>
          .
          <article-title>"Span level model for the construction of scientific knowledge graph." 2020 5th International Conference on Computing, Communication and Security (ICCCS)</article-title>
          . IEEE,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <surname>Qiao</surname>
          </string-name>
          ,
          <string-name>
            <surname>Lei</surname>
          </string-name>
          , et al.
          <article-title>"Automated constmction of course knowledge graph based on China MOOC platform</article-title>
          .
          <article-title>" 2019 IEEE International Conference on Engineering, Technology and Education (TALE)</article-title>
          . IEEE,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <string-name>
            <surname>Gazzotti</surname>
          </string-name>
          ,
          <string-name>
            <surname>Raphaël</surname>
          </string-name>
          , et al.
          <article-title>"Extending electronic medical records vector models with knowledge graphs to improve hospitalization prediction</article-title>
          .
          <source>" Journal of Biomedical Semantics 13.1</source>
          (
          <year>2022</year>
          ):
          <fpage>1</fpage>
          -
          <lpage>20</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [41]
          <string-name>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <surname>Ting</surname>
          </string-name>
          , et al.
          <article-title>"Multi-source knowledge integration based on machine learning algorithms for domain ontology</article-title>
          .
          <source>" Neural Computing and Applications</source>
          <volume>32</volume>
          (
          <year>2020</year>
          ):
          <fpage>235</fpage>
          -
          <lpage>245</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [42]
          <string-name>
            <surname>Fahd</surname>
          </string-name>
          ,
          <string-name>
            <surname>Kiran</surname>
          </string-name>
          , et al.
          <article-title>"Knowledge graph model development for knowledge discovery in dementia research using cognitive scripting and next-generation graph-based database: a design science research approach."</article-title>
          <source>Social Network Analysis and Mining 12.1</source>
          (
          <year>2022</year>
          ):
          <fpage>61</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          [43]
          <string-name>
            <surname>de</surname>
            <given-names>Haan</given-names>
          </string-name>
          , Rosaline,
          <string-name>
            <given-names>Ilaria</given-names>
            <surname>Tiddi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Wouter</given-names>
            <surname>Beek</surname>
          </string-name>
          .
          <article-title>"Discovering research hypotheses in social science using knowledge graph embeddings." The Semantic Web: 18th International Conference</article-title>
          , ESWC 2021,
          <string-name>
            <given-names>Virtual</given-names>
            <surname>Event</surname>
          </string-name>
          , June 6-10,
          <year>2021</year>
          , Proceedings 18. Springer International Publishing,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          [44]
          <string-name>
            <surname>Cremaschi</surname>
          </string-name>
          ,
          <string-name>
            <surname>Marco</surname>
          </string-name>
          , et al.
          <article-title>"A fully automated approach to a complete semantic table interpretation." Future Generation Computer Systems 112 (</article-title>
          <year>2020</year>
          ):
          <fpage>478</fpage>
          -
          <lpage>500</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          [45]
          <string-name>
            <surname>Sloep</surname>
          </string-name>
          ,
          <string-name>
            <surname>Matthijs</surname>
          </string-name>
          , et al.
          <article-title>"A knowledge graph representation of baseline characteristics for the Dutch proton therapy research registry</article-title>
          .
          <source>" Clinical and Translational Radiation Oncology</source>
          <volume>31</volume>
          (
          <year>2021</year>
          ):
          <fpage>93</fpage>
          -
          <lpage>96</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          [46]
          <string-name>
            <surname>Paneque</surname>
          </string-name>
          , Manuel,
          <source>María del Mar RoldánGarcía</source>
          , and
          <string-name>
            <surname>José</surname>
          </string-name>
          García-Nieto.
          <article-title>"e-LION: Data integration semantic model to enhance predictive analytics in e-Learning."</article-title>
          <source>Expert Systems with Applications</source>
          <volume>213</volume>
          (
          <year>2023</year>
          ):
          <fpage>118892</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref47">
        <mixed-citation>
          [47]
          <string-name>
            <surname>Alobaid</surname>
            , Ahmad, and
            <given-names>Oscar</given-names>
          </string-name>
          <string-name>
            <surname>Corcho</surname>
          </string-name>
          .
          <article-title>"Balancing coverage and specificity for semantic labelling of subject columns." Knowledge-Based Systems 240 (</article-title>
          <year>2022</year>
          ):
          <fpage>108092</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>