<!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>Lion's Den</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mohamed Ahmed Sherif</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mofeed M. Hassan</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tommaso Soru</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Axel-Cyrille Ngonga Ngomo</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jens Lehmann</string-name>
          <email>lehmanng@informatik.uni-leipzig.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, University of Leipzig</institution>
          ,
          <addr-line>04109 Leipzig</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Introduction Over the last years, several tools have been developed with the aim of e ciently supporting the link discovery process [5,7]. This process consisting of two steps: (1) Discovering a Link Specifications (LS) for retrieving high-quality links (i.e. achieve high precision and recall). (2) Carry out the LS to compute the actual links. Several frameworks such as LIMES [3] and SILK [1] have been developed to create such links between the di erent knowledge bases (KB). While the importance of links between datasets is unequivocal, only few e orts have aimed at making LS available. Such a link repository would however enable a large number of applications, including transfer learning for LS, the provision of provenance and justification information for links, fuzzy inferences on Linked data sets and many more. The importance of links is further underlined by the community e orts have already led to the creation of link repositories such as LinkLion and sameAs.org. In view of the dispersed availability of LS in di erent formats (scripts, XML, RDF), we created Lion's Den as a companion project to LinkLion. LinkLion is a store for the publication, retrieval and use of links between KB. The portal provides functionality for the upload and the storage of discovered links, as well as meta-information about these links. With Lion's Den, we introduce an extension of such meta-information by letting the portal user upload files describing LS. We published the Lion's Den dataset on the LinkLion link discovery portal so as to make them accessible and queryable via a SPARQL endpoint.1. The Lion's Den Dataset The dataset is now hosted within the LinkLion project at http://linklion.org. Currently, Lion's Den contains 436 LS that are described by 15 457 triples including the ontology. Metadata on the Lion's Den dataset is available on DataHub.2 Ontology To represent the LS in RDF and OWL, we developed the Lion's Den vocabulary dubbed LDEN3. LDEN was specified with the aim of supporting any type of LS regardless of the way it was created. in its current version, LDEN contains a set of ten classes. Each LS is an instance of the LinkSpecs class. The LinkSpecs class provides properties that allow referencing the five basic components of any LS which are the source and target datasets, the metric used for linking as well as the acceptance 1 for more details see the extended paper in the project web site https://svn.aksw.org/ papers/2016/ISWC_OM_LionDen/public.pdf 2 http://datahub.io/dataset/lionsden 3 http://www.linklion.org/lden/</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>and reviewing criteria. In addition, the LinkSpecs class provides metadata such as the
source LS’s URL and creator, publisher, license and provenance information. Currently,
our ontology contains three classes derived from the LinkSpecs class (LimesSpecs,
SilkSpecs and ScriptSpecs), where each of the three classed contains special
attributes related to the framework it represents.</p>
      <p>Data Sources Lion’s Den original LS were collected from four di erent sources: (1)
The LATC project provides the interlinking 24/7 Platform4. (2) LinkedGeoData5 is a
project to convert spatial information provided by OpenStreetMap to the Web of Data.
(3) DBpedia-links6 is a repository that contains links, LS and link extraction scripts. (4)
The Limes7 Link discovery framework supports manual configuration for linking tasks
through XML based specification files.</p>
      <p>Conversion Process As the original configuration files for both SILK and LIMES were
in XML format, we built a specialized XML to RDF converter for each of them. The
source code of the dataset converters is available at the project repository8.
Provenance The LinkLion dataset reuses properties and classes from the PROV W3C
recommendation9 to keep track of data provenance.</p>
      <p>
        Use Cases Having the LS of Lion’s Den together with the links of LinkLion in a
machine readable format and serving them from one portal o ers a lot of opportunities,
including, but not limited to: benchmarking link discovery algorithms, automatic linked
data enrichment [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], key discovery [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], unification of LS, LS tansfer learning [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] and
Link Discovery over n Knowledge Bases [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
4 https://www.assembla.com/wiki/show/silk/Link_Specification_Language
5 http://linkedgeodata.org/
6 https://github.com/dbpedia/dbpedia-links/
7 https://github.com/AKSW/LIMES
8 https://github.com/AKSW/LionDen
9 http://www.w3.org/ns/prov#
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>R.</given-names>
            <surname>Isele</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jentzsch</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Bizer</surname>
          </string-name>
          .
          <article-title>E cient Multidimensional Blocking for Link Discovery without losing Recall</article-title>
          . In WebDB,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>A</surname>
          </string-name>
          .
          <string-name>
            <surname>-C. N. Ngomo</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Lehmann</surname>
            , and
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Hassan</surname>
          </string-name>
          .
          <article-title>Transfer learning of link specifications</article-title>
          .
          <source>In Seventh IEEE International Conference on Semantic Computing (ICSC)</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Ngomo</surname>
          </string-name>
          .
          <article-title>A time-e cient hybrid approach to link discovery</article-title>
          .
          <source>In Proceedings of the 6th International Workshop on Ontology Matching</source>
          , Bonn, Germany, October
          <volume>24</volume>
          ,
          <year>2011</year>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>A</surname>
          </string-name>
          .
          <string-name>
            <surname>-C. Ngonga Ngomo</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          <string-name>
            <surname>Sherif</surname>
            , and
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Lyko</surname>
          </string-name>
          .
          <article-title>Unsupervised link discovery through knowledge base repair</article-title>
          .
          <source>In Extended Semantic Web Conference (ESWC</source>
          <year>2014</year>
          ),
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>G.</given-names>
            <surname>Papadakis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Ioannou</surname>
          </string-name>
          , C. Niedere`e, T. Palpanasz, and
          <string-name>
            <given-names>W.</given-names>
            <surname>Nejdl</surname>
          </string-name>
          .
          <article-title>Eliminating the redundancy in blocking-based entity resolution methods</article-title>
          .
          <source>In JCDL</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>M.</given-names>
            <surname>Sherif</surname>
          </string-name>
          , A.
          <string-name>
            <surname>-C. Ngonga Ngomo</surname>
            , and
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Lehmann</surname>
          </string-name>
          .
          <article-title>Automating RDF dataset transformation and enrichment</article-title>
          .
          <source>In 12th Extended Semantic Web Conference</source>
          , Portoroz, Slovenia, 31st May - 4th
          <source>June 2015</source>
          . Springer,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>J.</given-names>
            <surname>Sleeman</surname>
          </string-name>
          and
          <string-name>
            <given-names>T.</given-names>
            <surname>Finin</surname>
          </string-name>
          .
          <article-title>Computing foaf co-reference relations with rules and machine learning</article-title>
          .
          <source>In Proceedings of the Third International Workshop on Social Data on the Web</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>T.</given-names>
            <surname>Soru</surname>
          </string-name>
          , E. Marx, and A.
          <string-name>
            <surname>-C. Ngonga</surname>
          </string-name>
          <article-title>Ngomo. ROCKER - a refinement operator for key discovery</article-title>
          .
          <source>In Proceedings of the 24th International Conference on World Wide Web</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>