<!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>
      <journal-title-group>
        <journal-title>April</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>UrbanMatch - linking and improving Smart Cities Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Daniele Dell'Aglio CEFRIEL</string-name>
          <email>irene.celino@cefriel.it</email>
          <email>simone.contessa@cefriel.it</email>
          <email>stefano.fumeo@cefriel.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Italy daniele.dellaglio@cefriel.it</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Thorsten Krüger SIEMENS</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Germany thorsten.krueger@siemens.com</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Emanuele Della Valle Politecnico di Milano</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Irene Celino CEFRIEL</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Marta Corubolo Politecnico di Milano</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Simone Contessa CEFRIEL</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>Stefano Fumeo CEFRIEL</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2012</year>
      </pub-date>
      <volume>16</volume>
      <issue>2012</issue>
      <abstract>
        <p>Urban-related data and geographic information are becoming mainstream in the Linked Data community due also to the popularity of Location-based Services. In this paper, we introduce the UrbanMatch game, a mobile gaming application that joins data linkage and data quality/trustworthiness assessment in an urban environment. By putting together Linked Data and Human Computation, we create a new interaction paradigm to consume and produce location-speci c linked data by involving and engaging the nal user. The UrbanMatch game is also o ered as an example of value proposition and business model of a new family of linked data applications based on gaming in Smart Cities.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>Urban environments are experiencing a progressive
digitization that is leading to the creation and release of large
amounts of data: information about interesting aspects of
cities { ranging from street topology and tra c conditions to
business activities, from points of interest (POI) to events,
from environmental measures to people life-logs { are
increasingly present on the Web and even proactively fed by
the open community. The growing attention given to Smart
Cities themes and problems and the ever increasing
popularity of location-based applications make urban ecosystems
at the center of the research and innovation agenda of public
authorities and big industrial players such as IBM with its
Smarter Planet initiative1, and CISCO with its
Smart+Connected Communities initiative2.</p>
      <p>Also the Linked Data world turned to urban data,
especially in the area of spatial information. One of the most</p>
      <sec id="sec-1-1">
        <title>1http://www.ibm.com/uk/smarterplanet</title>
      </sec>
      <sec id="sec-1-2">
        <title>2http://www.cisco.com/web/strategy/smart_</title>
        <p>
          connected_communities.html
curated dataset available in this eld is GeoNames3.
Recently, open Web APIs like Open Street Map4 and
geographic datasets from public administrations were (partially)
turned into a Linked Data form by e orts like
LinkedGeoData5 [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] and the Spanish GeoLinkedData.es6.
        </p>
        <p>
          Still this massive bulk of urban data is largely unexplored
and poorly exploited [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. Two main drawbacks hamper
a larger adoption of Linked Data in Smart Cities
scenarios: the doubtful quality of the available information and the
lack of user-centred tools to consume such data. Those two
(well-known) problems create a vicious cycle: the unreliable
quality of data makes people distrust Linked Data content
and the lack of usable tools prevent people from contributing
to the Linked Data improvement.
        </p>
        <p>
          Our research hypothesis consists in employing user-friendly
mobile gaming applications to engage people in mobility;
through those games, Linked Data related to urban
environments are consumed, created, improved and corrected.
While a similar approach was already partially explored for
Linked Data at large [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ], we believe that the popularity of
location-based services (LBS) can make this approach
successful for urban-speci c Linked Data: people are more and
more used to \check-in" physical places with their mobile
devices and to add small bits of information related to their
activities and actions in the physical world.
        </p>
        <p>In this paper we present our rst experiment to prove
our hypothesis: UrbanMatch is a mobile and location-aware
Game with a Purpose that engages players to provide
information related to the city of Milano. Speci cally,
UrbanMatch is aimed at linking points of interests in the city with
the most representative photos retrieved from Web sources.</p>
        <p>The remainder of this paper is organized as follows.
Section 2 introduces motivation and related work; Section 3
explains the mechanics and purpose of the UrbanMatch game,
while the evaluation methodology is shown in Section 4;
nally Section 5 draws some conclusions and future works.
2.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>MOTIVATION AND BACKGROUND</title>
      <p>Our work focuses on link creation and quality assessment
for Linked Data in urban scenarios. In this section, we
il</p>
      <sec id="sec-2-1">
        <title>3http://geonames.org/</title>
      </sec>
      <sec id="sec-2-2">
        <title>4http://www.openstreetmap.org/</title>
      </sec>
      <sec id="sec-2-3">
        <title>5http://linkedgeodata.org/</title>
      </sec>
      <sec id="sec-2-4">
        <title>6http://geo.linkeddata.es/</title>
        <p>lustrate the motivation problem, explain the speci city of
Smart City solutions and introduce and discuss related work.
2.1</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Data Quality and Linked Data</title>
      <p>
        Data Quality [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] is the discipline that studies the most
appropriate and relevant features to describe the value of
data. Examples of dimensions de ned by Data Quality are
consistency, completeness, accuracy, and relevance.
      </p>
      <p>
        A key point of Data Quality is that the quality
measurements are context-dependent: given a dataset, its quality
can be very high with respect to the ful lment of some tasks
but very bad for other ones. In other words, it is not
relevant (and not always possible) to de ne absolute quality
values [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. As pointed out in [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]: \The perception of
information quality on the WWW is highly dependent on the
tness for use being relative to the speci c task that users
have at their hands".
      </p>
      <p>
        For the last years, the Linked Data community has started
to follow this topic with growing interest: the birth and
growth of the Linked Open Data (LOD) cloud introduced a
huge amount of RDF data distributed across several datasets.
The Linked Data best practices alone [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] assure more
quality than \raw data" in closed databases because: a) data
becomes accessible over the Web rather than being closed
up in silos; b) the use of shared vocabularies makes the data
both easier to \read" (i.e. user information needs can be
satis ed by a single SPARQL query instead of requiring many
dataset-speci c queries) and easier to \interpret" (i.e. shared
vocabulary semantics can be used to verify data integrity
and/or infer implied data); c) the presence of links makes it
also possible to verify consistency across di erent sources.
      </p>
      <p>Still, problems related to the available data quality soon
arose in the LOD cloud. While at the beginning the number
of statements and the number of links were used to estimate
the relevance of the published data sets, more recently the
de nition of more detailed and expressive metrics to describe
the available data has become more and more important.</p>
      <p>
        Flemming worked on the de nition of quality criteria for
linked data sources [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Furber and Hepp studied how to
integrate the Data Quality Management processes into the
Semantic Web. In [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] they presented their approach to use
SPARQL and SPIN to model Data Quality rules and execute
them, while in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] they de ned an ontology (named DQM
ontology) to describe Data Quality dimensions in RDF.
      </p>
      <p>However, the assessment of data quality factors like
accuracy, timeliness, completeness, relevance and
comprehensiveness of data is intrinsically a hard task that Linked Data
technologies do not make any easier.
2.2</p>
    </sec>
    <sec id="sec-4">
      <title>Urban Linked Data</title>
      <p>
        In the last years we have been largely experimenting with
urban related linked (and non-linked) data in the
development of a number of Smart City demonstrators using Linked
Data related to urban environments. The Urban LarKC7
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] and then the Tra c LarKC8 [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] integrated DBpedia, an
Eventful wrapper and two Milano municipality's datasets
with all Milano streets and three years of tra c sensors
data; those applications made it possible to answer queries
like \which are the modern art exhibitions that I can reach
today in less than 25 minutes if I can get into my car this
afternoon at 4pm?" [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. The Seoul Road Sign Management
7http://larkc.cefriel.it/alpha-Urban-LarKC/
      </p>
      <sec id="sec-4-1">
        <title>8http://larkc.cefriel.it/traffic-larkc/</title>
        <p>
          [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] integrated LinkedGeoData POI, OpenStreetMap streets
and a private dataset describing Seoul road signs to check
the validity of all road sign information. Finally, the mobile
app BOTTARI [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] explored social media to provide
locationbased recommendations for POIs.
        </p>
        <p>These experiences allow us to assert that: a) the quality
of urban Linked Data unpredictably ranges from very good
to very poor; b) it is possible to detect missing information
or inconsistencies by cross-validating datasets that describe
the same urban space from di erent points of view (e.g., if
a road sign tells to turn right to reach a POI, and the POI
is nearby, but no street reaches it, a street is missing in the
topology dataset); c) when inconsistencies or missing data
are detected, data quality can be easily increased by a small
amount of manual work that does not require speci c skills,
but often the physical presence in the urban environment.</p>
        <p>Those three assertions may not be valid for Linked Data
in general, but appear to be valid for urban Linked Data.
The third point suggests us that a part of the manual work
required to x urban Linked Data could be \crowd-sourced".
The recent popularity of Location-based Services (LBS) like
Foursquare demonstrates that people are willing to share
small bits of information on-the-go by exploiting their
mobile devices capabilities. \Unlock your city" { the slogan
of Foursquare { reveals that LBS can be considered an
effective means to collect useful information for Smart City
applications.
2.3</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Related work</title>
      <p>
        Assessing data quality is a hard problem for computers.
We, as humans, are perfectly capable of it, but we are not
necessarily willing to. Human Computation [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] and
Social Computing [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], however, demonstrated that a number
of di erent \computations" can be carried out by groups of
people. In this area Games with a Purpose [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] (GWAP)
emerged as a means to engage people to perform activities
that are almost trivial for humans and very complex for
computers; these tasks range from labelling images to improve
web searching, from transcription of text (where OCR
software fails) to any activity requiring common sense or human
experience.
      </p>
      <p>The incentives to make people contribute to Human
Computation can be of di erent kinds: they can give the
participant an explicit and concrete reward (like in the popular
Amazon Mechanical Turk { also named MTurk9 { in which
people are paid to perform small and simple tasks) or they
provide a di erent kind of implicit or more abstract return,
for example by means of entertainment like in GWAPs.</p>
      <p>
        In the Semantic Web community, Games with a Purpose
were already used to cover the complete Semantic Web
lifecycle [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. A dedicated community portal was recently set
up10 to collect those games. A good showcase is the Linked
Data Movie Quiz11 [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], that builds a cinematographic game
based on the available movie-related Linked Data showing
that \the answers are out there; and so are the questions".
Recently, [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] investigated which Linked Data management
tasks can be easily and semi-automatically turned into
crowdsourcing assignments for the MTurk platform.
      </p>
      <sec id="sec-5-1">
        <title>9http://mturk.com/ 10http://www.semanticgames.org/ 11http://lamboratory.com/hacks/ldmq/</title>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>THE URBANMATCH GAME</title>
      <p>UrbanMatch12 is a mobile location-based Game with a
Purpose that aims at selecting the most representative
photos related to the points of interest (POI) in an urban
environment; more speci cally, UrbanMatch is oriented to link
the monuments and relevant places of the city of Milano
with their respective photos as retrieved from social media
Web sites and to \rank" those links, so to identify the most
characteristic ones and to discard the others, thus improving
the quality.
3.1</p>
    </sec>
    <sec id="sec-7">
      <title>Data input</title>
      <p>Places &amp; POIs from</p>
      <p>OpenStreetMap</p>
      <p>Manual
Selection of
linked photos
Wikimedia
Commons</p>
      <p>Trusted
source
Uncertain
sources</p>
      <p>UrbanMatch
server</p>
      <p>UrbanMatch clients</p>
      <p>Trusted links:
&lt;POI&gt; foaf:depiction &lt;photo&gt;</p>
      <p>The input data come from available Web sources (cf.
Figure 1). Points of interest in Milano were collected and
chosen among those available from OpenStreetMap; an RDF
description of those POIs is also available in
LinkedGeoData, the linked data version of OpenStreetMap. For each
of the 34 POIs of this set, we manually selected 5-6 photos
depicting them (some chosen on the Web, some taken by
ourselves). In this way we built a \trusted set " of 196 links
that relate the POIs with their respective images; those links
are expressed in the form:
&lt;POI&gt; foaf:depiction &lt;photo&gt; .
6</p>
      <p>A much higher number of photos of Milano POIs was
collected from Wikimedia Commons13 { the media collection of
Wikipedia { and from Flickr14, probably the most popular
social media sharing site dedicated to photos. The images
were collected either by keyword/concept search (i.e.,
photos explicitly related to Milano POIs) or via location-based
queries (e.g., search by geographical coordinates). Among
the collected photos, we considered only those released with
an open license, allowing for a free reuse of the image (like
CreativeCommons \Attribution" license).</p>
      <p>This second set of information is considered { for the game
purpose { an \uncertain source": it consists of more than
37,000 \candidate" links that relate the POIs with the images
that potentially depict them. This link-set is uncertain or
untrusted because the retrieved photos can be incorrect (i.e.
they are not related to Milano POIs even if returned by the
search), their metadata can be wrong or incomplete or they
12http://bit.ly/urbanmatch
13http://commons.wikimedia.org/
14http://www.flickr.com/
cannot be considered as representative for the game purpose
(e.g., a photo is actually taken in the proximity of a POI,
but it does not depict it or it is focused on an irrelevant
detail).</p>
      <p>Those candidate links are expressed as RDF links using
the foaf:depiction predicate as explained before; however,
those links are further annotated with a con dence value
that expresses the lack of certainty about their
trustworthiness (e.g., the initial con dence of links to Wikimedia images
is set to 60%, links to Flickr to 40%).
3.2</p>
    </sec>
    <sec id="sec-8">
      <title>Gameplay</title>
      <p>
        The UrbanMatch game is a photo coupling game. The
game mechanics respects the best practice of casual games
and Games with a Purpose [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]: it consists in a simple and
intuitive interface that presents the player with 8 photos of
POIs in the vicinity of the player and asks for their coupling
(cf. Figure 2).
      </p>
      <p>The links between the surrounding POIs and the
presented photos is not the same for all the presented 8
photos: some links are certain, because they come from the
trusted source; some are uncertain, because they are taken
from the set of candidate links; nally, some are distractors,
i.e. they are not related to the surrounding POIs and are
used to check the reliability of players. Each game is
organized in multiple levels of increasing di culty, i.e. with a
varying number of certain/uncertain/distracting links (the
higher the level, the greater the uncertainty degree).</p>
      <p>The user geographic position taken from the mobile
device sensors computes the user proximity to the \playable
places", i.e. the game locations; even if the game allows for
playing from any place, the user location is used to
distinguish between the choices operated \on site" { based on the
player's experience knowledge { and couples selected on the
basis of the player's domain knowledge.</p>
      <p>The UrbanMatch game is available at http://bit.ly/
um-itunes on the iTunes store. Being a research prototype,
the game will be available only for a few months.</p>
    </sec>
    <sec id="sec-9">
      <title>Game purpose and Data Analysis</title>
      <p>Through the UrbanMatch game we aim at identifying and
selecting the POI-photo \correct" links among the candidate
links in the uncertain input source. Through a Human
Computation approach, we aim at collecting evidences of players
decisions to correlate images.</p>
      <p>
        The approach we follow to post-process the collected data
is similar to that of other Games with a Purpose [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]. From
the collection of all evidences of image coupling as
performed by the game players, with majority voting and other
statistically-relevant algorithms [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], we alter the con dence
value of each POI-photo link.
      </p>
      <p>Trusted</p>
      <p>link POI
Candidate
links</p>
      <p>POI</p>
      <p>UrbanMatch
players</p>
      <p>PostProcessing</p>
      <p>POI</p>
      <p>New
trusted</p>
      <p>link</p>
      <p>POI
Incorrect link discarded</p>
      <p>Intuitively, the game purpose processing is represented in
Figure 3: in each game level, trusted POI-photo links (the
green one on the left with Milano's Duomo picture) are
presented together with a number of candidate links related to
the same POI (the yellow ones on the left, with uncertain
photos retrieved from Wikimedia Commons and Flickr as
being related to Milano's Duomo) and with a number of
distractors (for simplicity not drawn in the gure).</p>
      <p>If players couple the same two photos, those photos
reasonably belong to the same POI: thus, if a player associates
a trusted photo with an uncertain photo, the candidate link
related to the latter is given a sign of \trust" and its con
dence value is increased.</p>
      <p>On the contrary, if there is no evidence of the association
between an uncertain photo and any other one, the
candidate link to that photo is not validated: the lack of coupling
actions is considered as a sign of \distrust" and decreases the
con dence value of the candidate link.</p>
      <p>The same POI-photo candidate link is given as input to
multiple users; each player action modi es the link con
dence value, by increasing or decreasing it. After a variable
number of played games, this con dence value crosses some
thresholds, thus leaving its uncertainty status and becoming
either a trusted link or an incorrect one.</p>
      <p>When the con dence value of a link becomes greater than
a given upper threshold (e.g., 70%), the POI-photo link
becomes \trustable" and is inserted in the trusted link-set; in
the gure, the green link on the right is associated to
Milano's Duomo and it can be used to validate other candidate
links. Similarly, if the con dence value of a POI-photo link
becomes smaller than a lower limit (e.g., 20%), the link is
discarded and is no more given as input to other players,
like for the red one on the right of Figure 3 (in which the
photo evidently depicts Roma's Colosseum).</p>
    </sec>
    <sec id="sec-10">
      <title>EVALUATION</title>
      <p>The evaluation of the UrbanMatch game is currently
being performed and it is aimed at two di erent results: the
assessment of the game \purpose" { the ability of our
Human Computation approach to actually derive meaningful
and quality links between Milano POIs and their related
photos { and the appraisal of the game \playability" { the
intrinsic fun or entertaining characteristic of the game.</p>
      <p>
        Regarding the assessment of the game purpose, we
identi ed a number of metrics to measure the UrbanMatch
capability to improve the \ tness-for-use" quality [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] of the
urban-related data involved in the game. More speci cally,
we measure the completeness and the accuracy of the new
trusted links produced by the game.
      </p>
      <p>We de ne completeness as the capability of the game to
assess all the input candidate links, deciding if they are
either trustable or incorrect. The completeness is calculated
by dividing the number of assessed links (i.e. the links that
became either trusted or incorrect after the gameplay) by
the total number of input uncertain links.</p>
      <p>We de ne accuracy as the capability of the game to make
correct assessments about the input links, minimizing the
\false positive" outcomes (i.e., POI-photo links considered
trustable but actually incorrect) and \false negative"
outcomes (i.e., POI-photo links considered incorrect but
actually trustable). To measure the game accuracy, we need to
know the ground truth, thus we manually check the assessed
links to identify the false positive/negative items. The
accuracy is then calculated by dividing the number of correct
assessments (true positive and true negative items) by the
total number of input uncertain links.</p>
      <p>Our preliminary evaluation is based on an early set of
played games: we collected evidences from 54 unique
players (not including the development team), who played 290
games for a total of 781 levels, in which they tested 2,006
uncertain links. Setting the thresholds on the con dence
value to 70% and 20% for the upper and lower limits
respectively, the game assessed the correctness/incorrectness
of 1,284 uncertain links, getting to an improvement of the
global completeness from 1.54% to 4.98% with a nal
accuracy of 99.4% (4 false positive and 8 false negative links).</p>
      <p>On the other hand, it is clear that an important success
factor for Games with a Purpose lies in the gaming feature:
the more engaging and entertaining the game, the higher the
number of participant players and thus the collected data.
For those reasons, we believe that an important part of the
UrbanMatch evaluation consists in assessing the
\playability" of the game itself.</p>
      <p>
        As suggested by several studies about traditional games [
        <xref ref-type="bibr" rid="ref23 ref9">9,
23</xref>
        ] and taking into consideration the peculiarities of
UrbanMatch, we built an evaluation questionnaire that
UrbanMatch players can nd at http://bit.ly/um-survey. The
questions are oriented at assessing the game characteristics
as well as \measuring" how much the purpose is hidden and
immersed within the gameplay.
      </p>
      <p>At writing time, we collected the feedbacks of 12 players
whose opinion was quite positive: UrbanMatch was
evaluated to be easy (91%) and clear (61%); most players \spread
the word" suggesting their friends to play (64%) and
supported our hypothesis that the physical presence in the
urban environment makes the gameplay easier (55%).
5.</p>
    </sec>
    <sec id="sec-11">
      <title>CONCLUSIONS</title>
      <p>While Linked Data research is continuously evolving and
improving, new ways to interlink information from di erent
independent sources are being formulated and explored. In
this paper, we presented our UrbanMatch application, a
mobile and location-based Game with a Purpose, oriented to
create high-quality links between existing datasets, namely
OpenStreetMap, LinkedGeoData and Flickr. UrbanMatch
is our rst experiment to prove that mobile gaming
applications can be successfully employed to consume, create and
improve urban-related Linked Data; our early experience
seems to con rm our research hypothesis, even if further
evaluation is needed.</p>
      <p>It is also worth noting that the data gathered via
UrbanMatch have a clear business value: linked and ranked
photos of places represent a valuable dataset which can be
used to improve a number of services ranging from image
search to geo-marketing. More generally, Games with a
Purpose aimed at linking, collecting or correcting Linked Data
related to urban spaces and Smart Cities constitute a
potential business for a number of di erent stakeholders: local
public authorities, local businesses (shops, transportation
companies, tourism actors, etc.) and citizens.</p>
      <p>Di erent datasets can be created or improved via Human
Computation approaches for local services, trade, tourism,
tra c optimization, environmental sustainability or simple
information. This includes both urban related Linked Data
and non-linked data such as municipality datasets or other
private datasets related to Smart Cities. We believe that
applications like UrbanMatch show a clear business model
to be exploited with special regards to location-aware Linked
Data.</p>
      <p>A nal note on the \gaming" approach: data linkage and
content creation or assessment tasks need an active and
productive engagement of users, but not all crowdsourcing
campaigns are successful and e ective. Shaping the Human
Computation missions as gaming activities (like in Games
with a Purpose) is a potential solution to this issue. A
further research question could be oriented to prove that a
funny or entertaining avour can accomplish more than an
extrinsic reward: nding a good balance between the game
rules and the purpose achievement is often a hard task.</p>
    </sec>
    <sec id="sec-12">
      <title>Acknowledgements</title>
      <p>This work was partially supported by Siemens Corporate
Research and Technologies and by the PlanetData EU
project (FP7-257641).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>G.</given-names>
            <surname>Alvaro</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Alvaro</surname>
          </string-name>
          .
          <article-title>A Linked Data Movie Quiz: the answers are out there, and so are the questions</article-title>
          . http://bit.ly/linkedmovies, Aug.
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Auer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Hellmann. LinkedGeoData - Adding</surname>
          </string-name>
          <article-title>a Spatial Dimension to the Web of Data</article-title>
          .
          <source>In Proceedings of ISWC</source>
          <year>2009</year>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>I.</given-names>
            <surname>Celino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dell'Aglio</surname>
          </string-name>
          ,
          <string-name>
            <surname>E. Della Valle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Grothmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Steinke</surname>
          </string-name>
          , and
          <string-name>
            <surname>V. Tresp.</surname>
          </string-name>
          <article-title>Integrating Machine Learning in a Semantic Web Platform for Tra c Forecasting and Routing</article-title>
          .
          <source>In Proceedings of IRMLES Workshop</source>
          <year>2011</year>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>I.</given-names>
            <surname>Celino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dell'Aglio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. Della</given-names>
            <surname>Valle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Park</surname>
          </string-name>
          , and
          <string-name>
            <given-names>V.</given-names>
            <surname>Tresp</surname>
          </string-name>
          .
          <article-title>Making Sense of Location-based Micro-posts Using Stream Reasoning</article-title>
          .
          <source>In Proceedings of #MSM Workshop</source>
          <year>2011</year>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>K. T.</given-names>
            <surname>Chan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. King</given-names>
            , and
            <surname>M.-C.</surname>
          </string-name>
          <article-title>Yuen</article-title>
          .
          <article-title>Mathematical modeling of social games</article-title>
          .
          <source>In Proceedings of IEEE CSE Conference</source>
          <year>2009</year>
          , volume
          <volume>4</volume>
          , pages
          <fpage>1205</fpage>
          {
          <fpage>1210</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>C.</given-names>
            <surname>Charron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Favier</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Li</surname>
          </string-name>
          .
          <article-title>Social Computing { How Networks Erode Institutional Power, And What to Do About It</article-title>
          .
          <source>Forrester Research</source>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>E.</given-names>
            <surname>Della Valle</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Celino</surname>
          </string-name>
          , and
          <string-name>
            <surname>D.</surname>
          </string-name>
          <article-title>Dell'Aglio. The Experience of Realizing a Semantic Web Urban Computing Application</article-title>
          . Transactions in GIS,
          <volume>14</volume>
          (
          <issue>2</issue>
          ),
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>E.</given-names>
            <surname>Della Valle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Celino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dell'Aglio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Steinke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Grothmann</surname>
          </string-name>
          , and
          <string-name>
            <given-names>V.</given-names>
            <surname>Tresp. Semantic Tra</surname>
          </string-name>
          c
          <article-title>-Aware Routing for the City of Milano using the LarKC Platform</article-title>
          .
          <source>IEEE Internet Computing</source>
          ,
          <volume>15</volume>
          (
          <issue>6</issue>
          ),
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>H.</given-names>
            <surname>Desurvire</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Caplan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Toth</surname>
          </string-name>
          .
          <article-title>Using heuristics to evaluate the playability of games</article-title>
          .
          <source>In Proceedings of CHI Conference</source>
          <year>2004</year>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Flemming</surname>
          </string-name>
          and
          <string-name>
            <given-names>O.</given-names>
            <surname>Hartig</surname>
          </string-name>
          .
          <article-title>Quality Criteria for Linked Data sources</article-title>
          . Online at http://bit.ly/ld-quality.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>T.</given-names>
            <surname>Fullerton</surname>
          </string-name>
          . Game Design Workshop, A Playcentric Approach to Creating Innovative Games. Gama Network Series. Morgan Kaufmann,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Furber and M. Hepp. Using SPARQL and SPIN for Data Quality Management on the Semantic Web</article-title>
          .
          <source>In BIS</source>
          , pages
          <volume>35</volume>
          {
          <fpage>46</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>Furber and M. Hepp</article-title>
          .
          <article-title>Towards a Vocabulary for Data Quality Management in Semantic Web Architectures</article-title>
          .
          <source>In Proceedings of LWDM Workshop</source>
          <year>2011</year>
          , March
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>T.</given-names>
            <surname>Heath</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Bizer</surname>
          </string-name>
          .
          <article-title>Linked Data: Evolving the Web into a Global Data Space</article-title>
          .
          <article-title>Synthesis Lectures on the Semantic Web</article-title>
          . Morgan &amp; Claypool,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>P.</given-names>
            <surname>Jain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hitzler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. Z.</given-names>
            <surname>Yeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Verma</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A. P.</given-names>
            <surname>Sheth</surname>
          </string-name>
          .
          <article-title>Linked data is merely more data</article-title>
          .
          <source>In AAAI Spring Symposium: Linked Data Meets AI</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Knight</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Burn</surname>
          </string-name>
          .
          <article-title>Developing a framework for assessing information quality on the World Wide Web</article-title>
          .
          <source>Informing Science</source>
          ,
          <volume>8</volume>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>T.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Park</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Huang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E. Della</given-names>
            <surname>Valle</surname>
          </string-name>
          .
          <article-title>Toward Seoul Road Sign Management on the LarKC Platform</article-title>
          .
          <source>In Posters and Demos of ISWC</source>
          <year>2010</year>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>F.</given-names>
            <surname>Naumann</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Rolker</surname>
          </string-name>
          .
          <article-title>Assessment Methods for Information Quality Criteria</article-title>
          . In B. D. Klein and
          <string-name>
            <surname>D. F</surname>
          </string-name>
          . Rossin, editors,
          <source>IQ. MIT</source>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>T. C.</given-names>
            <surname>Redman</surname>
          </string-name>
          .
          <article-title>Data Quality: The Field Guide</article-title>
          . Digital Press,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>E.</given-names>
            <surname>Simperl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Norton</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Vrandecic</surname>
          </string-name>
          .
          <article-title>Crowdsourcing Tasks within Linked Data Management</article-title>
          .
          <source>In Proceedings of COLD Workshop</source>
          <year>2011</year>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>K.</given-names>
            <surname>Siorpaes</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Hepp</surname>
          </string-name>
          .
          <article-title>Games with a Purpose for the Semantic Web</article-title>
          .
          <source>Intelligent Systems</source>
          ,
          <volume>23</volume>
          :
          <fpage>50</fpage>
          {
          <fpage>60</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>K.</given-names>
            <surname>Siorpaes</surname>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Simperl</surname>
          </string-name>
          .
          <article-title>Human Intelligence in the Process of Semantic Content Creation</article-title>
          . World Wide Web,
          <volume>13</volume>
          (
          <issue>1-2</issue>
          ),
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>P.</given-names>
            <surname>Sweetser</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Wyeth</surname>
          </string-name>
          .
          <article-title>Game ow: a model for evaluating player enjoyment in games</article-title>
          .
          <source>Computers in Entertainment</source>
          ,
          <volume>3</volume>
          (
          <issue>3</issue>
          ):
          <fpage>3</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>L. von</given-names>
            <surname>Ahn</surname>
          </string-name>
          .
          <article-title>Games with a Purpose</article-title>
          .
          <source>IEEE Computer</source>
          ,
          <volume>39</volume>
          (
          <issue>6</issue>
          ):
          <volume>92</volume>
          {
          <fpage>94</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>L. von</given-names>
            <surname>Ahn</surname>
          </string-name>
          .
          <article-title>Human computation</article-title>
          . In G. Alonso,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Blakeley</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <surname>A. L. P.</surname>
          </string-name>
          Chen, editors,
          <source>ICDE</source>
          , pages
          <article-title>1{2</article-title>
          . IEEE,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>