<!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>CityMUS: Music Recommendation When Exploring a City</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Pasquale Lisena</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lorenzo Canale</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabio Ellena</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Raphael Troncy</string-name>
          <email>troncyg@eurecom.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>EURECOM</institution>
          ,
          <addr-line>Sophia Antipolis</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Recommending Music in Urban Environments</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Linked Data makes possible the discovery of interesting connections between semantic entities that belong to di erent domains. This paper presents CityMUS, a web application that gives to the user the experience of a walk in the city with the most suitable soundtrack, on the base of the urban context. The application relies on a recommender system that searches for paths in a knowledge graph between nearby places and music composers, making use of a combination of DBpedia and domain-speci c datasets.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        musical work can be relatively poor in DBpedia (e.g. classical music often misses
information about the composer) and we therefore rely instead on the data about
their composers for nding connections. The goal is therefore to nd paths in
the DBpedia graph that connect entities that are also described in rich datasets
such as 3cixty [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] for PoIs and DOREMUS [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] for artists.
      </p>
      <p>
        Datasets Selection and Interlinking. The 3cixty knowledge base [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]
contains data about events and places from a touristic point of view. In this demo,
3cixty is used as a trusted source for POIs in Nice, retrieved through the API2.
These PoIs should be matched to DBpedia. In order to perform the
matching, we retrieved all the resources geographically located in Nice or that have
dbr:Nice as dc:subject. The labels are rstly transformed in alphabetical-only
ASCII string. Then, we interlink 3cixty PoIs to DBpedia applying a set of
similarity measures3 on labels and coordinates and choosing the one which maximise
the average score among the best 3 ones of each measure.
      </p>
      <p>
        The DOREMUS knowledge base [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] contains rich information describing
classical and contemporary music, accessible through a SPARQL endpoint4.
Among all the artist in DOREMUS, we retrieve a list of artist candidates from
an indexed full dump of DBpedia, performing a simple search by artist name.
We perform the interlinking considering the name and the birth and death dates
and checking if they belong to a class that identi es a person or an artist.
Path Finding. Retrieving paths between two entities has already been solved
by tools such as Rel nder [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] that searches the graph for possible paths with a
given depth. However, increasing the depth generates both many more possible
paths and makes the computation time prohibitive. In our context, the average
depth is quite high, and we need in average 5-6 edges to connect a PoI of Nice
to an artist. Running a query for retrieving all paths with a depth d of 6 means
in fact to retrieve all the triples in DBpedia, which at the time of writing is
composed of 8.8 billion triples. For this reason, we developed a simpli ed version
of Rel nder, that implements a bidirectional Breath First Search (BFS) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
In practice, we search for all the paths with depth d=2 of 3 from both the
source (PoIs) and the destination (artists) entities. Then, we intersect the two
sets in order to nd the common nodes, and we operate joins that recreate the
full paths. This technique reduces the complexity from O(bd) to O(bd=2), with
an exponential reduction of computation times. Moreover, we decided to not
consider changes in the direction of the edges until the common node. Finally, a
pruning is performed in order to remove cycles (repetition of the same entity in
the path) and to preserve only the shortest path for each couple of entities.
2 http://aplicaciones.localidata.com/apidocs/
3 Partial Ratio, Token Set Ratio, Token Sort Ratio, Partial Token Sort Ratio, and the
weighted combination of those (WRatio), all coming from https://pypi.python.
org/pypi/fuzzywuzzy
4 http://data.doremus.org/sparql
Path Scoring. Among all the possible paths between each PoI and artist, we
are interested not only in the short ones, but also in paths that involve exclusive
intermediate nodes, de ned as the ones that minimize the generality formula:
gen =
1 N
      </p>
      <p>
        X occ(ri)
j N j i
where ri corresponds to the ith resource of a path of length N and occ(ri) to
the number of its occurrences in all found paths. Given deepmax as the biggest
path depth (in our case, 7) and len(artist; poi) as the considered path length, we
de ne the similarity between a PoI and an artist using a combination of di erent
similarity measures [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]:
sim(artist; poi) = 1
k(
log(len(artist; poi)
log(2 (deepmax
      </p>
      <p>1)
1))
)
(1
k)gen</p>
      <p>We select 5 artists for each PoI with the highest similarity score.
3</p>
      <p>CityMUS Application and Evaluation
CityMUS Mobile Application. CityMUS is a mobile web application
available at https://citymus.doremus.org. The app uses the geo-location API for
getting the user position. The server generates then a playlist of tracks from
the artists connected to the closest 3 PoIs, with a di erent weights according
to their distance. The Spotify APIs are used in order to display and play the
tracks (Figure 1.a). The user can see the path of the song that is currently played
(Figure 1.c) and navigate the map for discovering the songs related to other PoIs
(Figure 1.b).</p>
      <p>Evaluation. The artists interlinking is evaluated by using as ground truth the
one done by ISNI5, for which the mapping is already in the DOREMUS dataset
(although not used in the interlinking task). The evaluation give us a precision
of 0.987, a recall of 0.940 and a f-measure of 0.963. For PoIs interlinking, we
consider as correct the ones in a 250 meters distance from the one retrieved
through the Google Maps API (70% of the total).</p>
      <p>About the path, we are interested to select speci c paths, which means
maximising the gen function. We prune in this way lots of paths that contain very
common resources (i.e. classes or reference to Nice as a city). In particular, the
paths we select for CityMUS contain resources that occur in average in just
0.001% of all paths after the pruning, while the highest number of occurrences
appears in the 0.04% of them.</p>
      <p>Future developments will involve the interlinking of di erent nodes in the
musical metadata (i.e. the work itself, the genre, the historical period) that can
reveal more interesting connections. A user evaluation is also planned, by adding
the possibility to rate the appropiateness of a song.
5 International Standard Name Identi er, http://www.isni.org</p>
      <p>Acknowledgments. This work has been partially supported by the French
National Research Agency (ANR) within the DOREMUS Project, under grant
number ANR-14-CE24-0020.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>M.</given-names>
            <surname>Achichi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bailly</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Cecconi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Destandau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Todorov</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Troncy</surname>
          </string-name>
          . DOREMUS:
          <article-title>Doing Reusable Musical Data</article-title>
          .
          <source>In 14th International Semantic Web Conference (ISWC)</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>M.</given-names>
            <surname>Braunhofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kaminskas</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          .
          <article-title>Location-aware music recommendation</article-title>
          .
          <source>International Journal of Multimedia Information Retrieval</source>
          ,
          <volume>2</volume>
          (
          <issue>1</issue>
          ):
          <volume>31</volume>
          {
          <fpage>44</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>P.</given-names>
            <surname>Heim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hellmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Lohmann</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Stegemann</surname>
          </string-name>
          .
          <article-title>Rel nder: Revealing relationships in rdf knowledge bases</article-title>
          .
          <source>In 4th International Conference on Semantic and Digital Media Technologies (SAMT)</source>
          , Graz, Austria,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>M.</given-names>
            <surname>Kaminskas</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          <article-title>Fernandez-Tob as</article-title>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and I.</given-names>
            <surname>Cantador</surname>
          </string-name>
          .
          <article-title>Knowledge-based music retrieval for places of interest</article-title>
          . In 2nd International ACM Workshop on
          <article-title>Music information retrieval with user-centered and multimodal strategies</article-title>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>L.</given-names>
            <surname>Meng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Huang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Gu</surname>
          </string-name>
          .
          <article-title>A review of semantic similarity measures in wordnet</article-title>
          .
          <source>International Journal of Hybrid Information Technology</source>
          ,
          <volume>6</volume>
          (
          <issue>1</issue>
          ):1{
          <fpage>12</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>A.</given-names>
            <surname>Perez-Carrillo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Thalmann</surname>
          </string-name>
          , G. Fazekas, and
          <string-name>
            <given-names>M.</given-names>
            <surname>Sandler</surname>
          </string-name>
          .
          <article-title>Geolocation-adaptive music player</article-title>
          .
          <source>In 16th International Society for Music Information Retrieval Conference (ISMIR)</source>
          , Malaga, Spain, apr
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>S.</given-names>
            <surname>Russell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Norvig</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Intelligence</surname>
          </string-name>
          .
          <article-title>A modern approach</article-title>
          .
          <source>Arti cial Intelligence</source>
          . Prentice-Hall, Egnlewood Cli s,
          <volume>25</volume>
          :
          <fpage>27</fpage>
          ,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>R.</given-names>
            <surname>Troncy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Rizzo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jameson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Corcho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Plu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Palumbo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. Carlos</given-names>
            <surname>Ballesteros Hermida</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Spirescu</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.-D. Kuhn</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Barbu</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Rossi</surname>
            ,
            <given-names>I. Celino</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Scanu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Valla</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Haaker</surname>
          </string-name>
          . 3cixty:
          <article-title>Building Comprehensive Knowledge Bases For City Exploration</article-title>
          .
          <source>Journal of Web Semantics</source>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>