<!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>What is Special about Bethlehem, Pennsylvania?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Benjamin Schafer</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Petar Ristoski</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Heiko Paulheim</string-name>
          <email>heikog@dwslab.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Mannheim, Germany Research Group Data and Web Science</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Most Linked Data browsers list all facts about an entity in an equal manner. In this paper, we present a prototype for identifying unexpected facts about entities, i.e., those facts that deviate from the expectations. To that end, we use an attribute-wise method for anomaly detection, which is also capable of providing qualitative explanations for the anomalies found. By comparing an entity at hand to a reference set of similar entities, we can provide information on how the entity at hand di ers from the typical patterns found for similar entities, and display those unexpected facts together with a short explanation.</p>
      </abstract>
      <kwd-group>
        <kwd>DBpedia</kwd>
        <kwd>Data Exploration</kwd>
        <kwd>Anomaly Detection</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Many linked data browsers display lists of facts about an entity at hand without
a particular notion of order or importance [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. While some approaches exist for
ranking the existing information [
        <xref ref-type="bibr" rid="ref1 ref3">1, 3</xref>
        ], the top ranked facts for an entity are
often the trivial ones (e.g., Bethlehem, Pennsylvania is a City ).
      </p>
      <p>A slightly di erent problem is the search for unexpected or surprising facts.
Rather than ranking facts by their importance, ranking by unexpectedness
requires a notion of the usual state of an entity. To that end, an entity needs to be
compared to a reference set of similar entities, and the typical patterns
underlying the entities in that set have to be identi ed. Then, unexpected facts can be
identi ed as those facts of an entity which strongly deviate from the patterns.</p>
      <p>In this demonstration, we introduce a prototype for nding unexpected facts
in DBpedia.1 Starting from selecting a DBpedia entity, the user can de ne the
reference set and is then presented a number of unexpected facts. The rst results
with selected entities look promising.
The basic work ow of the tool comprises four steps, as depicted in Fig. 1. In the
rst step, the user selects a DBpedia entity to analyze. This step is supported
1 Available online at http://topfacts.informatik.uni-mannheim.de/
1</p>
      <sec id="sec-1-1">
        <title>Entity</title>
      </sec>
      <sec id="sec-1-2">
        <title>Selection</title>
        <p>Lookup
2</p>
      </sec>
      <sec id="sec-1-3">
        <title>Reference Set</title>
      </sec>
      <sec id="sec-1-4">
        <title>Selection</title>
        <p>categories
3</p>
      </sec>
      <sec id="sec-1-5">
        <title>Anomaly</title>
      </sec>
      <sec id="sec-1-6">
        <title>Detection</title>
        <p>attribute-wise
model learning
4</p>
      </sec>
      <sec id="sec-1-7">
        <title>Presentation of Facts</title>
        <p>ABC
verbalized rules
by DBpedia Lookup and its autocomplete function.2 For example, the entity
dbpedia:Bethlehem, Pennsylvania is selected.</p>
        <p>
          Once the entity is selected, the user has to select a reference set of entities to
compare to. To that end, all YAGO types, which form a much richer hierarchy
than the DBpedia ontology types [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], are retrieved.3 All types that have between
20 and 1,000 entities can be used as a reference set.4 In our example, the user
may, e.g., select the class yago:CitiesInPennsylvania.
        </p>
        <p>
          In the next step, the reference set is retrieved. For each entity, an attribute
vector is created, using attributes such as datatype properties and direct types.
Based on those feature vectors, an individual anomaly score for each attribute is
computed using the ALSO approach [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. This approach learns a predictive model
for each attribute from all other attributes. Then, it computes the anomaly score
for each attribute value based on the deviation between the actual value and the
value predicted by the model, and the predictive strength of the model. For
building the models, we use the rule variant of M5' [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].
        </p>
        <p>
          Finally, for all attributes that have a high anomaly score, the nding is
output as the models' justi cation for expecting a di erent value, ordered by the
respective anomaly score. An example output is shown in Fig. 2. Following the
details on demand paradigm [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], the single statements which are involved in the
justi cation are shown upon request.
        </p>
        <p>Since the output would also show quite a few statements that are not
unexpected facts, but mere errors in DBpedia, we lter out those rules referring to
statements which are inconsistent with the DBpedia ontology.</p>
        <p>
          For implementing the prototype, we use RapidMiner server5 with the Linked
Open Data extension [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
3
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Example Findings</title>
      <p>In this section, we show some interesting example ndings for di erent resources
and reference sets.
2 http://lookup.dbpedia.org
3 DBpedia delivers YAGO types as well, so no separate linkage to YAGO is required.
4 The numbers have been chosen for having a reference set that is big enough for
discovering some meaningful patterns, and at the same time small enough to be
processed in real time.
5 http://www.rapidminer.com
Bethlehem, PA compared to Cities in Pennsylvania: Bethlehem is one of the
oldest places in Pennsylvania, being founded in 1741. Furthermore, most cities
in Pennsylvania are not a founding place of any organization, but Bethlehem is
the founding place of Lehigh University Press.</p>
      <p>Pennsylvania compared to States of the US: For Pennsylvania, we nd that it has
some uncommon characteristics for the US founding states6: it is unusually large
(119,283 square kilometers, with only New York being larger), has an unusually
large maximum elevation (Mount Davis with 979m), and an unusually low area
covered with water (2.7%).</p>
      <p>Black Swan compared to Ballet Films: It is unusual, e.g., that Black Swan is an
Academy Award winning ballet lm. Futhermore, ballet lms are usually not
thrillers.</p>
      <p>Trent Reznor compared to American Heavy Metal Singers: Unlike other heavy
metal singers, Reznor is also a piano player and has written various lm scores.
Joanne K. Rowling compared to British Billionaires: Rowling is the only female
among the British billionaires, and one of the rare supporters of the Labour
party.
4</p>
    </sec>
    <sec id="sec-3">
      <title>Conclusion and Outlook</title>
      <p>In this paper, we have introduced a prototype which identi es unexpected facts
about DBpedia entities. We compare an entity to a reference set of similar
entities, and identify those facts which deviate from the patterns that are typical
for the reference set.</p>
      <p>While rst anecdotal ndings are promising, a full user evaluation, also
contrasting di erent presentation variants, still has to be conducted. Such an
evaluation should, ideally, try to de ne and capture the human notion of
unexpectedness, which, however, is not trivial.</p>
      <p>
        In our prototype, we have so far used direct types, numeric datatype
attributes, and relations as features. Other features, such as relations to
individuals or quali ed relations [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], might even lead to more ndings, but come at the
cost of a dimensionality explosion, and, hence, problems with realtime
processing. Thus, some mechanism for on-the- y feature selection would be required.
Furthermore, the impact of the choice of di erent rule learning algorithms and
heuristics would be interesting to explore.
      </p>
      <p>For de ning the reference set, we have only used YAGO categories so far. It
would be interesting to also allow more sophisticated restrictions, e.g., compare
a city to other cities in the same range of inhabitants.</p>
      <p>In summary, the demo shows a novel way of interacting with Linked Data
and identifying facts which are interesting to the user.
6 Although this was not the contrast set we chose, many of the rules found refer to
the founding states.</p>
      <p>Acknowledgements
The work presented in this paper has been partly funded by the German
Research Foundation (DFG) under grant number PA 2373/1-1 (Mine@LOD).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. Gong Cheng, Thanh Tran, and
          <string-name>
            <given-names>Yuzhong</given-names>
            <surname>Qu</surname>
          </string-name>
          .
          <article-title>Relin: relatedness and informativenessbased centrality for entity summarization</article-title>
          .
          <source>In Proceedings of the 10th International Semantic Web Conference (ISWC2011)</source>
          , pages
          <fpage>114</fpage>
          {
          <fpage>129</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Aba-Sah Dadzie</surname>
            and
            <given-names>Matthew</given-names>
          </string-name>
          <string-name>
            <surname>Rowe</surname>
          </string-name>
          .
          <article-title>Approaches to visualising linked data: A survey</article-title>
          .
          <source>Semantic Web</source>
          ,
          <volume>2</volume>
          (
          <issue>2</issue>
          ):
          <volume>89</volume>
          {
          <fpage>124</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Li</surname>
            <given-names>Ding</given-names>
          </string-name>
          , Rong Pan, Tim Finin, Anupam Joshi, Yun Peng, and
          <string-name>
            <given-names>Pranam</given-names>
            <surname>Kolari</surname>
          </string-name>
          .
          <article-title>Finding and ranking knowledge on the semantic web</article-title>
          .
          <source>In Proceedings of the 4th International Semantic Web Conference (ISWC2005)</source>
          , pages
          <fpage>156</fpage>
          {
          <fpage>170</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Heiko</given-names>
            <surname>Paulheim</surname>
          </string-name>
          and
          <article-title>Johannes Furnkranz. Unsupervised Generation of Data Mining Features from Linked Open Data</article-title>
          .
          <source>In International Conference on Web Intelligence</source>
          , Mining, and
          <source>Semantics (WIMS'12)</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Heiko</given-names>
            <surname>Paulheim</surname>
          </string-name>
          and
          <string-name>
            <given-names>Robert</given-names>
            <surname>Meusel</surname>
          </string-name>
          .
          <article-title>A Decomposition of the Outlier Detection Problem into a Set of Supervised Learning Problems</article-title>
          .
          <source>Machine Learning</source>
          , (
          <volume>2</volume>
          -3):
          <volume>509</volume>
          {
          <fpage>531</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>John</given-names>
            <surname>Quinlan</surname>
          </string-name>
          .
          <article-title>Learning with continuous classes</article-title>
          .
          <source>In 5th Australian Joint Conference on Arti cial Intelligence</source>
          , volume
          <volume>92</volume>
          , pages
          <fpage>343</fpage>
          {
          <fpage>348</fpage>
          .
          <string-name>
            <surname>Singapore</surname>
          </string-name>
          ,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Petar</given-names>
            <surname>Ristoski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Christian</given-names>
            <surname>Bizer</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Heiko</given-names>
            <surname>Paulheim</surname>
          </string-name>
          .
          <article-title>Mining the Web of Linked Data with RapidMiner</article-title>
          .
          <source>Journal of Web Semantics</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>Ben</given-names>
            <surname>Shneiderman</surname>
          </string-name>
          .
          <article-title>The eyes have it: A task by data type taxonomy for information visualizations</article-title>
          .
          <source>In IEEE Symposium on Visual Languages</source>
          , pages
          <volume>336</volume>
          {
          <fpage>343</fpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Fabian</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Suchanek</surname>
            , Gjergji Kasneci, and
            <given-names>Gerhard</given-names>
          </string-name>
          <string-name>
            <surname>Weikum</surname>
          </string-name>
          .
          <article-title>Yago: a core of semantic knowledge</article-title>
          .
          <source>In 16th international conference on World Wide Web</source>
          , pages
          <volume>697</volume>
          {
          <fpage>706</fpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>