<!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>Computing Geo-Spatial Motives from Linked Data for Search-driven Applications</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Andreas Both</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Liliya Avdiyenko</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Christiane Lemke</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>R &amp; D, Unister GmbH Barfussgaesschen 11 Leipzig</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The Web of Data puts a vast and ever-increasing amount of information at the disposal of its users. In the era of big data, interpreting and exploiting these information is both a highly active research area and a key issue for users in industry trying to gain a competitive edge. One current problem in industry with many potential application areas is nding a common theme for varying features by generating higher level summaries. We introduce the notion of motives to describe these common themes. Motives can be identi ed for all sorts of entities such as geo-spatial regions (e.g., \cultural regions") or holidays (e.g., \winter holidays", \activity holidays"). These motives are closer to common language and human conversations than ordinary keywords. Since users prefer formulating their information needs using everyday language, which expresses their understanding of the world, the potential for a strong industrial impact for search applications can be derived. However, capturing the users' often vaguely formulated intentions and matching them to appropriate retrieval operations on the available knowledge bases is a challenging issue. Yet, it is an important step on the way of providing the best possible search experience to users. This paper presents our work in progress on computing motives for geospatial regions. Following a long term agenda, we are evaluating the requirements for identifying such motives in large data sets. At this point, we can show that out-of-the-box machine learning methods can be used on Linked Data to train a model for computation of geo-spatial motives with good accuracy.</p>
      </abstract>
      <kwd-group>
        <kwd>knowledge discovery</kwd>
        <kwd>knowledge extraction</kwd>
        <kwd>information retrieval</kwd>
        <kwd>search-driven applications</kwd>
        <kwd>machine learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        One approach is to annotate all available pieces of information with a
probability representing the con dence in this information, e.g., like it is done in
the Google Knowledge Vault [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Another approach is the (manual) annotation
of entities with properties based on the common understanding and knowledge
which an actual user would have. This has the advantage that understandable
aggregations of the data exist even if the size and complexity of the knowledge
base is increasing. Here, we use motives to describe this level of abstraction.
      </p>
      <p>
        A well-known methodology of structuring data is to model categories and
assign them to data items of the knowledge base. For example, for structuring
geo-spatial entities, a good category might be \regions where educational
institutions are located". Motives express the existence of a high relevance of the
given characteristics (e.g., \educational institutions"). Hence, a category in the
sense of a motive might be \regions well known for there educational
institutions", i.e., it is a common interpretation of a highly relevant set of entities.
In previous work, this was very successfully applied within search-driven
applications [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], in particular in the travel vertical [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The latter publication uses
geo-spatial motives (i.e., motives for geo-spatial regions) which are also of focus
in this paper. However, these approaches use motives that are manually
annotated for each entity by experts, which does not scale when faced with large and
growing knowledge bases. In this paper, we pursue a (semi-)automatic1 process
of annotating motives from user feedback using publicly available data sets.
      </p>
      <p>
        One of the crystallization points for the Web of Data is DBpedia [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] a data
set created by extracting information from Wikipedia2. Although Wikipedia is
a global knowledge base, naturally local information have to be provided by
local communities most of the time, which makes information dependent on the
di erent cultural and personal backgrounds of the contributors.
      </p>
      <p>Therefore, it can be assumed that computing a motive from DBpedia is
nontrivial and at least the following challenges need to be addressed:
1. local communities are active with a di erent intensity, e.g., there are 1.193.557
Wikipedia articles written in Polish and just 35.154 in African3 although a
similar number of people are speaking these languages,
2. the history of entity types di er with regard to culture and administrative
regions of the world,
3. (administrative) regions have varying de nitions depending on the country
they are in.</p>
      <p>
        However, the Web of Data gives us the opportunity to use further, interlinked
data sets to increase the number of available features for the considered entities.
This contribution uses Natural Earth data [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and GeoNames [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] in addition to
DBpedia [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>Additional problems appear when working with globally crowdsourced Linked
Data:
1 manual annotations are needed for the training
2 http://www.wikipedia.org
3 Fetched from www.wikipedia.org on 2015-04-20.
1. the interpretation of data might di er from region to region, e.g., the number
of educational institutions in the United Kingdom is way higher than the one
in France (following DBpedia), although the importance of higher education
can be considered as equal in both countries and the number of inhabitants
is close to equal,
2. the data is incomplete, i.e., it cannot be assumed that all entities of a type
are captured,
3. there is no certainty property available.</p>
      <p>Calculating motives or determining their presence is hence a challenging task,
as humans, naturally, will judge calculated motives by their experience, which
is in uenced by many factors such as cultural background, place of residence or
the education level. For this paper, the presence of motives was judged by an
expert committee. In an iterative process, we used machine learning techniques
to train the properties (i.e., features describing the geo-spatial motives).</p>
      <p>The paper is organized as follows: The next section presents related work.
Section 3 describes data sets used in this contribution. The idea and requirements
for motive computation are shown in Section 4, while a case study is performed
in Section 5. Finally, the paper is concluded in Section 6, where also the future
work is described.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        The vision of a machine-processable Web of Data originating from Tim
BernersLee has been described in its aspects and principles in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        While some authors point out a lack of research at the intersection between
Linked Data and machine learning [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], a number of related applications and
algorithms have been developed, often involving the DBpedia data set: [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]
describes an extension to the popular machine learning tool RapidMiner4, allowing
to integrate linked open data with conventional data sets and transparently
performing advanced data analytics, including a proof-of-concept using DBpedia
data. Web search results are clustered using DBpedia background knowledge in
[
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Contextual itemsets in DBpedia are mined in [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>
        Furthermore, nding abstractions and grouping entities in DBpedia has been
a subject of interest close to our contribution. In [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], topic modelling based
on the DBpedia graph is investigated, labeling identi ed topics with the most
promising DBpedia concept. A higher level abstraction of DBpedia entities is
generated by clustering the nely-grained categories annotated in each entity
and nding a common label in the Wikipedia category tree in [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. The
authors of [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] use the notion of domain to describe the entities and concepts of a
knowledge base with the \set of broad thematic areas, or topics, they are mostly
focused on". In contrast, our work is concerned with exibly nding higher level
characteristics of entities without having to rely on modelled concepts or
categories in the original data set.
4 http://www.rapidminer.com
      </p>
    </sec>
    <sec id="sec-3">
      <title>Background</title>
      <sec id="sec-3-1">
        <title>DBpedia</title>
        <p>
          DBpedia is a crowd-sourced community e ort to extract structured
information from Wikipedia5 and make this information available on the
Web. [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]
Hence, DBpedia [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] is a structured data set computed from the information
provided by Wikipedia. In this paper, the latest revision (without language-speci c
extension) was used. It captures the information extracted from Wikipedia in
late April / early May 2014. 4218630 entities are described within the data set
with 526256 entities having an annotated geo-spatial relation. Here only the
property http://www.georss.org/georss/point is used.6 DBpedia contains a
type system facilitating an evaluation of di erent kind of entities.
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Natural Earth</title>
        <p>
          Natural Earth is a public domain map data set (. . . ). Featuring tightly
integrated vector and raster data, with Natural Earth you can make a
variety of visually pleasing, well-crafted maps (. . . ). [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]
5 http://www.wikipedia.org
6 However, the quality of geo-spatial entities represented by the property
http://www.georss.org/georss/point is not su cient as for example major cities
of Germany like Berlin, Cologne or Hamburg do not have this relation.
        </p>
        <p>
          Hence, the main purpose of Natural Earth is to provide data required for
computing maps and their visualisation. However, the data is linked to GeoNames
[
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] and integrates available properties. The data of Natural Earth is manually
selected and curated. Although there is no guarantee for one hundred percent
correctness, the data set is expected to have a high quality. In this paper, we use
the data sets Admin 0 - Countries 7 (version 3.1.0, 1:10m scale) { containing all
kind of countries (called admin-0) of the world { and Populated Places 8 (version
3.0.0, 1:10m scale) which includes \admin-0 and many admin-1 capitals, major
cities and towns, plus a sampling of smaller towns in sparsely inhabited regions".
A visual representation of both data sets on one map is shown in Figure 1. As
mentioned earlier, crowd-sourced data might not be consistent (c.f., Section 1,
challenges). For example, considering the populated places provided by Natural
Earth, very small cities are included for some countries (e.g., Gedrus, Swiss,
population: 56819). At the same time, major cities are not available for other
regions (e.g., Halle, Germany, population: 234,107), c.f., Figure 2.
3.3
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>Geonames</title>
        <p>
          The GeoNames geographical database covers all countries and contains
over eight million placenames that are available for download free of
charge. [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]
Besides the geo-spatial location of the entities, GeoNames also provides
additional data like the population of the entities. Here, we use only the population
properties that are already linked to the Natural Earth data.
7 http://www.naturalearthdata.com/downloads/10m-cultural-vectors/
10m-admin-0-countries/
8 http://www.naturalearthdata.com/downloads/10m-cultural-vectors/
10m-populated-places/
9 source: GeoNames
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Geo-spatial Motives</title>
      <p>In this section, we will describe the properties of geo-spatial motives and collect
the requirements for their computation.</p>
      <p>
        A motive can be de ned as the reason for a search as well as particular
conditions like how much a product should cost. [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]
Hence, motives in an information retrieval context are higher-level summaries
of varying features with a common theme or topic. They are a convenient way
for a user to express search queries by using vague ideas and feelings, which are
more intuitive and less restrictive than classic keyword search. As an example,
consider the motive \winter holidays": A user is far more likely to search for
\places ideal for winter holidays" than for \places in the mountains with at
least three ski lifts, guaranteed snow from December to March and a ski rental
facilities" (which might be a common interpretation of ideal ), even though the
latter query would be easier to answer for an information retrieval system.
      </p>
      <p>Accordingly, it can be assumed that a motive for a populated place exists if
potential users will associate it with the related concept. We express the relation
by the following de nition:
De nition 1 (Geo-Spatial Motives). A geo-spatial motive P is named as
property urn:unister:has-geospatial-motive and O is an entity expressing
the motive. Hence, the triple S P O expresses the relation, where S has a property
of the type http://www.georss.org /georss/point.</p>
      <p>That is, the following fact might exist with regard the example from above:
dbpedia:Innsbruck urn:unister:has-geospatial-motive
urn:unister:-geospatial-motive:winter-holidays.</p>
      <p>As the common characteristics of geo-spatial regions as perceived by users
should be represented by a geo-spatial motive, we demand:
Requirement 1 (Requirements) A motive m should be bound to a geo-spatial
entity e if and only if m is a commonly associated characteristic of the considered
region e.</p>
      <p>Hence, with regard to our available data sets (c.f., Section 3), geo-spatial
DBpedia entities might be annotated with their type as motive if they are well-known
within the considered country.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Case Study</title>
      <p>In a case study, we will show how di erent data sets containing di erent features
in uence the quality of a trained model for the computation of motives. For the
evaluation, we choose the education motive as it is present in most of the
countries and can be interpreted for countries without being part of the local
community. That is, populated places should be annotated with this motive if and only
if they are well-known for their educational institutions with regard to the
country they are located in. This limits the selection of relevant DBpedia entities to
entities of the type http://dbpedia.org/ontology/EducationalInstitution,
hereafter called educational entities. The extracted entities are shown in Figure
3 to give a visual impression. Moreover, populated places are considered if and
only if there is at least one educational entity nearby10.
5.1</p>
      <sec id="sec-5-1">
        <title>Data Sets</title>
        <p>For our experiments, we used DBpedia, Natural Earth's populated places and
countries, as well as the GeoNames data set. In addition, we annotated several
new features that should be useful for detecting the education relevance of
populated places. First, using DBpedia, we calculated the number of educational
entities within a radius x = 10, 25 and 50 km for every populated place (these
features will be further referred as entities nearby xkm). Adding information
from the Natural Earth data set, which contains states and countries in which
the populated places lie, it is possible to derive more sophisticated statistics:
{ the maximum of the number of educational entities nearby x km over
populated places in a country (referred as max of places within xkm)
{ the maximum of the number of educational entities over states in a country
(referred as max of states)
10 The maximal radius of the considered bu er around a populated place is de ned by
50 km derived following an educated guess.
{ the number of educational entities in the country (referred as e in country)</p>
        <p>Figure 4 presents histograms that illustrate the number of populated places
with a certain number of educational entities within the radius of 10, 25 and 50
km. As one can see, almost all places have up to 10 20 entities within 10 km,
whereas the distribution of places with entities within 50 km is more at. Thus,
many places have relatively few educational entities nearby, which could be an
evidence for their low education relevance. However, as the Wikipedia community
in some countries might be not very strong, it is also possible that not all entities
are represented within the data set (we leave this for later evaluation).
The joined data set of populated places was labeled by several quali ed experts.
Given the name of a populated place, its state and the country, they classi ed
the place as \highly relevant" (ranking r = 2), \intermediately relevant" (r = 1)
or \irrelevant" (r = 0) for the education in the country of this place. Up to
now, we employed three experts in the age range of 30 38. Two of them have
doctoral degrees in philosophy and mathematics, respectively. In addition, they
have working experience in academia. The third person is currently a member of
the international Masters programme in archaeology and has performed studies
at several international universities. Therefore, we assume that their quali cation
helped them to label data as objectively as possible.</p>
        <p>The experts were provided with a data set of 2000 places from 171 countries.
They were free to rate only places which are known to them. As a result, there
are 881 labeled data samples from 121 countries available for our experiments.
As data classi cation by experts is time consuming, in the future we might infer
place labels using various ranking lists of educational institutions.
5.3</p>
      </sec>
      <sec id="sec-5-2">
        <title>Methodology</title>
        <p>The main questions under investigation are twofold:
1. Can one use machine learning techniques on features of linked data for
computing motives?
2. Is it bene cial to aggregate data from di erent sources?
We investigated these questions by building classi ers for motive computation
and comparing their accuracy while iteratively increasing the number of data
sets and features used.</p>
        <p>
          In the rst step, the expert ratings were merged. The resulting rating of a
place is just the average of all available ratings giving a continuous value [0; 2].
As the number of labeled populated places is rather small, the ratings were
converted into binary values. Thus, a place can have a rating of either \relevant"
or \irrelevant" for the education in its country, corresponding to the initial ranges
[0; 1) and [1; 2], respectively. In this way, the classi cation problem is simpli ed
to account for the limited amount of training data. Data preprocessing and
classi cation were done in Weka [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ], an open source machine learning software.
        </p>
        <p>
          As baseline for our experiments, we used existing and annotated DBpedia
features of populated places. Of course, this data set is at least required to make
a statement about the educational strength of a place. The second data set
was formed by merging the extended DBpedia data set with data from Natural
Earth's populated places and countries as well as features that we calculated
using this data (see Section 5.1). Finally, the third data set extends the second
one by GeoNames attributes of populated places. These data sets will be further
referred as D1, D2 and D3, respectively. Thus, all three data sets contain 881
populated places which are described by di erent features. Table 1 presents
features that were included in every data set, see Table 3 for the meaning of used
Natural Earth and GeoNames features. These lists are not complete and contain
only features that were regarded as relevant for classi cation by the
correlationbased feature selection algorithm [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. Note that the pop max feature has been
throttled down to the United Nations estimated metro population for the ca. 500
largest urban areas in the world11.
        </p>
        <p>
          As a classi er, we picked Breiman's random forest [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], which was chosen as
the best classi cation model in terms of the F-measure and the accuracy by the
cross-validation process for all data sets (see Table 5 for details). It should be
noted that the choice of a classi er is not important for the present work. Our
aim is rather to show that it is possible to automatically detect motives in data
and that the accuracy of such detection can be improved by merging the data
from several sources.
5.4
        </p>
      </sec>
      <sec id="sec-5-3">
        <title>Evaluation and Discussion</title>
        <p>Table 2 presents evaluation metrics of classi ers build on di erent data sets
(Table 4 gives the detailed explanation of the analyzed metrics). All metrics are
11 c.f.,
http://www.naturalearthdata.com/downloads/10m-cultural-vectors/10mpopulated-places/
averaged over 200 runs. For every run, the original corresponding data set with
881 samples was randomized and divided into a training and a testing set
containing 66% and 34% of the original data, respectively. Despite the fact that the
classi cation accuracy is not perfect, in our opinion, the results are promising.
One can clearly see the classi er built on D3, the data set containing DBpedia,
Natural Earth and GeoNames data, achieving the best results. Moreover,
enriching DBpedia data only with the features from Natural Earth improves the
classi cation performance drastically. Though, the di erence between D2 and D3 is
not large, all metrics achieved on D3 are signi cantly better that those achieved
on D2 according to the Wilcoxon signed-rank test at the p-level= 0:05. Adding
just a single feature from GeoNames, gn pop, it is possible to achieve the higher
values of the accuracy and the F-measure, which illustrates the general classi er
performance and its performance w.r.t. the positive class only, respectively. This
means that using features of D3, one can classify both educationally relevant
and irrelevant populated places more precisely. Thus, one obviously pro ts from
merging various data sets while trying to automatically detect motives. Many
data sets, if merged properly, provide a large pool of features that can be useful
for detecting di erent motives.</p>
        <p>Detailed evaluation results of the classi er trained on D3 are presented in
Table 6 in the appendix. The table contains metrics of 5 runs for every class
separately and their weighted average. Note that training data is highly unbalanced
having 30% educationally relevant and 70% irrelevant populated places. This
fact explains the di erence in values of the evaluation metrics for two classes.</p>
        <p>Note that the feature selection process, which was run on D2, selected our
annotated features as relevant for classi cation. Moreover, it seems that
information over all distances, 10, 25 and 50 km, is relevant, which might account
for di erences between regions with the diverse population density. Therefore,
we assume that including more features concerning local geo- and demographic
statistics will help to improve the classi cation accuracy.
6</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusion and Future Work</title>
      <p>Making knowledge bases searchable is a key challenge considering the data
economics. Hence, both academics and industry have to increase their e ort to
make knowledge bases accessible for actual (human) users. Geo-spatial motives
are one approach to enable end-users to connect their common sense of the world
knowledge with the actual representation within the knowledge base.</p>
      <p>In this paper, we presented and evaluated geo-spatial motives, an approach
for a more general and exible representation of the data available in knowledge
bases. With these geo-spatial motives, we will push the available data towards
better understandability and aim for better search-driven applications.</p>
      <p>We have shown that machine learning techniques on Linked Data can be
used for computing geo-spatial motives. Moreover, it seems crucial to include
the knowledge of di erent data sets for good quality of the calculated motives.
Despite the di erent challenges triggered by the properties of the available data
sets, it was possible to achieve a promising motive detection quality within the
considered case study. Therefore, we can assume that industrial search-driven
applications can take advantage of knowledge bases in the Web of Data to provide
a more human-friendly interaction.</p>
      <p>However, this paper is just one step on our research agenda working towards
knowledge bases that can be used and be of bene t for both experts and
nonexperts. In the future, we will evaluate the capabilities of di erent knowledge
bases and generalize our approach with the aim of preventing a training for all
expected motives. Instead, we will establish mechanisms that work by analogy.
Of great impact might be the integration of di erent levels of geo-spatial regions
like admin-1 entities (states, provinces) of Natural Earth12 to increase the quality
and to extend the considered motives from populated places to natural regions
like the Alps (e.g., winter sports) or the Silicon Valley (e.g., IT companies).
Finally, it has to be evaluated how the di erent personal backgrounds of users
(e.g., education level, cultural background, age) is in uencing their perception
of motives.</p>
      <p>Acknowledgments We thank Luise Erfurth, Stephan Schwinger,
Bernd Eickmann and Kristin Mittag for their valuable support. This
work has been supported by grants from the European Union's 7th
Framework Programme provided for the project GeoKnow (GA no.
318159).
12 http://www.naturalearthdata.com/downloads/10m-cultural-vectors/
10m-admin-1-states-provinces/
Shortcut Meaning
worldcity indicates whether a city is important for the global economics
pop max the population of the city metropolitan area
rank max a population rank calculated based on pop max
max aremi a metropolitan area of the city in squared miles</p>
      <p>gn pop the city population according to the GeoNames</p>
      <p>Class TP Rate FP Rate Precision F-Measure AUC Accuracy
relevant 0.514 0.097 0.627 0.565 0.842 0.809
irrelevant 0.903 0.486 0.854 0.878 0.842 0.809
weight. avg. 0.809 0.392 0.799 0.802 0.842 0.809
relevant 0.513 0.117 0.6 0.553 0.815 0.789
irrelevant 0.883 0.487 0.842 0.862 0.815 0.789
weight. avg. 0.789 0.392 0.780 0.783 0.815 0.789
relevant 0.494 0.086 0.672 0.569 0.826 0.803
irrelevant 0.914 0.506 0.834 0.872 0.826 0.803
weight. avg. 0.802 0.395 0.791 0.792 0.826 0.803
relevant 0.467 0.107 0.593 0.522 0.804 0.786
irrelevant 0.893 0.533 0.833 0.862 0.804 0.786
weight. avg. 0.785 0.426 0.773 0.776 0.804 0.786
relevant 0.488 0.082 0.684 0.569 0.849 0.803
irrelevant 0.918 0.513 0.831 0.872 0.849 0.803
weight. avg. 0.802 0.397 0.791 0.791 0.849 0.803
0.797 0.400 0.787 0.789 0.827 0.798</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Auer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hellmann</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>The web of data: Decentralized, collaborative, interlinked and interoperable</article-title>
          . In: Calzolari,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Choukri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Declerck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Dogan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.U.</given-names>
            ,
            <surname>Maegaard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Mariani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Odijk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Piperidis</surname>
          </string-name>
          , S. (eds.)
          <source>Proceedings of the Eight International Conference on Language Resources and Evaluation (LREC'12)</source>
          .
          <source>European Language Resources Association (ELRA)</source>
          , Istanbul, Turkey (May
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kobilarov</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Auer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Becker</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cyganiak</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hellmann</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Dbpedia-a crystallization point for the web of data</article-title>
          .
          <source>Web Semantics: science, services and agents on the world wide web 7</source>
          (
          <issue>3</issue>
          ),
          <volume>154</volume>
          {
          <fpage>165</fpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Bloem</surname>
          </string-name>
          , P., de Vries, G.K.:
          <article-title>Machine learning on linked data, a position paper. Linked Data for Knowledge Discovery p</article-title>
          .
          <volume>69</volume>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Both</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Keck</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nguyen</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Henkens</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kammer</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Groh</surname>
          </string-name>
          , R.:
          <article-title>Get Inspired: A visual divide and conquer approach for motive-based search scenarios</article-title>
          .
          <source>In: 13th International Conference WWW/Internet</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Breiman</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Random forests</article-title>
          .
          <source>In: Machine Learning</source>
          . pp.
          <volume>5</volume>
          {
          <issue>32</issue>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6. geographical database, G.: http://www.geonames.org/, accessed 2015-
          <volume>03</volume>
          -15
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7. DBpedia.org: http://dbpedia.org/, accessed 2015-
          <volume>03</volume>
          -15
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Dong</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gabrilovich</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heitz</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horn</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lao</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Murphy</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Strohmann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Zhang, W.:
          <article-title>Knowledge vault: A web-scale approach to probabilistic knowledge fusion</article-title>
          .
          <source>In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining</source>
          . pp.
          <volume>601</volume>
          {
          <fpage>610</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Earth</surname>
          </string-name>
          , N.: http://www.naturalearthdata.com/, accessed 2015-
          <volume>03</volume>
          -15
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Hall</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frank</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Holmes</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pfahringer</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reutemann</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Witten</surname>
            ,
            <given-names>I.H.</given-names>
          </string-name>
          :
          <article-title>The weka data mining software: An update</article-title>
          .
          <source>SIGKDD Explor. Newsl</source>
          .
          <volume>11</volume>
          (
          <issue>1</issue>
          ),
          <volume>10</volume>
          {18 (Nov
          <year>2009</year>
          ), http://doi.acm.
          <source>org/10</source>
          .1145/1656274.1656278
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Hall</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          :
          <article-title>Correlation-based feature selection for machine learning</article-title>
          .
          <source>Tech. rep., Hamilton</source>
          , New Zealand (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Hulpus</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hayes</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karnstedt</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Greene</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Unsupervised graph-based topic labelling using dbpedia</article-title>
          .
          <source>In: Proceedings of the sixth ACM international conference on Web search and data mining</source>
          . pp.
          <volume>465</volume>
          {
          <fpage>474</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Keck</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Herrmann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Both</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gaertner</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Groh</surname>
          </string-name>
          , R.:
          <article-title>Improving motivebased search</article-title>
          . In: Streitz,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Stephanidis</surname>
          </string-name>
          , C. (eds.) Distributed, Ambient, and Pervasive Interactions,
          <string-name>
            <surname>LNCS</surname>
          </string-name>
          , vol.
          <volume>8028</volume>
          , pp.
          <volume>439</volume>
          {
          <fpage>448</fpage>
          . Springer Berlin Heidelberg (
          <year>2013</year>
          ), http://dx.doi.org/10.1007/978-3-
          <fpage>642</fpage>
          -39351-8_
          <fpage>48</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Isele</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jakob</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jentzsch</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kontokostas</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mendes</surname>
            ,
            <given-names>P.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hellmann</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morsey</surname>
            , M., van Kleef,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Auer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , et al.:
          <article-title>DBpedia{a large-scale, multilingual knowledge base extracted from wikipedia</article-title>
          .
          <source>Semantic Web</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Paulheim</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ristoski</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mitichkin</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Data mining with background knowledge from the web</article-title>
          .
          <source>RapidMiner World</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Rabatel</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Croitoru</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ienco</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Poncelet</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Contextual itemset mining in dbpedia</article-title>
          . In: 1st Workshop on
          <article-title>Linked Data for Knowledge Discovery (LD4KD) colocated with ECML PKDD'2014: The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases</article-title>
          . vol.
          <volume>1232</volume>
          , pp.
          <source>http{ceur. CEUR</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Schuhmacher</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ponzetto</surname>
            ,
            <given-names>S.P.</given-names>
          </string-name>
          :
          <article-title>Exploiting DBpedia for web search results clustering</article-title>
          .
          <source>In: Proceedings of the 2013 workshop on Automated knowledge base construction</source>
          . pp.
          <volume>91</volume>
          {
          <fpage>96</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Titze</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bryl</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zirn</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ponzetto</surname>
            ,
            <given-names>S.P.:</given-names>
          </string-name>
          <article-title>DBpedia Domains: augmenting DBpedia with domain information</article-title>
          .
          <source>In: Proceedings of the 9th Language Resources and Evaluation Conference (LREC</source>
          <year>2014</year>
          )
          <article-title>(</article-title>
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>