<!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>Bottom-Up Ontology Construction with Contento</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Enrico Daga</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mathieu d'Aquin</string-name>
          <email>mathieu.daquin@open.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Enrico Motta</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Aldo Gangemi</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Knowledge Media Institute, The Open University Walton Hall</institution>
          ,
          <addr-line>Milton Keynes</addr-line>
          ,
          <country country="UK">United Kingdom</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Universite Paris13, Sorbonne Cite CNRS UMR7030, France, and Istitute of Cognitive Sciences and Technologies - CNR Via S. Martino della Battaglia 44</institution>
          ,
          <addr-line>00185 Rome (RM)</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this demo paper we show an approach to build Semantic Web ontologies from sample linked data with a tool named Contento. Contento is a data driven ontology construction kit, based on Formal Concept Analysis (FCA). We show the exploration and analysis functionalities of Contento, as well as the method to generate, annotate and prune concept hierarchies. Moreover, we describe a procedure to go from sample data - extracted from SPARQL endpoints - to a new OWL ontology.</p>
      </abstract>
      <kwd-group>
        <kwd>Linked Data</kwd>
        <kwd>Formal Concept Analysis</kwd>
        <kwd>Ontology Design</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>In this demo paper we show an approach to build Semantic Web ontologies from
datasets in the Linked Data with a tool named Contento3. Contento is a data
driven ontology construction kit, based on Formal Concept Analysis (FCA).
With Contento, users can build the input data (objects and attributes) from
scratch or import them from existing datasets, for example querying Linked
Data endpoints. We show how to go from sample data to a complete OWL
ontology in four steps: (1) extract data from one (or more) SPARQL endpoints;
(2) generate a FCA lattice; (3) annotate and prune the conceptual lattice; (4)
generate the OWL ontology.</p>
      <sec id="sec-1-1">
        <title>3 http://bit.ly/contento-tool</title>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>The Contento Way</title>
      <p>Contento4 has been developed to create, populate and curate FCA formal
contexts and associated lattices, also interpreted as taxonomies of concepts.</p>
      <sec id="sec-2-1">
        <title>Step 1. Extract data from SPARQL endpoints.</title>
        <p>Formal contexts can be created and populated from scratch. With this interface,
the binary matrix can be populated or supervised to constitute a proper input
for a FCA algorithm. In many cases, however, a ready made binary matrix can
be imported from pre-existing data, for example as output of a query to a Linked
Data SPARQL endpoint like http://data.open.ac.uk/sparql:
SELECT distinct ?object ?attribute ("1" as ?holds)</p>
        <p>FROM &lt;http://data.open.ac.uk/context/xcri&gt;</p>
        <p>WHERE {
?object a &lt;http://data.open.ac.uk/ontology/Qualification&gt; ;
&lt;http://purl.org/dc/elements/1.1/subject&gt; ?attribute
}
The above query will report about the topics of quali cations under presentation
at The Open University. The output of this query, requested as CSV le, can
be used to feed Contento using the context import procedure. Figure 1 shows
the facilities o ered by the context browser. In this case the formal context is
created directly from that, ready to be used to generate the concept lattice with
the procedure provided.</p>
        <sec id="sec-2-1-1">
          <title>4 http://bit.ly/contento-tool</title>
          <p>Bottom-Up Ontology Construction with Contento</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Step 2. Generate a FCA lattice.</title>
        <p>
          Contento implements the Chein algorithm [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] to compute concept lattices. The
result of the algorithm is stored as a taxonomy. A taxonomy can be navigated
as an ordered list of concepts, from the top to the bottom, each of them
including the extent, the intent and links to upper and lower concept bounds in the
hierarchy.In addition, the tool shows which objects and attributes are proper to
the concept, i.e. do not exist in any of the upper (for attributes) or lower (for
objects) concepts.
        </p>
        <p>Moreover, it can be visualized and explored as a concept lattice (Figure 2).
The lattice can be navigated by clicking the nodes. Focusing on a single node,
the respective upper and lower branches are highlighted, to facilitate the
navigation to the user. Similarly, objects and attributes from the focused node can be
selected, thus highlighting all nodes in the hierarchy sharing all of the selected
features (in orange in Figure 2).</p>
      </sec>
      <sec id="sec-2-3">
        <title>Step 3. Annotate and prune the conceptual lattice</title>
        <p>Contento supports the user on the curation of the concept hierarchy, supporting
annotation of concepts with label and comment, and the pruning of unwanted
concepts. This last operation implies an adjustment of the hierarchy, by building
links between lower and upper bounds of the deleted node (only if no other path
to the counterpart exists). As a result, relevant concepts can be quali ed, and
concepts that are not relevant for the task at end can be removed.</p>
      </sec>
      <sec id="sec-2-4">
        <title>Step 4. Generate the OWL ontology</title>
        <p>The data of the FCA lattice can then be translated into OWL using prede ned
or custom pro les. The user can decide how to represent the taxonomy in RDF,
what terms to use to link concepts, objects and attributes, and whether items
need to be represented as URIs or literals. For example, Contento o ers a
default pro le, using example terms, or a SKOS pro le. Ultimately, these export
con gurations can be shared and reused.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Related work</title>
      <p>
        Bottom-up approaches for ontology design have been commonly applied in
knowledge engineering [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and we use here one particular method based on Formal
Concept Analysis (FCA) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. FCA has been proposed in the past to support
ontology design and other ontology engineering tasks [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ]. Recently, we used
Contento to support the design of the License Picker Ontology (LiPiO) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. In
this demo we show how to use FCA as a learning technique to boost the early
stage of the ontology design.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Michel</given-names>
            <surname>Chein</surname>
          </string-name>
          .
          <article-title>Algorithme de recherche des sous-matrices premieres dune matrice</article-title>
          .
          <source>Bull. Math. Soc. Sci. Math. RS Roumanie</source>
          ,
          <volume>13</volume>
          (
          <issue>61</issue>
          ):
          <volume>21</volume>
          {
          <fpage>25</fpage>
          ,
          <year>1969</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Paul E Van Der</surname>
          </string-name>
          <article-title>Vet and Nicolaas JI Mars</article-title>
          .
          <article-title>Bottom-up construction of ontologies. Knowledge and Data Engineering</article-title>
          , IEEE Transactions on,
          <volume>10</volume>
          (
          <issue>4</issue>
          ):
          <volume>513</volume>
          {
          <fpage>526</fpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Bernhard</given-names>
            <surname>Ganter</surname>
          </string-name>
          , Gerd Stumme, and Rudolf Wille, editors.
          <source>Formal Concept Analysis, Foundations and Applications</source>
          , volume
          <volume>3626</volume>
          of Lecture Notes in Computer Science. Springer,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Philipp</given-names>
            <surname>Cimiano</surname>
          </string-name>
          , Andreas Hotho, Gerd Stumme, and
          <string-name>
            <given-names>Julien</given-names>
            <surname>Tane</surname>
          </string-name>
          .
          <article-title>Conceptual knowledge processing with formal concept analysis and ontologies</article-title>
          .
          <source>In Concept Lattices</source>
          , pages
          <volume>189</volume>
          {
          <fpage>207</fpage>
          . Springer,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Marek</given-names>
            <surname>Obitko</surname>
          </string-name>
          , Vaclav Snasel, Jan Smid, and
          <string-name>
            <given-names>V</given-names>
            <surname>Snasel</surname>
          </string-name>
          .
          <article-title>Ontology design with formal concept analysis</article-title>
          .
          <source>In CLA</source>
          , volume
          <volume>110</volume>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Enrico</given-names>
            <surname>Daga</surname>
          </string-name>
          , Mathieu d'Aquin,
          <string-name>
            <given-names>Aldo</given-names>
            <surname>Gangemi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Enrico</given-names>
            <surname>Motta</surname>
          </string-name>
          .
          <article-title>A bottom-up approach for licences classi cation and selection</article-title>
          .
          <source>In Serena Villata and Silvio Peroni</source>
          , editors,
          <source>Proc. of the International Workshop on Legal Domain</source>
          And
          <string-name>
            <surname>Semantic Web Applications (LeDA-SWAn</surname>
          </string-name>
          )
          <article-title>held during the 12th Extended Semantic Web Conference (ESWC</article-title>
          <year>2015</year>
          ), pages
          <fpage>33</fpage>
          {
          <fpage>40</fpage>
          . ACM,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>