<!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>Connecting the Dots in Million-Nodes Knowledge Graphs with SemSpect</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Thorsten Liebig</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vincent Vialard</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michael Opitz</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>derivo GmbH</institution>
          ,
          <addr-line>Ulm</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Knowledge Graphs are becoming more common within industrial and scientific applications. Field experience with our customers have revealed that existing graph visualization and querying tools fail to adequately support users in understanding and querying real-world datasets. We present SemSpect, a solution that enables users to visualize, interactively explore and easily retrieve answers to sophisticated request from large RDF/OWL knowledge graphs without being fluent in a query language. The demo will showcase its usage with various datasets such as SpringerNature's SciGraph1, the Panama Papers2 or legislative open data from GovTrack.us3 and invites attendees to gain insight into the data by hands on experience.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Analyzing and utilizing the content of large Knowledge Graphs is challenging. A
proper SPARQL query can deliver some insight when the basic structure of the
data and the request idea is known to the questioner. But how to proceed when
facing complex, cross-linked data pools or when the insightful queries are not
transparent because of a lack of the big picture? For instance, how to identify
the real beneficial owners of an offshore entity within the Panama Papers whose
shares ownership are intentionally blurred without knowing the obfuscation
patterns?</p>
      <p>
        Typical visualization approaches and query interfaces fall short to provide
real support for exploring large unknown datasets. The usual graph visualization
tools are cumbersome as soon as the number of vertices and their connection
degree rises. Textual, form-based or graphical query interfaces are not well suited
for the trial and error process inherent to exploratory tasks. Faceted search tools
like Sparklis [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] or SemFacet [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] avoid requests that return no results by offering
selections supported by the data, but the view on the data is limited on the
current focus and bears the risk for users to lose the plot. Furthermore, the linear or
tabular presentation of the results make their interpretation laborious. Another
approach is followed by VisualRDF [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] which proposes a graphical aggregated
1 Springer Nature SciGraph, 2017. http://www.springernature.com/scigraph
2 ICIJ Offshore Leaks Database, 2016. https://offshoreleaks.icij.org
3 United States legislation data, GovTrack, 2016. https://www.govtrack.us/
overview with some drill down possibilities, but it is restricted to a meta level
summary and does not provide access the actual objects.
      </p>
      <p>SemSpect is a tool that enables even domain or query novices to carry out
sophisticated research by interacting with a visual representation of the data.
One unique feature is the aggregated tree-like overview of the relations between
groups of objects built step by step by the user. This interaction, guided by the
data as well as by the data model, makes the relations between the different
categories of objects within the graph tangible. At the same time the quantity of
displayed information is reduced. Details of particular objects, group of objects
or their relations are displayed only on user demand.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Overview First – Details on Demand</title>
      <p>Let us consider the SpringerNature SciGraph dataset4 that contains data about
scientific articles, journals, authors, institutions and grants as well as their links.
For the year 2016 the dataset comprises some three million data objects (53
million triples after inferencing). What is the basic structure of the graph? How
are the data objects connected with objects of other categories? In SemSpect
the 351k articles of 2016 are visually depicted as a group that lists its related
categories and their relationships on double click.
When a relationship is selected from the exploration menu, a branch is added
to the exploration tree showing the related objects. Note that in contrast to
common graph renderings, SemSpect aggregates objects and relations. Individual
data objects – here the research fields – are shown as dots within a group only
when their number is below an adjustable threshold. A number in a dot of an
object indicates the number of related objects in the preceding group.
4 The SN SciGraph schema and data is available in N-Triples format and can be loaded
into SemSpect right away. As key partner of SN’s SciGraph initiative, we enriched
the model with facets for the core categories.</p>
      <p>Connecting the Dots in Million-Nodes Knowledge Graphs with SemSpect</p>
      <p>Pointing at an object highlights the objects from the other groups that are
related to it. Selecting an object displays its attributes in a dedicated side panel
on the right. Selecting a group displays statistical information about the class
membership of its objects within this side panel (this information can be
structured in independent facets by annotating the model accordingly). A tabular
view is available on demand for listing the values of the attributes of the objects
of a group or for listing all the object pairs of two connected groups and their
relations.</p>
      <p>In order to focus on objects with specific properties, each object group of
the exploration graph can be filtered using the predefined classification as well
as using the values of the attributes of its objects. For instance, to find the top
journals and grants related to articles about cancer in SciGraph, start with the
subjects, restrict them to those whose description contain ’cancer’ in the tabular
view and expand this group to journals and grant via articles (Fig. 2).
These functionalities coupled with the possibility to store an exploration
for later usage enables the creation of an equivalent to complex parameterized
queries. Moreover, each object group obtained during an exploration can be
used to define a new category (defined by the implicit request used to obtain the
group). The user can therefore step by step build his personalized exploration
toolbox.</p>
    </sec>
    <sec id="sec-3">
      <title>Technical Details of SemSpect</title>
      <p>
        SemSpect is a client-server application with a HTML5/JavaScript UI5 and a Java
REST backend. It is able to process knowledge graphs formalized according to
RDF or OWL – W3C’s ontology languages. The reasoning and request processing
engine is our GraphScale [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] system with a Neo4j6 graph database as storage
component in the present case.
      </p>
      <p>The apparent simplicity of the aggregated exploration graph used by
SemSpect comes with high requirements on the request processing engine. Indeed,
the query for retrieving the objects of a group gets more complex the further
the group is from the root and many informations such as predecessor count and
category membership have to be aggregated. Moreover, in order to build the
exploration menu of each group, the list of all reachable object categories with
their specific relation types must be collected. As each group can be filtered at
any time, and as this filtering propagates down the tree, this retrieval has to be
processed at run time for each updated group.</p>
      <p>
        In order to achieve an acceptable performance at the million objects scale,
SemSpect relies on the patented technology used in GraphScale [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] based on a
condensed version of the original data called abstraction that is small enough to
fit in memory. The abstraction contains only partial information but it allows
for a significant reduction of the lookups at the actual data in the store.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Demo Description</title>
      <p>This demo will showcase the visualization and exploration features of
SemSpect with the help of variety of hand-on sample data sets such as
SpringerNatures SciGraph (http://scigraph.semspect.de), the Panama Papers (http:
//panama.semspect.de) or GovTrack (http://govtrack.semspect.de).
Futhermore, we will provide information about the system architecture, underlying
technology and the type of application domains where SemSpect is already
deployed or can be beneficial.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Sébastien</given-names>
            <surname>Ferré</surname>
          </string-name>
          .
          <article-title>SPARKLIS: a SPARQL Endpoint Explorer for Expressive Question Answering</article-title>
          .
          <source>Proceedings of the ISWC 2014 Posters &amp; Demonstrations Track.</source>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>B.</given-names>
            <surname>Cuenca Grau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Kharlamov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Marciuska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zheleznyakov</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. Arenas.</surname>
          </string-name>
          <article-title>SemFacet: Faceted Search over Ontology Enhanced Knowledge Graphs</article-title>
          .
          <source>Proceedings of the ISWC 2016 Posters &amp; Demonstrations Track.</source>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>F.</given-names>
            <surname>Florenzano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Parra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. L.</given-names>
            <surname>Reutter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Venegas</surname>
          </string-name>
          .
          <article-title>An Interactive Visualisation for RDF Data</article-title>
          .
          <source>Proceedings of the ISWC 2016 Posters &amp; Demonstrations Track.</source>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>T.</given-names>
            <surname>Liebig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vialard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Opitz</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. Metzl.</surname>
          </string-name>
          <article-title>GraphScale: Adding Expressive Reasoning to Semantic Data Stores</article-title>
          .
          <source>Proceedings of the ISWC 2015 Posters &amp; Demonstrations Track.</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>