<!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>Intelligent Nudging to Support Interactive Exploration of Big Data Graphs</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Marwan Al-Tawil</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Computing, University of Leeds</institution>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This research investigates how to support the user exploration through big data graphs. Current successful approaches to interactive exploration take into account the utility from a user's point of view. In this PhD, we are focusing on knowledge utility how useful the trajectories in a data graph are for expanding user's domain knowledge. The main goal of this research is to design intelligent nudging techniques to direct the user to 'good' trajectories for knowledge expansion. Our earlier work investigating empirical nudging strategies for users exploration, suggests that paths which start with familiar and highly inclusive entities and bring something unfamiliar are likely to increase the learning effect of users exploration. This direct us to investigate subsumption theory for meaningful learning and adopt it as our underpinning theoretical model to generate good trajectories, where familiar and highly inclusive entities are used as knowledge anchors to bring and learn new knowledge. This calls for developing an automatic approach to identify knowledge anchors in a data graph. We follow an analogy with basic level objects in domain taxonomies that underpin our automated approach for identifying knowledge anchors. Several metrics for extracting knowledge anchors in a data graph are developed and examined.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Big Data graphs</kwd>
        <kwd>interactive exploration</kwd>
        <kwd>knowledge utility</kwd>
        <kwd>knowledge anchors</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION AND MOTIVATION</title>
      <p>
        With the emergence and the growing rates of RDF Linked Data
graphs, many applications take advantage of the exploration of the
knowledge encoded in the graphs to support users’ interactive
exploration [
        <xref ref-type="bibr" rid="ref17 ref3 ref4">3, 4, 17</xref>
        ]. Consequently, more and more big data
graphs are being exposed to users for exploratory search tasks
such as learning or investigating, where the users usually discover
new connections and associations [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Layman users who are
engaged in exploratory search sessions will usually have no (or
limited) familiarity with the specific domain and little (or no)
awareness of the encoded knowledge in the graph. In other words,
the users’ cognitive structures about the domain may not match
the semantic structure of the data graph. This can provide major
obstacles to interactive exploration, especially when the users
need to learn new things, resulting into confusion and frustration.
This research aims to support users' interactive exploration in big
data graphs through directing the users to trajectories that can
bring some benefit (utility) for the users (e.g. efficiency,
effectiveness, motivation, knowledge expansion) [
        <xref ref-type="bibr" rid="ref12 ref19">12, 19</xref>
        ].
Specifically, we focus on knowledge utility – how useful a
trajectory in a data graph is to expand one’s knowledge in the
domain. Earlier research has acknowledged that data graph
exploration can promote expansion of domain knowledge through
serendipitous learning (e.g. users discover concepts or
relationships they were unaware of) [
        <xref ref-type="bibr" rid="ref15 ref5">5, 15</xref>
        ]. However, not all
paths are beneficial for knowledge expansion, and ways for
identifying ‘good’ trajectories are required.
      </p>
      <p>
        Identifying good trajectories in a data graph requires anchoring
entities that serve as knowledge bridges to learn new things.
Our earlier work has acknowledged that when the user explores
familiar entities, nudging should direct the user to explore
something new [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. This calls to investigate the subsumption
theory for meaningful learning [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. According to this theory, to
incorporate new knowledge, the most familiar and inclusive
entities in the user’s cognition are used as knowledge anchors to
subsume and learn new knowledge. Subsequently the new
knowledge can take on meaning by becoming anchored with
the basic concepts in the user’s cognitive structures.
However, identifying knowledge anchors in big data graphs is not
a trivial task and brings forth various research challenges,
including: dealing with larger number of entities, from 100s of
entities in a typical ontology versus millions of entities in a typical
data graph, and the need to exploit large number of data instances
in the data graph.
      </p>
      <p>
        The broader challenge of this PhD is: to design intelligent
nudging techniques to direct the user to ‘good’ trajectories
through big data graphs for knowledge expansion. To meet this
challenge, we address two research questions:
Question 1: How to develop automatic ways to identify data
graph entities that provide knowledge anchors for navigation
paths? This question can be seen as focusing on the Cognitive
Science notion of basic level objects1 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], to develop metrics to
automatically identify knowledge anchors in a data graph.
Question 2: How can we use knowledge anchors in a data graph
to design navigation paths for expanding users domain
knowledge? In the second question, subsumption theories will be
adopted to nudge the user through navigation paths. We aim to
maximize the serendipitous learning through bringing the users
first to the anchoring entities and then direct them to new and
interesting concepts at different levels of abstraction in the graph.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. RELATED WORK</title>
      <p>
        Recent research on exploratory search through linked data graphs
has been examining different ways to provide intelligent support
for users’ navigation. This has brought together research from the
1 The term “basic level objects” has been used in Cognitive Science. Other
developments, e.g. Formal Concept Analysts, call them “concepts.
Semantic Web, personalization, HCI and Cognitive Science to
shape novel tools for interactive exploration of semantic data [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
Work on personalized exploration includes improving search
efficiency by considering user interests [
        <xref ref-type="bibr" rid="ref17 ref8 ref9">8, 9, 17</xref>
        ] or diversifying
the user exploration paths with recommendations based on the
browsing history [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Extracting semantic patterns from linked
data sources to improve diversity in recommendation results to
users has been proposed in [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. Diversity is measured based on
the semantic distance of topics and genres of the results. The work
in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] presents an approach to rank RDF statements with the
expectation that some statements will be more valuable or
interesting to users than other statements within some context.
A wide range of tools for offering interactive exploration using
linked data technologies can be found in a recent survey [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
Our work brings a new dimension to this research stream by
looking at the knowledge utility of the exploration path. We
hypothesize that the cognitive learning theory of ‘meaningful
learning’ [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] can be used to design paths with high knowledge
utility, where new knowledge is subsumed under familiar and
highly inclusive abstract entities. To identify knowledge anchors
in a data graph, we operationalize the notion of basic level objects
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. The problem of extracting important concepts from
information spaces using the notion of basic level objects has
been tackled by two approaches, ontology summarization [
        <xref ref-type="bibr" rid="ref11 ref2">2, 11</xref>
        ]
and in Formal Concept Analysis (FCA) [
        <xref ref-type="bibr" rid="ref22 ref23">22, 23</xref>
        ]. These
approaches utilize basic level objects with the aim of identifying
key concepts to help domain experts in understanding and
reengineering of an ontology or a concept lattice respectively.
In our work, we apply the notion of basic level objects in a data
graph to identify anchoring entities which are likely to be familiar
to layman users who are not domain experts. The formal
framework that maps Rosch’s definitions of basic level objects
and cue validity [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] to data graphs is a major contribution of our
work. We are unique in our use for these anchoring entities to
support interactive exploration of a data graph.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. PROPOSED APPROACH</title>
      <p>
        We follow two approaches to address the two research questions
in this work, respectively:
1. Develop automatic ways to identify data graph entities that
can be used as knowledge anchors for navigation paths. We
achieve this objective by adopting the notion of basic level
objects which was introduced in Cognitive Science research
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], illustrating that domain taxonomies include category
objects which are at the basic level of abstraction. Basic level
categories “carry the most information, possess the highest
category cue validity, and are, thus, the most differentiated
from one another” [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. We adopt two approaches to identify
knowledge anchors: distinctiveness approach, that is based on
the formal definition of cue validity, to identify the most
differentiated basic categories whose attributes are associated
amongst the category members but are not associated to
members of other categories; and homogeneity approach to
identify basic categories whose members share many
attributes together. The homogeneity approach is
complementary with the distinctiveness feature. A basic
category object with high cue validity will have high number
of entities common to its members.
2. Develop navigation paths using knowledge anchors. To
achieve this objective we adopt subsumption strategies for
meaningful learning [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Two subsumption strategies, the
subordinate and the super-ordinate strategies, will be used
[
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]. On the one hand, subordinate strategy can be used to
direct the user to explore unfamiliar members linked to
anchoring entities in the data graph (i.e. nudge to explore
subclass entities of an anchor). n the other hand, the
super-ordinate strategy will be used when the anchoring
entities are members of new unfamiliar and more inclusive
entities (i.e. nudge to explore superclass entities of an anchor).
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. CURRENT OUTCOMES</title>
      <p>
        We formally describe and implement the metrics and the
corresponding algorithms for identifying knowledge anchors [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
The metrics were implemented by running SPARQL queries over
the MusicPinta data graph stored in a triplestore [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. The
performance of the algorithms is examined using benchmarking
sets with basic level entities identified by humans, corresponding
to the cognitive structures humans form on the part of the world
represented in the data graph. A free-naming tasks based user
study in the music domain using the MusicPinta data graph, was
carried out to identify the benchmarking sets. This resulted in two
such benchmarking sets, StrongAnchors set that includes entities
closest to the human cognitive structures, and WeakAnchors set
that includes entities people are likely to recognize when they are
on the lower level abstraction in the graph. Based on quantitative
and qualitative analysis, the strengths and limitations of each
metrics are assessed, and a hybridization approach is proposed.
      </p>
    </sec>
    <sec id="sec-5">
      <title>5. CONCLUSION AND FUTURE WORK</title>
      <p>Interactive data exploration is becoming a key daily life activity.
It involves exploring large amount of data and deciding where to
go next in the graph. The success of big data graphs to support
interactive exploration brings forth the challenge of building
intelligent approaches to nudge the user through beneficial paths
with high knowledge utility. This emphasizes the importance of
identifying anchoring entities in the graph that can be used to
subsume and learn new knowledge.</p>
      <p>
        Moving forward, The immediate future work is to apply the
metrics for identifying knowledge anchors in another domain. The
INSPIRE2 data graph about career options will be used to identify
anchoring career points, that can be used in assisting the users in
identifying paths that will be beneficial for expanding their
awareness of their career options, including short or longer-term
career paths. In the long run, we aim to develop nudging
techniques using the subsumption strategies. An initial probing
algorithm can be used to identify users familiarity [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] (i.e. use
knowledge anchors to identify new or interesting entities for the
users). Another option is to have a quick probing at every
knowledge anchor during the exploration. A user study will be
conducted to evaluate the navigation strategies. Random paths
will be our base-line for evaluating the navigation strategies.
The impact of this work is not limited to support data graph
exploration. It can be also applied to ontology summarization,
where anchoring entities allow capturing a lay person’s view of
the domain. Also, knowledge anchors can be used to initiate
a dialog to solve the ‘cold start' problem in personalization
and adaptation.
2 INSPIRE is a system under development in Birkbeck, University of
London, about career guidance domain, particularly career transitions.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Marwan</given-names>
            <surname>Al-Tawil</surname>
          </string-name>
          , Vania Dimitrova, Dhavalkumar Thakker and
          <string-name>
            <given-names>Brandon</given-names>
            <surname>Bennett</surname>
          </string-name>
          .
          <article-title>Identifying Knowledge Anchors in a Data Graph</article-title>
          . In HT2016, Halifax, Canada.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Troullinou</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kondylakis</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Daskalaki</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Plexousakis</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          RDF Digest:
          <article-title>Efficient Summarization of RDF/S KBs</article-title>
          . In ESWC,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Popov</surname>
            ,
            <given-names>I.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schraefel</surname>
          </string-name>
          , Connecting the Dots:
          <article-title>A exploration</article-title>
          .
          <source>In ISWC</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Thellmann</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Galkin</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Orlandi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Auer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <article-title>LinkDaViz - Automatic Binding of Linked Data to Visualizations</article-title>
          . In ISWC,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Thakker</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dimitrova</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lau</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang-Turner</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Despotakis</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <article-title>Assisting User Browsing over Linked Data: Requirements Elicitation with a User Study</article-title>
          .
          <source>In ICWE 2013</source>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Ausubel</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <article-title>A Subsumption Theory of Meaningful Verbal Learning and Retention</article-title>
          .
          <source>In Journal of General Psychology</source>
          . Volume
          <volume>66</volume>
          ,
          <string-name>
            <surname>Issue</surname>
            <given-names>2</given-names>
          </string-name>
          ,
          <year>1962</year>
          , pp.
          <fpage>213</fpage>
          -
          <lpage>224</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Rosch</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mervis</surname>
            ,
            <given-names>C. B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gray</surname>
            ,
            <given-names>W. D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Johnson</surname>
            ,
            <given-names>D. M.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Boyes-Braem</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <article-title>Basic objects in natural categories</article-title>
          .
          <source>Cognitive Psychology</source>
          ,
          <year>1976</year>
          ,
          <volume>8</volume>
          ,
          <fpage>382</fpage>
          -
          <lpage>439</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Sah</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Wade</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <article-title>Personalized Concept-based Search and Exploration on the Web of Data using Results Categorization</article-title>
          .
          <source>In ESWC</source>
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Rossel</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <article-title>Implemention of a “search and browse” scenario for the LinkedData</article-title>
          . In IESD,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Vocht1</surname>
          </string-name>
          , et, al. A
          <article-title>Visual Exploration Workflow as Enablerfor the Exploitation of Linked Open Data</article-title>
          .
          <source>In IESD</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Peroni</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Motta</surname>
          </string-name>
          , E.,
          <string-name>
            <surname>d'Aquin</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Identifying key concepts in an ontology through the integration of cognitive principles with statistical and topological measures</article-title>
          .
          <source>In ASWC</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Marie</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gandon</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <article-title>Survey of linked data based exploration</article-title>
          .
          <source>In IESD@ISWC2014.</source>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Basu</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carterette</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Partridge</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Hendler</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <article-title>What to Send First? A Study of Utility in the Semantic Web</article-title>
          .
          <source>In (LHD+SemQuant)</source>
          ,
          <year>2012</year>
          , @
          <fpage>ISWC2012</fpage>
          ..
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Waitelonis</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Knuth</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wolf</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hercher</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Sack</surname>
          </string-name>
          .
          <article-title>The Path is the Destination-Enabling a New Search Paradigm with Linked Data</article-title>
          .
          <source>In LD in the Future Internet @ Future Internet Assembly</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Al-Tawil</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thakker</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Dimitrova</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <article-title>Nudging to Expand User's Domain Knowledge while Exploring Linked Data</article-title>
          .
          <source>In (IESD)</source>
          ,
          <year>2014</year>
          , @
          <fpage>ISWC2014</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Tanaka</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Taylor</surname>
          </string-name>
          , M.
          <article-title>Object Categories and Expertise: Is the Basic Level in the Eye of the Beholder?</article-title>
          <source>Cognitive Psychology</source>
          ,
          <year>1991</year>
          ,
          <volume>23</volume>
          , pp
          <fpage>457</fpage>
          -
          <lpage>482</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Marie</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corby</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gandon</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Ribiere</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Composite interests' exploration thanks to on-the-fly linked data spreading activation</article-title>
          .
          <source>In Hypertext</source>
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Maccatrozzo</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aroyo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Robert</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <article-title>Crowdsourced Evaluation of Semantic Patterns for Recommen-dations</article-title>
          .
          <source>In UMAP 2013. LBR.</source>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Nunes</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schwabe</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <article-title>Exploration of Semi-Structured Data Sources</article-title>
          .
          <source>In (IESD)</source>
          ,
          <year>2014</year>
          , @
          <fpage>ISWC2014</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Al-Tawil</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dimitrova</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thakker</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <article-title>Using Basic Level Concepts in a Linked Data Graph to Detect User's Domain Familiarity</article-title>
          . In UMAP2015, Dublin, Ireland.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Thakker</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Despotakis</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dimitrova</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lau</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brna</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          (
          <year>2012</year>
          ).
          <article-title>Taming digital traces for informal learning: A semantic-driven approach</article-title>
          .
          <source>In Proceedings of EC-TEL</source>
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Belohlavek</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trnecka</surname>
            ,
            <given-names>M. Basic</given-names>
          </string-name>
          <article-title>Level in Formal Concept Analysis: Interesting Concepts and Psychological Ramifications</article-title>
          .
          <source>In IJCAI</source>
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Belohlavek</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trnecka</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Basic level of concepts in formal concept analysis</article-title>
          .
          <source>In ICFCA</source>
          ,
          <year>2012</year>
          , pp
          <fpage>28</fpage>
          -
          <lpage>44</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Ausubel</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Novak</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hasian</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Educational</surname>
          </string-name>
          <article-title>Psychology: a cognitive view - Rinehart Winston</article-title>
          , New York,
          <year>1978</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>