<!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>A linkset quality metric measuring multilingual gain in SKOS Thesauri</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Riccardo Albertoni</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Monica De Martino</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Paola Podesta</string-name>
          <email>podestag@ge.imati.cnr.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Istituto di Matematica Applicata e Tecnologie Informatiche Consiglio Nazionale delle Ricerche</institution>
          ,
          <addr-line>Via De Marini, 6, 16149 Genova</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Linked Data is largely adopted to share and make data more accessible on the web. A quite impressive number of datasets has been exposed and interlinked according to the Linked Data paradigm but the quality of these datasets is still a big challenge in the consuming process. Measures for quality of Linked Data datasets have been proposed, mainly by adapting concepts de ned in the research eld of information systems. However, very limited attention has been dedicated to the quality of linksets, the connections of information belonging to distinct datasets, that might be as important as dataset's quality when consuming Linked Data. In this paper, we present a rst linkset quality measure proposing a function able to estimate the new information gained through linksets among SKOS thesauri. A scoring function, the linkset importing is provided focusing on the multilingual gain, in terms of the new translated labels, obtained by complementing a SKOS thesaurus through skos:exactMatch links. We nally discuss how the linkset importing can be signi cantly used in the context of the EU project eENVplus.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The increasing interest and involvement of data providers surely represents a
genuine witness of the Web of Data success, but in a longer perspective, the
quality of the exposed data will be one of the most critical issues in the data
consumption process. After all, as discussed in [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], data is only worth its quality.
The research pertaining to Linked Data quality is especially focused on datasets
[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. However, one of the most interesting promises of Linked Data is \Linked
Data will evolve the current web data into a Global Data Space" that implies the
exploitation of data items coming from di erent sources as a whole. In the Linked
Data context, this is possible by connecting information belonging to di erent
sources by the way of linksets. Through linksets a Linked Data consumer can
reach new information to complete and enrich data at hand, so, in order to keep
the Linked Data promise, the quality of connections (hereinafter linkset quality )
are as important as the quality of data. This paper proposes a method to shed
light on this. It presents a measure, the linkset importing, estimating the linkset
quality as the ability of a linkset to enrich a dataset with new properties values.
We are aware that quality is a multidimensional issue, and that, in analogy to
the quality for dataset, even the quality of linkset might have di erent
dimensions (e.g., correctness, completeness, trustworthiness). In fact, with the linkset
importing we focus on an aspect of linkset quality the dimension completeness,
more precisely, the completeness of a dataset obtained when complementing a
dataset via its linkset. Linkset importing extends the linkset quality introduced
in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] focusing on skos:exactMatch linksets among thesauri exposed as Simple
Knowledge Organization System (SKOS) Ontology in the Linked Data. This
type of linksets and of datasets has been chosen considering the application
scenarios we are facing in the EU funded project eENVplus (CIP-ICT-PSP grant
No. 325232), where we deal with a remarkable number of environmental thesauri
exposed as Linked Data [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and with their skos:exactMatch linksets.
Considerable e orts have been spent to interlink thesauri such as GEMET, EARTh,
AGROVOC, EUROVOC, UNESCO, RAMEAU, TheSoz, but, currently, there is
no way to assess the value of these interlinks in terms of usefulness and
information gain. To this purpose, the linkset importing can be exploited to check the
linkset complementation potential for any SKOS property; in particular, we
focus on skos:prefLabel and skos:altLabel, in order to address the incomplete
language coverage1 issue (see [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]), which a ects many popular SKOS thesauri.
      </p>
      <p>The organization of the paper is as follows: Section 2 introduces basic
concepts such as dataset, linkset and complementation of a dataset via its linkset.
Section 3 formalizes the linkset importing quality providing related indicators
and score functions. Section 4 applies the linkset importing in an example which
is grounded in the context of the EU project eENVplus. Finally, we discuss
related work in Section 5 and the conclusions and future work in Section 6.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Basic Concepts</title>
      <p>
        This paper considers resources on the Web represented using the Resource
Description Framework (RDF)2. In particular, we use the notion of dataset and
linkset provided in the Vocabulary of Interlinked Datasets (VoID)[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], an RDF
vocabulary commonly adopted for expressing metadata about RDF datasets
exposed as Linked Data. A dataset (D), more precisely a void:Dataset, is a set
of RDF triples published, maintained or aggregated by a single provider.
A linkset (L), more precisely a void:Linkset, is a special kind of dataset
containing only RDF links between two datasets, de ned the void:subjectsTarget
and the void:objectsTarget, representing respectively the object and the
subject of the linkset. Each RDF link is RDF triple (s,p,o), where s, p,o are
generically indicated as RDF terms (hereafter, the set RDFTerms); more in
detail, s and o, belonging respectively to the subject and the object datasets,
may be RDF resources denoted by an IRI (hereafter, the set RDFRiri) (e.g.,
1 Incomplete language coverage arises when skos:prefLabel and skos:altLabel are
provided in all the expected languages only for a subset of the thesaurus concepts.
2 http://www.w3.org/TR/rdf11-primer/
http://dbpedia.org/resource/Tectonics) and o may range also in RDF
literals (hereafter, the set RDFLit) (e.g., Dog) or RDFlit with ISO language
tags3 (hereafter, the set RDFLitLtag) (e.g., Dog@en). While, p is a RDF
property (hereafter, the set RDFProp) (e.g., skos:exactMatch) that indicates
the type of the link. RDF links in a linkset should all have the same type,
otherwise, the linkset should be split in distinct linksets. This paper considers
skos:exactMatch linksets, namely linksets made by RDF skos:exactMatch
links. In the context of SKOS thesauri, skos:exactMatch binds SKOS concepts
with equivalent meaning.
      </p>
      <p>
        This paper adapts the notion of complementation via a linkset
introduced in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] to SKOS thesauri. Given two thesauri X, Y and a linkset L
linking some concepts in X with some concepts in Y , X can be complemented
with Y via L resulting in a third thesaurus identi ed with XL. Informally,
XL contains all RDF triples of X and the SKOS/RDF triples reachable in
Y via L. Formally, let D be a dataset and tD(s; p; o) be a predicate holding
if and only if the RDF triple (s,p,o) 2 D, p a SKOS property, we de ne:
XL = f(s; p; o) j [tX (s; p; o)] _ [tL(s; skos:exactMatch; y) ^ tY (y; p; o)]g.
Notice that, XL and XL [ Y usually di er. The former corresponds to X in which
triples induced by the skos:exactMatch have been materialized, while the latter
also include all the triples from Y .
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Linkset Importing Quality</title>
      <p>
        This section formalizes the linkset importing, a quality measure which assesses
linksets as good as they improve a dataset with its interlinked entities' properties.
Linkset importing is structured coherently with the well-known quality
terminology presented in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] including quality indicators, scoring functions and
aggregate metrics. Quality indicators are characteristics in datasets and
linksets (e.g., pieces of dataset content, pieces of dataset meta-information,
human ratings) which can give indication about the suitability of a dataset/linkset
for some intended use. Scoring functions are functions evaluating quality
indicators to measure the suitability of the data for some intended use. Aggregate
metrics are user-speci ed metric built upon scoring functions. These
aggregations produce new assessment values through the average, sum, max, min or
threshold functions applied to the set of scoring functions. In the following
subsections, we formalize two indicators and the importing scoring function. We do
not provide explicitly any aggregate metrics.
      </p>
      <sec id="sec-3-1">
        <title>3.1 Indicators</title>
        <p>We present the indicator val4Prop that given an RDFRiri e of dataset X returns
all the values associated to e for a speci c RDF property, with the possibility to
specify or not (using ) a language tag.
3 http://tools.ietf.org/html/bcp47#section-2.2.9
De nition 1 Let e be a RDFRiri of dataset X, p be a RDFProp, and , lang be
in RDFLitLtag [f g. We de ne:
val4PropX (e,p,lang) =
(fvjtX (e; p; v)g</p>
        <p>if lang =</p>
        <p>Then, given an RDFTerms e and a linkset L, we de ne an operator [ ]L that
returns e if e is not involved in any skos:exactMatch link or e's
skos:exactMatchlinked RDFTerms otherwise.</p>
        <p>De nition 2 Let L be a linkset, Z a set of RDFTerms not including blank nodes.
The operator [ ]L is de ned as follows:
[Z]L=fyjz 2 Z ^ (tL(z; skos:exactMatch; y) _ ((:tL(z; skos:exactMatch; y) _
z 2 RDF Lit) ^ y = z))g: 4
Example 1. Considering datasets X and Y and linkset L in Fig. 1, val4PropX (x2,
skos:prefLabel, en)=fSnake@eng, whilst val4PropX (x2, skos:prefLabel, )=
fSnake@en,Serpente@itg, since in the latter there is no constraint on the
language tag. Moreover, [fDog@eng]L=fDog@eng, since fDog@eng RDFLitLtag
RDFLit, and [fx2,x5g]L =fx2,y5g, since x2 has no skos:exactMatch link, and
y5 is the skos:exactMatch-linked RDFTerm for x5.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Scoring functions</title>
        <p>Using the indicators presented in the previous section, we de ne now, the
scoring functions characterizing our linkset quality measure. Linkset importing
scoring function evaluates the percentage of \gained values" for a RDF property
p. \Gained values" are values not already present in the subject dataset X,
but reachable through the linkset L in object dataset Y . Linkset importing
assumes that the linkset correctness has been previously validated. In the following,
4 RDF triples belonging to L are completely known. We assume the L's
RDF dump or SPARQL endpoint is speci ed in L's VOID description. Thus
:tL(z; skos:exactMatch; y) can be veri ed under the close-world assumption.
we present the importing scoring function for a single link, then, we generalize
de ning the average importing scoring function for the whole linkset L.
De nition 3 Let e 2 RDFRiri, l 2 L and lang 2 RDFLitLtag [f g. The link
importing for e considering property p through l is de ned as follows:
LinkImp4pL(e,p,l,lang) =
(0</p>
        <p>if den = 0</p>
        <p>LkImp4pL(e; p; l; lang) 100 otherwise
where
LkImp4pL(e,p,l,lang) = 1
jval4PropX (e,p, lang)j
j[val4PropX (e,p,lang)]L [ val4PropXL ([feg]flg,p,lang)j
| d{ezn }
:
Example 2. Considering the properties pl = skos:prefLabel, al = skos:altLabel
and br = skos:broader showed in Fig. 1. LinkImp4pL(x3; pl; l2; ) = 100 (1
jfDog@engj jfDog@engj
j[fDog@eng]L[val4PropXL ([fx3g]fl2g;pf; )j )=100 (1 jfDog@eng[fDog@en;Cane@itgj ) =
50% and LinkImp4pL(x3; al; l2; en)= 0% are, respectively, the percentage of new
pl in any language and new al in English gained by x3 via l2.
LinkImp4pL(x5; br; l3; ) = 100 (1 j[fx3g]L[val4ProjfpxX3Lgj([fx5g]fl3g;br; )j ) = 100
(1 jfy3g[f1y3;y6gj ) = 50% is the percentage of broader entities gained by x5 via
l3. Only y6 is gained, since y3 is considered a duplication of x3 ([fx3g]L= fy3g).
The function measures the gain in completeness when complementing via a
linkset, as a consequence, it returns 100% if and only if new values from the link
object are imported for an empty subject. Generalizing to the entire linkset.
De nition 4 Let lang2 RDFLitLtag [f g, the importing capability of L with
respect to p is de ned as the average importing of all links included in L.
AVGLinksetImp4p(L,p,lang) = jL1j Pe2fxjtL(x; ; )g;l2L LinkImp4pL(e,p,l,lang)
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Application</title>
      <p>
        A prototype of the average importing scoring function has been implemented
in JAVA/JENA, and applied to evaluate the quality of linksets, developed in
the context of eENVplus project, among environmental SKOS thesauri. We
focus on two linksets E2GEM (4365 links) and E2AGR (1436 links) which have
both EARTh, a thesaurus of 14351 concepts, as subject dataset and
respectively GEMET and AGROVOC [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] as object datasets. E2GEM and E2AGR
have been created and validated in the context of eENVplus project [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Our
purpose is to investigate which of two linksets imports in EARTh the greater
number of skos:prefLabel and skos:altLabel in di erent languages.
      </p>
      <p>The results are shown in Fig. 2, where radial axes include: (i) one axis for each
considered language, and (ii) an axis \total" representing the average importing
(a) skos:prefLabel
(b) skos:altLabel
for all languages. Focusing on skos:prefLabel, see Fig. 2(a), the linkset
importing quality of E2GEM is better than E2AGR, in fact: (i) the average importing
(axis \total") in E2GEM is higher than in E2AGR; (ii) linkset E2GEM imports
a greater number of languages with respect to E2AGR. On the other hand, when
we consider the average linkset importing for skos:altLabel, see Fig. 2(b), the
result is exactly the opposite, E2AGR performs better than E2GEM. In fact, (i)
the axis \total" shows that, in average, E2AGR imports more skos:altLabel
than E2GEM; and (ii) E2AGR imports skos:altLabel translated in more
languages than E2GEM. So which linkset is the best has no trivial answer. In
general, the choice of the best linkset depends on the speci c languages in which
we are interested. For example, considering the importing for skos:prefLabel
(Fig. 2(a)) the set of languages imported from E2GEM largely di ers from those
importable via E2AGR. In fact, only 10 out of the 40 considered languages are
importable from both linksets (i.e., ar, ru, es, tr, pt, pl, de, fr, hu, cs), about 19
out of 40 (e.g., bg, ga, , sl, eu, ro) can be imported only considering E2GEM,
and 8 out of 40 only from E2AGR. While, for skos:altLabel (Fig. 2(b)), we
import about 20 out of 40 languages from E2AGR and about 4 of 40 from E2GEM.
As already discussed the linkset quality evaluation performed using the average
linkset importing score function, is partial and other indicators and measures
should be de ned in order to fully characterize the quality of a linkset.
Nevertheless, the results showed in Fig. 2 allow a ner analysis of the linkset than
the currently used measures based on the simple number of links. In fact, just
considering the number of links, E2GEM drastically outperforms E2AGR.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Related work</title>
      <p>
        A recent systematic review of quality assessment for linked data can be found
in the SWJ submission [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. This paper reviews quality dimensions traditionally
considered in data quality (e.g., availability, timeliness, completeness, relevancy,
availability, consistency) and Linked Data speci c dimensions, such as licensing
and interlinking, considering, for the latter, the framework LINK-QA [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and the
works [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. LINK-QA de nes two network measures speci cally designed for
Linked Data (i.e., Open SameAs chains, and Description Richness) and three
classic network measures (i.e., degree, centrality, clustering coe cient) for
determining whether a set of links improves the overall quality of linked data.
Whilst, [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] and [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] detect the quality of interlinking via crowd-sourcing. The
main di erences with respect to our linkset importing scoring function are: (i)
[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] work on links independently from the fact that links are part or
not of the same linksets; (ii) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] address the correctness of links, and
not the completeness of the complemented. A set of scoring functions measuring
completeness of the complemented are instead proposed in our previous work
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], for owl:sameAs linksets. We extend such work presenting a new measure
based on skos:exactMatch linkset. The paper [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] de nes a set of 26 quality
issues for SKOS thesauri and shows how these can be detected and improved
by deploying qSKOS [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], PoolParty checker, and Skosify [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Incomplete
language coverage, arising when the set of language tags used by the literal values
of concepts are not uniform for all concepts, is one of the considered issues and
it is also one of the problem a ecting most the environmental thesauri exploited
in eENVplus project. Unfortunately, [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] uses linkset speci c issues (i.g,
missing out-links and in-links) as quality indicator for \stand-alone" SKOS thesauri.
Thus, the power of linksets in the importing of new translated skos:prefLabel
and skos:altLabel values to address incomplete language coverage, is not
considered.
6
      </p>
    </sec>
    <sec id="sec-6">
      <title>Conclusions and Future Work</title>
      <p>
        In this paper, we make a step towards the Linked Data quality assessment, a still
open and critical research issue. Our contributions is twofold. On one hand, we
want to draw the community attention to the critical issue of the linkset quality.
In fact, we directly address the de nition and the assessment of linkset quality
measures, while, the majority of existing works focus on dataset quality. In our
point of view, for the evolution of the Web of Data into the Global Data Space,
linksets have the same importance of datasets. As a consequence, linksets quality
should be considered as an independent branch of Linked Data quality, and not
simply as one of the dataset quality dimensions. On the other hand, we
contribute to the Linked Data quality assessment formalizing the linkset importing
scoring function ables to evaluate linkset potential when complementing thesauri
with their interlinked information. Although linkset importing is not su cient
for a complete linkset quality assessment, it has o ered a starting point to
evaluate the gain in term of translated labels on real linksets developed in the EU
project eENVplus. As future works, we plan to evaluate the quality for other
skos:exactMatch linksets in the context of eENVplus project and to encode
the related results in DAQ [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], so that, quality results will be browsable with
third-party RDF CUBE visualizers. Moreover, we plan to investigate the linkeset
importing on owl:sameAs linksets and to de ne scoring functions for a larger
set of linkset quality dimensions.
      </p>
      <p>Acknowledgements. This research activity has been partially carried out within
the EU funded project eENVplus (CIP-ICT-PSP grant No. 325232).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>M.</given-names>
            <surname>Acosta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zaveri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Simperl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kontokostas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Auer</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          .
          <article-title>Crowdsourcing linked data quality assessment</article-title>
          .
          <source>In The Semantic Web - ISWC 2013 - 12th International Semantic Web Conference</source>
          , Sydney,
          <string-name>
            <surname>NSW</surname>
          </string-name>
          , Australia,
          <source>October 21-25</source>
          ,
          <year>2013</year>
          , Proceedings,
          <string-name>
            <surname>Part</surname>
            <given-names>II</given-names>
          </string-name>
          , volume
          <volume>8219</volume>
          of Lecture Notes in Computer Science, pages
          <volume>260</volume>
          {
          <fpage>276</fpage>
          . Springer,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>R.</given-names>
            <surname>Albertoni</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Gomez-Perez</surname>
          </string-name>
          .
          <article-title>Assessing linkset quality for complementing third-party datasets</article-title>
          .
          <source>In EDBT/ICDT Workshops</source>
          , pages
          <volume>52</volume>
          {
          <fpage>59</fpage>
          . ACM,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>R.</given-names>
            <surname>Albertoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. D.</given-names>
            <surname>Martino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. D.</given-names>
            <surname>Franco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. D.</given-names>
            <surname>Santis</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Plini. Earth</surname>
          </string-name>
          :
          <article-title>An environmental application reference thesaurus in the linked open data cloud</article-title>
          .
          <source>Semantic Web</source>
          ,
          <volume>5</volume>
          (
          <issue>2</issue>
          ):
          <volume>165</volume>
          {
          <fpage>171</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>R.</given-names>
            <surname>Albertoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. D.</given-names>
            <surname>Martino</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Podesta</surname>
          </string-name>
          .
          <article-title>Environmental thesauri under the lens of reusability</article-title>
          .
          <source>In EGOVIS</source>
          <year>2014</year>
          , volume
          <volume>8465</volume>
          of Lecture Notes in Computer Science, pages
          <volume>222</volume>
          {
          <fpage>236</fpage>
          . Springer,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>C.</given-names>
            <surname>Bizer</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Cyganiak</surname>
          </string-name>
          .
          <article-title>Quality-driven information ltering using the WIQA policy framework</article-title>
          .
          <source>J. Web Sem</source>
          .,
          <volume>7</volume>
          (
          <issue>1</issue>
          ):1{
          <fpage>10</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>C.</given-names>
            <surname>Caracciolo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Stellato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Morshed</surname>
          </string-name>
          , G. Johannsen,
          <string-name>
            <given-names>S.</given-names>
            <surname>Rajbhandari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Jaques</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Keizer</surname>
          </string-name>
          .
          <article-title>The AGROVOC linked dataset</article-title>
          .
          <source>Semantic Web</source>
          ,
          <volume>4</volume>
          (
          <issue>3</issue>
          ):
          <volume>341</volume>
          {
          <fpage>348</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>R.</given-names>
            <surname>Cyganiak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hausenblas</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Alexander</surname>
          </string-name>
          .
          <article-title>Describing linked datasets with the VoID vocabulary</article-title>
          .
          <source>W3C note</source>
          , W3C, Mar.
          <year>2011</year>
          . http://www.w3.org/TR/2011/NOTE-void-
          <volume>20110303</volume>
          /.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>J.</given-names>
            <surname>Debattista</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lange</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Auer</surname>
          </string-name>
          .
          <article-title>Representing dataset quality metadata using multi-dimensional views</article-title>
          .
          <source>In SEMANTICS</source>
          <year>2014</year>
          , Leipzig, Germany, September 4-
          <issue>5</issue>
          ,
          <year>2014</year>
          , pages
          <fpage>92</fpage>
          {
          <fpage>99</fpage>
          . ACM,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>C.</given-names>
            <surname>Gueret</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. T.</given-names>
            <surname>Groth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Stadler</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          .
          <article-title>Assessing linked data mappings using network measures</article-title>
          .
          <source>In ESWC</source>
          , volume
          <volume>7295</volume>
          of Lecture Notes in Computer Science, pages
          <volume>87</volume>
          {
          <fpage>102</fpage>
          . Springer,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>C. Mader</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Haslhofer</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Isaac</surname>
          </string-name>
          .
          <article-title>Finding quality issues in skos vocabularies</article-title>
          . In P. Zaphiris,
          <string-name>
            <given-names>G.</given-names>
            <surname>Buchanan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Rasmussen</surname>
          </string-name>
          , and F. Loizides, editors,
          <source>TPDL</source>
          , volume
          <volume>7489</volume>
          of Lecture Notes in Computer Science, pages
          <volume>222</volume>
          {
          <fpage>233</fpage>
          . Springer,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>O.</given-names>
            <surname>Suominen</surname>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Hyvo</surname>
          </string-name>
          <article-title>nen. Improving the quality of skos vocabularies with skosify</article-title>
          .
          <source>In EKAW</source>
          , volume
          <volume>7603</volume>
          of Lecture Notes in Computer Science, pages
          <volume>383</volume>
          {
          <fpage>397</fpage>
          . Springer,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>O.</given-names>
            <surname>Suominen</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Mader</surname>
          </string-name>
          .
          <article-title>Assessing and improving the quality of skos vocabularies</article-title>
          .
          <source>J. Data Semantics</source>
          ,
          <volume>3</volume>
          (
          <issue>1</issue>
          ):
          <volume>47</volume>
          {
          <fpage>73</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>A.</given-names>
            <surname>Zaveri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kontokostas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Sherif</surname>
          </string-name>
          , L. Buhmann, M. Morsey,
          <string-name>
            <given-names>S.</given-names>
            <surname>Auer</surname>
          </string-name>
          , and
          <string-name>
            <surname>J. Lehmann.</surname>
          </string-name>
          <article-title>User-driven quality evaluation of dbpedia</article-title>
          .
          <source>In I-SEMANTICS</source>
          <year>2013</year>
          , Graz, Austria, September 4-
          <issue>6</issue>
          ,
          <year>2013</year>
          , pages
          <fpage>97</fpage>
          {
          <fpage>104</fpage>
          . ACM,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>A.</given-names>
            <surname>Zaveri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rula</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Maurino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Pietrobon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Auer</surname>
          </string-name>
          .
          <article-title>Quality assessment for linked open data: A survey</article-title>
          .
          <source>Semantic Web Journal</source>
          , to appear.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>