<!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>Advancing on the Linked Open University Context: a Cuban linked Open University</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Informatics Sciences</institution>
          ,
          <country country="CU">Cuba</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2021</year>
      </pub-date>
      <fpage>49</fpage>
      <lpage>56</lpage>
      <abstract>
        <p>Linked Open Universities apply Linked Data to publish information about universities. In 2010, the Open University in the UK was launched as the rst initiative to expose public information from the university in an accessible, open, integrated, and Web-based format. Since then, universities around the world have been joining that initiative by deploying their own linked open data platforms. However, during the publication of their data using the linked data principles, universities face challenges such as the lack of a uni ed, well-accepted vocabulary; the need of coping with the heterogeneity of datasets; the high cost to host the existing SPARQL endpoints; the performance shortcomings in federated queries over current SPARQL endpoints and the incompleteness of datasets. The aim of this Ph.D. research proposal is to advance on the Linked Open University context with a proposal for the University of Informatics Sciences from Cuba addressing some of these challenges.</p>
      </abstract>
      <kwd-group>
        <kwd>Knowledge graph • linked data • linked open university • ontologies</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Linked Open Universities apply Linked Data to publish information about
universities [
        <xref ref-type="bibr" rid="ref3 ref4 ref5">3,5,4</xref>
        ]. Traditionally, universities produce large amounts of data, much
of which should be publicly available [
        <xref ref-type="bibr" rid="ref3 ref5">3,5</xref>
        ]. In this context, sharing and reusing
knowledge is a challenge where Linked Open Data (LOD) can play an important
role[
        <xref ref-type="bibr" rid="ref3 ref5">3,5</xref>
        ]. In 2010, the Open University in the UK was launched as the rst
initiative to expose public information from the university in an accessible, open,
integrated, and Web-based format[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Since then, universities around the world
have been joining that initiative by deploying their own LOD platforms[
        <xref ref-type="bibr" rid="ref12 ref6 ref8">6,8,12</xref>
        ].
      </p>
      <p>
        The process of generating linked datasets in universities consists of the
following stages[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]: i) raw data collection, ii) de ning the vocabulary model based
on reusing existing ontologies and extend them when it is needed, iii) extracting
and generating RDF datasets according to the de ned vocabulary, iv) achieving
interlinking among datasets internally and externally, v) storing the outcome
datasets and exposing them via SPARQL endpoints, vi) exploiting datasets by
developing applications and services on top, and, vii) providing optimization
and quality. In this sense, during the process, institutions have faced several
issues. Some of those issues are the following (without the intention of being
exhaustive)[
        <xref ref-type="bibr" rid="ref1 ref10 ref13 ref7 ref8">10,8,1,13,7</xref>
        ]:
{ Lack of a uni ed, well-accepted vocabulary that satis es all universities'
requirements. Vocabularies (or ontologies, more strictly), de ne the concepts
and relations (also referred to as \terms") used to describe and represent an
area of concern. A standard set of vocabularies provides a uni ed access to
data consumers [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. That is why former works about linked open
universities agree with reusing existing vocabularies as much as possible. However,
despite the fact that there are a lot of vocabularies/ontologies to describe
entities in this context, there is no a standard vocabulary/ontology (or group
of them) that meets the requirements of all universities.
{ The need of coping with the heterogeneity of datasets. Open university
repositories look like a sea full of wealth resources, and the problem is how we
can reach the needed resources easily. Description of dataset metadata is a
crucial step to cope with the heterogeneity of datasets.
{ The high cost of the existing SPARQL endpoint interfaces. Due to the high
expressive power of SPARQL, the processing of many kinds of queries on
SPARQL endpoints is very expensive in terms of server CPU time and
memory consumption. Sometimes that consumption is unpredictable and thus,
SPARQL endpoints su er from frequent downtime.
{ Performance shortcomings of federated queries over current SPARQL
endpoints. A 2013 survey revealed that the majority of public SPARQL
endpoints had an uptime of less than 95%. This unavailability increases in
federated queries where we query many knowledge graphs.
{ Incomplete data is a problem that could complicate data querying and
retrieving if it is not considered.
      </p>
      <p>As of the previous problem statement, the aim of this Ph.D. research
proposal is to advance on the linked open university context (LOU context) with
a proposal for the University of Informatics Sciences from Cuba, applying novel
techniques developed by the Semantic Web community and our lab to address
previous challenges. The importance of this problem statement is described as
follows in Section 2.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Importance</title>
      <p>
        Universities use LOD platforms to publish and access data about sta pro les,
courses, scholarly publications, and open educational resources[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Implementing
LOD can be summarized as using the web both as a channel to access data and,
as a platform for the representation and integration of data. Having university
linked datasets facilitates e ective reuse of data and increases the opportunities
to build more e ective, integrated, and innovative applications based on these
datasets[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. It is also a trend revealing the contributions and achievements of
the universities and making them visible on the Web as LOD as it is a means
to measure the university's reputation and standing among other international
universities and institutions[
        <xref ref-type="bibr" rid="ref10 ref9">10,9</xref>
        ].
      </p>
      <p>Advancing on the LOU context means resolving some existing issues with the
objective of improving current and future LOD platforms. Aiming at a uni ed
vocabulary (or group of them) entails to get better current semantic modeling
processes in order to select the better vocabularies/ontologies and extend them
if it is needed. Current knowledge globalization makes the standardized access
to resources further relevant in the LOU context than in any other one. Besides
the data itself, it is also signi cant to describe datasets in order to increase their
discoverability and interoperability on the web via associated metadata. Related
work about semantic modeling in the LOU context is described in Section 3.</p>
      <p>
        On the other hand, RDF datasets access and query in the LOU context are
extremely important for both, internal and external clients. A SPARQL endpoint
is the common interface to triple live queryable and its shortcomings are quite
well known[
        <xref ref-type="bibr" rid="ref13 ref7">13,7</xref>
        ]. To cope with the shortcomings of SPARQL endpoints, the
Semantic Web Community has created some technologies such as Triple Pattern
Fragment [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. To advance on the LOU context this proposal takes into account
these technologies along with common interfaces to query RDF triples. Related
work about dataset·s access and query in the LOU context is described in Section
3.
      </p>
      <p>Regarding incomplete data, the open word assumption of the Semantic Web
assumes incomplete information by default, and thus, the possibility of nding
missing facts contributes to dataset optimization. Related work about knowledge
graph completion in the LOU context is described as follows in Section 3.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Related work</title>
      <p>
        On the semantic modeling process, according to[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], the process to choose the
terms is based on the following process: i) identify the concept to be expressed;
ii) search for a widespread existing vocabulary to be used; iii) if found, use
it, otherwise iv) search for a less-known vocabulary to reuse; v) if not found,
create a new term. Moreover, according to [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] this process includes: i) listing
common data categories about university information; and ii) getting a summary
of useful vocabularies for describing university datasets. When it is necessary to
create new ontologies, methodologies such as Methontology can be taken into
consideration.
      </p>
      <p>Despite there has been a recent trend towards using the same vocabularies, in
the beginning, each platform used its own vocabularies/ontologies. For instance,
despite the fact that a course is the same in all universities, we can nd it
modeled both as a Teach: Course1 as well as an Aiiso: Course2. With the aim
of getting closer to a uni ed model, our proposal aims to use the most popular
vocabularies/ontologies of the state of the art, and thus, we de ne the rst
research question and hypothesis related to the semantic modeling process in
Section 4.</p>
      <p>
        Among the dataset metadata vocabularies, some notable ones are VoID3
used by most university platforms to describe datasets[
        <xref ref-type="bibr" rid="ref12 ref3 ref6">3,6,12</xref>
        ], the DataCube
1 http://linkedscience.org/teach/ns#Course
2 http://purl.org/vocab/aiiso/schema#Course
3 https://www.w3.org/TR/void/
vocabulary4 to describe datasets of multidimensional data, and the DCAT5, a
feasible way to standardize metadata for catalogs, datasets and data services.
In this research proposal, we de ne the second research question and hypothesis
related to dataset metadata vocabularies in Section 4.
      </p>
      <p>
        In regard to datasets access and query, the SPARQL language6 is the W3C
standard to express declarative queries over collections of RDF triples. There
are three common interfaces to RDF triples: Data dumps, SPARQL endpoints
and Linked Data documents [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. To cope with the shortcomings of SPARQL
endpoints, the Semantic Web Community has created some technologies, such as
Triple Pattern Fragments (TPFs), which divides the query processing between
clients and servers and allows to restrict the kinds of queries the client can send
to the server[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Linked Connections are an example of a customized query
interface for the consumption of open data in the Transportation area[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Linked
Connections implement HTTP content negotiation7[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Both, Linked
Connections and TPFs use vocabularies such as Hydra8 and Tree9 that contribute to
the automation of the client-server communication and facilitate the federated
queries[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. On the LOU platforms, to the best of our knowledge, customized
query interfaces of triples have not been implemented yet, publication and
consumption are mostly solved only via SPARQL endpoints. We de ne the third
research question and hypothesis related to datasets access and query in Section
4.
      </p>
      <p>
        Regarding incomplete data, given a Knowledge Graph G = (E; R; T ), where
E and R denote the set of entities and relations and T = (h; r; t)jh; t E; r R is
the set of triplets (facts), the task of Knowledge Graph Completion (KGC)
involves inferring missing facts based on the known facts[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Much research work
has been devoted to KGC. A common approach to carry out KGC has been
knowledge graph embeddings. Most knowledge graph embedding models only
use structure information in observed triple facts, nevertheless, advanced
techniques use other information besides facts such as entity types, relation paths,
textual descriptions, and logical rules [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. To advance on the LOU context,
our proposal aims at de ning a knowledge graph embedding model able to use
other information besides facts on the output university datasets. We de ne the
fourth research question and hypothesis related to knowledge graph completion
in Section 4.
4 https://www.w3.org/TR/vocab-data-cube/
5 http://www.w3.org/TR/vocab-dcat-2/
6 http://www.w3.org/tr/sparql11-query/
7 http://tools.ietf.org/html/rfc7231#section-5.3
8 http://www.hydra-cg.com/spec/latest/core/
9 https://treecg.github.io/speci cation/
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Research questions and hypotheses</title>
      <p>Regarding the lack of a uni ed, well-accepted vocabulary that satis es all
universities' requirements, we de ne the rst research question and hypothesis as
follow:</p>
      <p>Q1: How to contribute to having a uni ed, well-accepted vocabulary in the
LOU context?</p>
      <p>H1: If we use the most used vocabularies/ontologies or extend them in our
LOD platform, we contribute to having a uni ed, well-accepted vocabulary that
satis es all universities' requirements.</p>
      <p>Regarding dataset metadata vocabularies, we consider that advancing on the
LOU context means to advance on the automation of the client-server
communication, therefore we need a metadata vocabulary to allow client applications
to get resources easily. In this sense, we de ne the second research question and
hypothesis related to dataset metadata vocabularies as follows:</p>
      <p>Q2: How to support client applications getting resources easily in the LOU
context?</p>
      <p>H2: Using the DCAT vocabulary to describe dataset metadata, client
applications are able to easily get the resources in the LOU context.</p>
      <p>With regard to datasets access and query, to advance on the LOU context
means to incorporate novel approaches and technologies developed by the
Semantic Web Community along with common interfaces. Query interfaces
customized according to the client applications' needs can contribute to the
automation of the client-server communication. We de ne the third research question
and hypothesis related to datasets access and query as follows:</p>
      <p>Q3: Can query interfaces customized according to the client applications'
needs along with common interfaces improve datasets access and query in the
LOU context?</p>
      <p>H3: Query interfaces customized according to the client applications' needs
along with common interfaces can improve the datasets access and query in the
LOU context.</p>
      <p>Regarding the incompleteness of the datasets, we de ne the fourth research
question and hypothesis related to incomplete data in the LOU context as
follows:</p>
      <p>Q4: What kinds of information besides facts in the knowledge graph
embedding models produce an acceptable trade-o in the LOU context to predict
missing facts?</p>
      <p>H4: Integrating textual descriptions and logical rules besides facts in the
knowledge graph embedding models produces an acceptable trade-o in the LOU
context to predict missing facts.</p>
      <p>Considerations about how to test these previous hypotheses are described as
follows in Section 5.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Evaluation</title>
      <p>With the aim of nding out the most popular vocabularies/ontologies in the
LOU context and testing the hypothesis H1, we carried out a state-of-the-art
study. As outcomes, we found out: i) AIISO ontology10 is applied in most works
while other vocabularies such as Teach11 and Courseware include crucial terms
about university courses; ii) most works followed the principle of reusing existing
ontologies as much as possible, however, all of them had to extend these
vocabularies to ful ll their requirements; iii) general ontologies such as Dublin Core
Metadata Element Set, FOAF, W3C Basic Geo Vocabulary, and W3C Ontology
for Media Resources had a common usage along with the above vocabularies.</p>
      <p>Unlike existing LOD university platforms that have been using the VoID
vocabulary to describe their datasets, in our proposal, the DCAT vocabulary is
promoted for advancing in the LOU context because of its broader coverage than
other vocabularies like VoID. The explanation of the DCAT vocabulary usage
(H2 evaluation) is shown below along with the customized query interface.</p>
      <p>
        In order to evaluate the hypothesis H3, since all the state-of-the-art LOU
platforms include a course dataset, we developed a customized query interface for
the course dataset called coursesld server12. We do not aim at replacing common
triple interfaces, but using our proposal as a complementary query interface.
University course data are a special segment of open data at the university given
the public nature of the data[
        <xref ref-type="bibr" rid="ref10 ref12">12,10</xref>
        ]. With the increase of distance learning, there
are a lot of course recommender applications that assist clients to nd suitable
courses.
      </p>
      <p>Our LOD university platform publishes on its homepage the DCAT-catalog
le where course recommender applications can nd datasets about courses.
By accessing the dataset subject property, client applications can distinguish
one dataset among many other ones (as in this case, teach: Course is the wanted
subject). Additionally, by getting to the dataset distribution, clients know where
to retrieve the dataset (URL via distribution accessURL property) and how to
retrieve it ( le format via distribution mediaType property, e.g., in this case, one
of the four options: JSON-LD, Turtle, N-quads, CSV). In order to support the
automation of the client-server communication a Hydra API Documentation was
also de ned, which can be obtained via catalog-dataset-conformsTo property.</p>
      <p>Normally, course recommender applications ask for courses about one speci c
topic that start on a certain date. That is why, coursesld server interface o ers
the possibility of getting courses related to that topic sorted by the start date
via URL templates. To deal with memory requirements and advancing on the
data reuse, the interface splits the answer into fragments with no more than
100 courses per fragment. Course recommender applications are able to request
the server each fragment through the Tree/Hydra vocabulary without human
10 http://purl.org/vocab/aiiso/schema#
11 http://linkedscience.org/teach/ns#
12 https://github.com/yalopez84/coursesld server
intervention. To complete the hypothesis H3 evaluation, a client application was
developed called coursesld client13.</p>
      <p>In regard to the evaluation of the graph completion model (H4 evaluation), a
controlled experiment will be carried out. The tests will be rst on at least two
general knowledge graphs: DBpedia and Freebase, and then, on speci c LOU
datasets. Currently, the model is being developed.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Results</title>
      <p>
        Besides the vocabularies/ontologies found in the state-of-the-art study, we put
into consideration our semantic modeling process, which has bene ted from
previous works[
        <xref ref-type="bibr" rid="ref3 ref8">3,8</xref>
        ], and promotes the usage of the Linked Open Vocabularies
Initiative (LOV14) to look for terms/vocabularies. Regarding H1 evaluation, we
consider that it is true. If we look at the semantic model of our platform, we
see AIISO vocabulary to represent the university structure and Tech vocabulary
to describe the university course according to the tendency in the state of the
art. Each time a platform is developed following this principle, such a university
contributes to having a uni ed vocabulary or group of vocabularies in the LOU
context.
      </p>
      <p>Regarding the coursesld server interface (H3 evaluation), its e ectiveness is
appreciated as an additional service for the exploitation of linked datasets. Since
most developers are familiar with APIs with descriptions more than SPARQL
endpoints over the RDF format, customized interfaces like the one presented
in this work can serve to pave that issue. At the same time, we con rm the
hypothesis H2 as the DCAT vocabulary allows to advance on the customized
interfaces, federated queries, automation of client-server communication, and
therefore the DCAT vocabulary allows to advance in the LOU context.
7</p>
    </sec>
    <sec id="sec-7">
      <title>Re ection and future work</title>
      <p>Future work aims at continuing with this research. Some of the previous
hypotheses need further evaluation in order to reach the goal of this proposal: to
advance on the LOU context. Given the wide range of topics at the university
(research, academic programs, software production, internal places, energy and
water consumption, etc.), adding new datasets to the LOD platform allows us
to have a more complete knowledge graph. Afterward, we plan to extend the
solution to other universities and evaluate the research contributions beyond the
LOU context.</p>
    </sec>
    <sec id="sec-8">
      <title>Acknowledgments</title>
      <p>This research has been partially sponsored by VLIR-UOS Network University
Cooperation Programme - Cuba. Special thanks go to:
13 https://github.com/yalopez84/coursesld client
14 https://lov.linkeddata.es/dataset/lov/terms</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Colpaert</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Publishing transport data for maximum reuse</article-title>
          .
          <source>PhD Thesis</source>
          , Ghent University (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Colpaert</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Llaves</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verborgh</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corcho</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mannens</surname>
          </string-name>
          , E., Van de Walle, R.:
          <article-title>Intermodal public transit routing using liked connections</article-title>
          .
          <source>In: International Semantic Web Conference: Posters and Demos</source>
          . pp.
          <volume>1</volume>
          {
          <issue>5</issue>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Daga</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          , dAquin,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Adamou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Brown</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.:</surname>
          </string-name>
          <article-title>The open university linked data{data</article-title>
          . open. ac. uk.
          <source>Semantic Web</source>
          <volume>7</volume>
          (
          <issue>2</issue>
          ),
          <volume>183</volume>
          {
          <fpage>191</fpage>
          (
          <year>2016</year>
          ), publisher: IOS Press
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4. dAquin, M.:
          <article-title>Putting Linked Data to Use in a Large Higher-Education Organisation</article-title>
          . In: ILD@ ESWC. pp.
          <volume>9</volume>
          {
          <fpage>21</fpage>
          .
          <string-name>
            <surname>Citeseer</surname>
          </string-name>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5. dAquin,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Dietze</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          :
          <article-title>Open education: A growing, high impact area for linked open data</article-title>
          .
          <source>ERCIM News</source>
          ,(
          <volume>96</volume>
          ) (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6. Ke ler,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Kauppinen</surname>
          </string-name>
          ,
          <string-name>
            <surname>T.</surname>
          </string-name>
          :
          <article-title>Linked open data university of munster{infrastructure and applications</article-title>
          . In: Extended Semantic Web Conference. pp.
          <volume>447</volume>
          {
          <fpage>451</fpage>
          . Springer (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Khan</surname>
          </string-name>
          , H.:
          <article-title>Towards more intelligent SPARQL querying interfaces</article-title>
          .
          <source>In: International Semantic Web Conference</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Ma</surname>
          </string-name>
          , Y.,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bai</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Building linked open university data: Tsinghua university open data as a showcase</article-title>
          .
          <source>In: Joint International Semantic Technology Conference</source>
          . pp.
          <volume>385</volume>
          {
          <fpage>393</fpage>
          . Springer (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Meymandpour</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Davis</surname>
            ,
            <given-names>J.G.</given-names>
          </string-name>
          :
          <article-title>Ranking universities using linked open data</article-title>
          .
          <source>In: LDOW</source>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Nahhas</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bamasag</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khemakhem</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bajnaid</surname>
          </string-name>
          , N.:
          <article-title>Added values of linked data in education: A survey and roadmap</article-title>
          .
          <source>Computers</source>
          <volume>7</volume>
          (
          <issue>3</issue>
          ),
          <volume>45</volume>
          (
          <year>2018</year>
          ), publisher: Multidisciplinary Digital Publishing Institute
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vashishth</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sanyal</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Talukdar</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>A re-evaluation of knowledge graph completion methods</article-title>
          . arXiv preprint arXiv:
          <year>1911</year>
          .
          <volume>03903</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Szasz</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fleiner</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Micsik</surname>
            ,
            <given-names>A.:</given-names>
          </string-name>
          <article-title>A case study on Linked Data for University Courses</article-title>
          . In:
          <article-title>OTM Confederated International Conferences" On the Move to Meaningful Internet Systems"</article-title>
          . pp.
          <volume>265</volume>
          {
          <fpage>276</fpage>
          . Springer (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Verborgh</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Vander</given-names>
            <surname>Sande</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Hartig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            ,
            <surname>Van Herwegen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>De Vocht</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>De Meester</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Haesendonck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Colpaert</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          :
          <article-title>Triple Pattern Fragments: a lowcost knowledge graph interface for the Web</article-title>
          .
          <source>Journal of Web Semantics</source>
          <volume>37</volume>
          ,
          <issue>184</issue>
          {
          <fpage>206</fpage>
          (
          <year>2016</year>
          ), publisher: Elsevier
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mao</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Knowledge graph embedding: A survey of approaches and applications</article-title>
          .
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          <volume>29</volume>
          (
          <issue>12</issue>
          ),
          <volume>2724</volume>
          {
          <fpage>2743</fpage>
          (
          <year>2017</year>
          ), publisher: IEEE
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>