<!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>LOTED: Exploiting Linked Data in Analyzing European Procurement Notices</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Francesco Valle</string-name>
          <email>francescovalle84@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mathieu d'Aquin</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tommaso Di Noia</string-name>
          <email>t.dinoia@poliba.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Enrico Motta</string-name>
          <email>e.mottag@open.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>: Knowledge Media Institute, The Open University</institution>
          ,
          <addr-line>Milton Keynes</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>: Technical University of Bari, Electrical and Electronics Engineering Department Information Systems Research Group</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>The world of procurements and eProcurement generates daily large amounts of data, that represent knowledge of great economical value both for individual companies and for public organisations wishing to achieve a better understanding of a given market. However, such data remains di cult to explore and analyze as it is being kept isolated from other sources of knowledge, in dedicated systems. In this paper, we present an ongoing work on extracting and linking data from the European `Tenders Electronic Daily' system, which publishes approximately 1,500 tenders ve times a week. We speci cally show how such information is dynamically extracted and linked to external datasets, and how the created links enrich the original data, introducing new perspectives to its analysis. We show tools we developed to support such `linked data-based' analysis of data, and report on the lessons learnt from our experience in building a linked data application with potential for real-life use in knowledge extraction.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The Tenders Electronic Daily (TED1) website is a portal maintained by the
European Commission and dedicated to the public procurement in the countries
of the European Union. As the name suggests, it is updated daily (5 days a week)
with newly published tenders in 14 di erent sectors (e.g., Education, Technology
and Equipment, Agriculture and Food). Each tender is an o cial document,
containing information related to the public organisation it originates from (e.g.,
a town council, a public administration), its location, the type of activity it is
related to, etc.</p>
      <p>As such, this portal represents a rich source of information from which
crucial strategic and economical knowledge could be extracted. Services exist that
provide mail alerts and other mechanisms for companies on the basis of TED,
but these tend to simply redirect the information from the original system to
the user, without making any further analysis.</p>
      <p>In this paper, we demonstrate how the principles of linked data can be used on
the information exposed by the TED system, on the one hand to improve access
1 http://ted.europa.eu/
to this data, allowing new applications to be built on top of it, and on the other
hand, to investigate how links to external datasets can bring valuable additional
perspectives into the data, enriching it with new dimensions and making possible
new forms of analysis that exploit data and links to reach a better understanding
of the global public market. In addition, we derive from our experience in building
such a concrete linked data application lessons regarding the current limitations
of linked data and of the supporting tools.</p>
      <p>In the next section, we detail how we developed a platform realising a
workow from obtaining the data in the original TED portal, to exposing it as linked
data and providing interfaces to it. In Section 3, we detail a prototype
application of this platform to build visualisations combining dimensions from the
original data and from external datasets, demonstrating how such an approach
can provide endless possibilities for new perspectives on previously isolated data.
Section 4 reports on our concrete experience in building such an application,
showing in particular how additional work should be realised in the area of
linked data to make applications such as ours easier to build and more e cient.
Finally, we conclude the paper pointing out directions for future work in
Section 5.
2</p>
    </sec>
    <sec id="sec-2">
      <title>LOTED: Anatomy of a Linked Data Application</title>
      <p>The TED portal updates its subscriber on newly published tenders daily through
a set of RSS feeds, with an RSS feed for each combination of country (27 countries
in total) and sector (14 sectors in total). Each RSS feed is updated at most once
a day, generally ve days a week, and is every time entirely replaced by the new
tenders. For example, feed://ted.europa.eu/TED/rss/en/RSS_tran_UK.xml
is the current URL of the RSS feed to the sector \Transport and related services"
in United Kingdom.</p>
      <p>A tender on TED is presented by a document, available in its original
languages and in translated form. For example, http://ted.europa.eu/udl?uri=
TED:NOTICE:202572-2010:TEXT:EN:HTML&amp;tabId=1 is a tender document
(Contract Notice), for photocopying and o set printing equipment in Stuttgart,
Germany. Such a document contains general, common information about the tender
such as its type, requested products or services, the location, originating
organisation, award criteria, etc. A summary of this data is available for each
document, presented in a tabular format (see Figure 1) with normalised elds
and values for these elds (for the previous tender, see http://ted.europa.eu/
udl?uri=TED:NOTICE:202572-2010:DATA:EN:HTML). The availability of such a
semi-structured summary of the document greatly facilitates the task of
extracting data from the TED system, as shown in the following sections.
2.1</p>
      <sec id="sec-2-1">
        <title>Overview</title>
        <p>In this section, we give an overview of the platform for the publication and use
of a linked data version of the information provided by the TED system, which
we called LOTED2 (Linked-Open Tenders Electronic Daily).</p>
        <sec id="sec-2-1-1">
          <title>2 http://loted.eu</title>
          <p>LOTED essentially relies on a triple store3 which is being updated daily with
information extracted as linked data from the RSS feeds of the TED system,
and exposed through a SPARQL endpoint (see Figure 2). The way RDF data
is extracted from the original tender documents, and how such data is linked to
external datasets (currently geonames4 and DBpedia5), is explained in the next
section.</p>
          <p>As can be seen from Figure 2, at the heart of the system is the LOTED
Ontology 6, which has been speci cally developed for the needs of the platform. It is
a lightweight ontology, that matches directly the semi-structured representation
of the tenders from the TED system, while introducing an additional level of
structure. It is worth also noticing that the labels in this ontology are available
in three di erent languages. It can be argued that reusing existing ontologies
would have better encouraged interoperability. However, we found that
extracting existing information was made easier and less error-prone if realised in a
target structure that matched the original data closely. Mapping and
integrating this ontology with others, as well as evolving it towards a more expressive
modelisation of the domain of procurement is planned as part of our future work.
3 After a few tests, we found that the Jena system (http://openjena.org/) with
a TDB persistent store (http://openjena.org/TDB) o ered the best compromise
between exibility, robustness and performance for our scenario.
4 http://www.geonames.org/
5 http://dbpedia.org
6 http://loted.eu/ontology
The extraction of structured information is realised as a scheduled task,
happening every day. It starts by checking whether any of the RSS feeds from the
TED system had changed and downloading the English, tabular version of any
new tender published on the portal. As explained above, extraction from these
documents is facilitated on the one hand by the fact that they are formatted in
a semi-structured way, and on the other hand, as the LOTED ontology has been
explicitly designed to match this structure. We therefore developed a custom
made RDF extractor which parses the table structure of the original document
and transforms it into a structured RDF representation. Amongst the di culties
that are common to such processes is the issue of having to deal with special
characters and unicode strings that have to be included in URIs of entities. We
dealt with this problem by replacing any of such characters by its equivalent
HTML entity.</p>
          <p>Creating links is obviously a more challenging issue. Geographical
information is well covered by available linked datasets and can provide useful
information to associate to the tender documents, including the data about the places
where the originating organisation is. Within the data, the information available
is a string representing the name of the city where the organisation is located, and
a two letter country code. Geonames is a data set of geographical places around
the world. It provides simple identi ers for places, and information about their
locations (coordinates) and their names in various languages. Coordinates can
be very useful, as we will see later, simply to be able to place the city on a map.
Another large source of information about cities is DBpedia. Indeed, DBpedia
being extracted from Wikipedia7, it can contain a large variety of interesting
data about a given city, from its population to the region it is in or the current
mayor.</p>
          <p>To link the places found in the tenders to geonames, we make use of the
search engine provided on the geonames website8. Having both the name of the
city and the country code (being in Europe) makes the query su ciently
unambiguous, so that the rst result from the search engine is in the large majority of
the cases the one we are looking for. Actually, we never found any error in this
linking process in the time the system has been running (more than 2 months).
Another advantage of relying on geonames is that it is already well connected
to other datasets. In particular, DBpedia includes in most of the resources it
contains about cities a sameAs link to the corresponding URI identifying the
place in geonames. Therefore, nding links to DBpedia is realised
straightforwardly through a SPARQL query requesting resources that are the same as the
discovered geonames objects.</p>
          <p>
            When building a linked data based platform relying on links to external
datasets, di erent choices can be made on the way to integrate and use these
links. Indeed, a natural choice would be that any query sent to the system would
automatically look up for any link involved and retrieve dynamically, at run-time,
the corresponding information to be included in the results. However, while this
appears to be the kind of process linked data applications would normally rely
on, the tool support for realising it appears to be very weak. Only a few existing
systems are currently able to realise live look-ups of external entities [
            <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
            ], under
speci c conditions. In addition, these systems tend to ignore the links such as
sameAs which, while having well de ned semantics, are considered in the same
way as any other relation by SPARQL engines.
          </p>
          <p>
            For this reason, in LOTED, we made the choice of including in the
workow an o ine step of entity reconciliation (also called materialisation in [
            <xref ref-type="bibr" rid="ref1">1</xref>
            ]).
The basic idea for this step is to aggregate locally, under one identi er, all the
information from entities related with each other by sameAs. In our case, we
decided to use the geonames URI to represent the location of the organisation
in a tender, retrieving any information related to this URI from the geonames
system. We then retrieve the URI of entities in DBpedia linking to the
geonames object, and import all the information obtained by resolving this URI as
          </p>
        </sec>
        <sec id="sec-2-1-2">
          <title>7 http://www.wikipedia.org/ 8 http://www.geonames.org/search.html</title>
          <p>attached to the geonames URI. In this way, all the information about a given
place, from both geonames and DBpedia, ends up being aggregated in our triple
store, under the corresponding geonames URI.</p>
          <p>The creation and linking process described above has been running for more
than 2 months at the time of writing (since the 12th May 2010). It collected
around 55,000 procurement notices unequally distributed in the 14 sectors and
22 countries. These tenders relate to 5,000 places that are being linked to
geonames and DBpedia.
2.3</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Access Interfaces</title>
        <p>The primary goal of building a linked data platform such as LOTED is to make
available data in a machine readable and connected way, so that this data can
be further linked to and exploited in applications. Therefore, all the URIs used
in tender descriptions in LOTED resolve, and provide a complete
representation of the corresponding objects in RDF. For example, http://loted.eu/
data/tender/204339-2010 can be accessed to obtain the complete
representation of the tender number 204339-2010. Similarly, http://loted.eu/data/
authorityName/Ville_de_Nice is the URI for the particular organisation (Nice
City Council) that created the tender and the same pattern applies to other types
of objects in the data. The same kind of information is also available through a
SPARQL endpoint, located at http://loted.eu/Sparql and for which a basic
interface is available linking from the front page of the LOTED portal.</p>
        <p>The portal also implements a straightforward Web user interface, from which
people can nd, retrieve and obtain information about tenders (see Figure 3).
A speci c country, sector and range of dates can be chosen, that will make
appear the selection of tenders on a map, focusing on the selecting country. In
practice, this selection is translated into a SPARQL query to obtain the precise
coordinates of the cities that are related to tenders in the given sector, country
and range of dates. Clicking on the marker on the map corresponding to a given
city makes appear the list of tenders available in this city for the given sector
and dates, which are further linked to their original documents on the TED
portal, and to their RDF representations. It also displays information about
that city as described in DBpedia. This can in particular include data about
existing companies in this location. The RDF description of the current selection
of tenders can also be obtained, as well as the SPARQL query to generate this
RDF description, which can be further edited by the user to obtain a more
precise selection.</p>
        <p>In the next section, we show how we can use the links to DBpedia and
geonames to create the global visualisations of the tenders which are available
under the Charts button of the interface.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Analyzing the Data: Visualization of `Tender Pro les'</title>
      <p>As a way to demonstrate how linked data can bene t the analysis of data, and
obtaining a better understanding of a global domain where large data is involved,
we included in the LOTED portal visualisations of tender pro les according to
various dimensions. The idea of a tender pro le is that it corresponds to the
proportion of each sector in terms of the number of tenders being published in
a particular place or by a particular group of organisations.</p>
      <p>To illustrate this idea, we consider the most straightforward of these charts,
shown in Figure 4. This chart shows the tender pro les using the country of
origin as the main clustering dimension over the entire period starting at the
beginning of the LOTED system (12th May 2010). As can be seen, di erent
countries tend to have similar pro les, with however some variations in the
focus on some of the sectors. Therefore, from there, it is possible to focus on a
speci c sector, ordering automatically the di erent countries according to their
contribution to this sector. Doing so, we can then realise that one of the
greatest discrepancies between countries is on the sector of \ nancial and related
services", with Belgium having a larger proportion of tenders in this area, and
countries such as Malta and Slovakia being almost absent from such a market. In
addition, a table is presented associated with the chart that shows the number
of tenders for each country. This is useful to assess whether some countries have
a su cient amount of tenders for the results to be signi cant. For example, we
can notice that Malta only has had 66 tenders during this period, while several
other countries had thousands. For some reasons, France produces signi cantly
more tenders than any other countries (more than 14,000, compared to 6,500 for
the second country, Germany). Finally, it is also possible to manually order the
country in the chart, to try to nd correlations with other dimensions than the
sector (e.g., ordering the countries from East to West, to see if any regularity
appears).</p>
      <p>The chart relating tender pro les with country is very useful to obtain a
general idea of the distribution of tenders across the entire set. However, what
we want to show here is how the links to other datasets can provide additional,
and more granular ways of analysis. Another chart included in the LOTED
portal concerns speci c regions within countries (see Figure 5 for the chart of the
tender pro les by region in Italy). Indeed, for some countries, DBpedia provides
the information on which sub-division a city is in. For Italy, we can identify 20
di erent regions with, like for countries, di erent amounts of tenders being
published and di erent numbers of cities represented (this information is available
in the table attached to the chart on the website).</p>
      <p>In this case as well, tender pro les can be ordered by sector and manually to
try to extract correlations between the regions and the sector in which they tend
to publish tenders. This can be used to nd the best place for di erent sectors,
as the ones from which the most tenders originate, or the ones where a particular
market has not developed yet. Using such a process, we can in particular devise
the following table (Table 1) showing which region is the most and the least
represented in each sector9 (ignoring regions with less than 15 tenders):</p>
      <p>Of course, one would need to be an expert in the economy of Italy to
interpret these results appropriately. However, it appears unlikely for it to be a
coincidence for example that Emilia-Romagna is rst in both sectors of
\education" and \research and development", while Umbria is last in these two, as
9 In the spirit of http://www.informationisbeautiful.net/visualizations/
because-every-country-is-the-best-at-something/
well as in \printing and publishing".</p>
      <p>To illustrate further how additional data brought into the initial dataset of
tenders can be used to add originally unintended dimensions for data analysis,
we also computed the chart of the tender pro le in a given country, depending on
the political a liation of the cities the tender originates from (see Figure 6 for
the chart for France). The political a liation of a city can be found in DBpedia,
either directly attached to the city (under the property party), or as a
characteristic of the mayor (through the property mayorParty). Such information is
however very heterogeneously present across countries and cities.</p>
      <p>The basic idea here is that it would appear natural that di erent parties
would have a di erent focus when it comes to public spending and that making
emerge these di erent pro les can show users the in uence of local politics.
However, as can be seen from Figure 6, the tender pro les of the 2 major political
parties in France are surprisingly similar. This is valid also for other countries
where su cient data can be obtained. This consistency within a country is even
more surprising considering that, as shown previously, it is a lot less apparent
across di erent countries.</p>
      <p>It is worth noticing here two additional columns that have been added to
the chart: \Overall" and \Unknown". Overall corresponds to the average tender
pro les of all the cities for which the political party is known, while Unknown
correspond to the ones for which the political party is not provided by DBpedia.
This allows us to measure the bias introduced by incomplete information, by
looking at the dissimilarities between these two pro les.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Lessons Learnt</title>
      <p>Generally, one of the most important lessons learnt from building an application
such as LOTED is that there are obvious challenges in trying to extract high
level knowledge from interlinked datasets. First of all, the incompleteness of the
linked data cloud, and the general uncertainty regarding this incompleteness,
appear clearly as major problems in analysing tender data using the
visualisations presented above. Indeed, information as basic as the region in which a
particular city is cannot be assumed to be always present. Heterogeneity also
appears as a major issue, with many di erent properties used to represent the
same information in DBpedia, as well as redundancies and variations that have
to be manually cleaned up. Of course, it can be argued that such issues are
speci c to the considered dataset, DBpedia, and that geonames for example does
not su er from such issues. Indeed there seem to be two distinct sorts of linked
datasets currently available, of which DBpedia and geonames seem to be the
stereotypes: general purpose, heterogeneous, incomplete datasets, and focused,
homogeneous and clean datasets. Having said that, ways for an application
developer to realise in which category a dataset is and what can be expected from
it seem crucially needed. This element appears especially critical in application
such as LOTED which intend to provide some form of linked-data based data
analysis, where the discrepancies in the representation of di erent resources can
introduce a bias rendering the results of the analysis impossible to interpret.</p>
      <p>At a lower level of granularity, our experience also made emerge the lack of
support for the lifecycle of linked data applications. Indeed, we already discussed
the need for us to realise the task of entity reconciliation o ine and in an
adhoc manner, due to the unavailability of tools to exploit links between datasets
at run-time. This has obvious disadvantages, but also shows a need for generic
frameworks to support common tasks in linked data applications, including data
cleaning, URI creation (generating valid, consistent URIs from arbitrary unicode
strings), data discovery, linking, link storage, link exploitation, etc. There have
not yet been many applications exploiting linked data to a signi cant level. One
of the reasons might be that, as we experienced, a lot of e orts need to be spent
on setting up the basic underlying infrastructure, with every application starting
almost from scratch.</p>
      <p>The availability of such a generic framework for linked data applications,
including reusable components implementing common tasks such as the ones
listed above beyond the simple query engine/triple store, would then make
possible the development of data analysis framework for linked data, able to nd
relevant links, and new dimensions to enrich an existing dataset, making possible
the discovery of new knowledge from the created connections.</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>
        In this paper, we have presented the LOTED linked data application for
European public procurement. There have not been many applications of linked
data until now that where able to really exploit links to external dataset to
provide additional functionalities. We can for example mention DBRec [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], a music
recommender system exploiting DBpedia to help users in nding music, or
simpler applications such as described for example in [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ]. While relatively simple,
LOTED demonstrates how data analysis can be supported by linked data,
including external, originally unintended perspectives into a dataset to potentially
make emerge new high level knowledge about the considered domain. While this
application and the general idea are still at an early stage, the obtained results
have highlighted the new possibilities associated with the approach, showing
the potential of being able to create data visualisations seamlessly combining
dimensions from various datasets on the Web of Data.
      </p>
      <p>We also report in this paper on how the current state of linked data and
of the corresponding tools is hampering the development of such applications,
leading to a need for a generic framework, a platform or toolkit to support the
developers in realising the common, necessary tasks. Such a framework would
allow applications such as LOTED to evolve from `proofs-of-concept' of what
the Web of data can help achieve, to concrete, real-life applications. In relation
to this, we are currently exploring new analysis mechanisms on top of the data,
extracting and explaining trends in the various sectors covered by LOTED
tenders, in order to support the real needs of the potential users of the data, in
relation with existing work in the area of business intelligence.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgement</title>
      <p>The authors would like to thank Stefano Bertolo, Aldo Gangemi, Jose Manuel
Gomez Perez and Je Pan for their ongoing contributions to the work on LOTED.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Harth</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hose</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karnstedt</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Polleres</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sattler</surname>
            ,
            <given-names>K.U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Umbrich</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Data summaries for on-demand queries over linked data</article-title>
          .
          <source>In: 19th International World Wide Web Conference (WWW2010)</source>
          .
          <source>(April</source>
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Hartig</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Freytag</surname>
            ,
            <given-names>J.C.</given-names>
          </string-name>
          :
          <article-title>Executing SPARQL queries over the web of linked data</article-title>
          .
          <source>In: ISWC 2009: Proceedings of the 8th International Semantic Web Conference</source>
          , Chantilly,
          <string-name>
            <surname>VA</surname>
          </string-name>
          , USA. (
          <year>2009</year>
          )
          <volume>293</volume>
          {
          <fpage>309</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Passant</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Decker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Hey! ho! let?s go! explanatory music recommendations with dbrec</article-title>
          .
          <source>In: 7th Extended Semantic Web Conference</source>
          , ESWC Demo session. (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Hausenblas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Exploiting linked data to build web applications</article-title>
          .
          <source>IEEE Internet Computing</source>
          <volume>13</volume>
          (
          <year>2009</year>
          )
          <volume>68</volume>
          {
          <fpage>73</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heath</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berners-Lee</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Linked data { the story so far</article-title>
          .
          <source>International Journal on Semantic Web and Information Systems</source>
          <volume>5</volume>
          (
          <issue>3</issue>
          ) (
          <year>2009</year>
          )
          <volume>1</volume>
          {
          <fpage>22</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>