<!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>Ontologies in Support of Data Mining</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Viktor Nekvapil</string-name>
          <email>viktor.nekvapil@vse.cz</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ondrej Zamazal</string-name>
          <email>ondrej.zamazal@vse.cz</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>O ering Relevant Explanations</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Economics</institution>
          ,
          <addr-line>W. Churchill Sq.4, 130 67 Prague 3</addr-line>
          ,
          <country country="CZ">Czech Republic</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Ontologies and vocabularies are commonly used within Linked data cloud for typing individual objects. Due to their semantics, domain ontologies are used as a source of knowledge in diverse applications. Data mining phases are commonly enhanced by various forms of background knowledge, besides other things, to explain discovered patterns. Usually, domain expert is a source of such explanations. The aim of the proposed approach is to replace domain expert and o er explanations to the results (semi)automatically using external knowledge base and ontologies. Let us use a discovered rule Region(Zlinsky) ! Loan(100 150i1 to illustrate our approach. The system generates explanations2 Region(Zlinsky) : Income(very low)3 and Region(Zlinsky) : Inf arction(very high). To compare relevancy of the explanations to the rule, we have to compare a similarity of domains of interest of terms \Loan" and \Income" to a similarity of domains of interests of terms \Loan" and \Infarction". We propose an approach to compare similarities using knowledge captured in ontologies from diverse ontology collections such as BioPortal4 or Linked Open Vocabularies (LOV) portal.5 O ering explanations to the rules using ontologies was studied e.g. in [1]. However, in our approach, the ontologies used are not created manually, but existing ones are exploited. Our approach is described in [2]. We summarize it below and introduce a newly proposed Ontology Based Relevancy Criterion (OBRC). 1. We have a knowledge base with processed external data tables (called items of knowledge) from various domains. The measure in the item of knowledge is stored as per dimension6 which we call a connecting attribute. Example item of knowledge is depicted in Table 1. The measure is average income in the 1 In Region Zlinsky, amount of loan taken by a client is 100-150 thous. CZK. 2 The approach of generating explanations is summarized in Section 2. 3 In Region Zlinsky, the average income is very low. 4 http://bioportal.bioontology.org/ 5 http://lov.okfn.org/dataset/lov/ 6 The terms measure and dimension are used as in the business intelligence domain.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Czech republic in 2016 (shortly 'Income'), stored per dimension (connecting
attribute) Region.7
2. We have a set of association rules output by a data mining system. Each rule
contains a connecting attribute (Region in the example) and other attributes.
Region (connecting attribute) Income (measure) Rank
Prague 35,1 1
Stredocesky 27,3 2
Plzensky 26,0 3
... ... ...</p>
      <p>
        Zlinsky 23,8 13
Karlovarsky 22,7 14
3. A row of the item of knowledge is retrieved as an explanation (in a form,
e.g., Region(Zlinsky) : Income(very low)) to the rule if:
(a) The connecting attribute value in the rule matches the connecting
attribute value of the row (Region(Zlinsky) in our example).
(b) The row has a very high or very low level of measure.8
(c) The row satis es the Ontology Based Relevancy Criterion (OBRC).
The motivation of enhancing the current method [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] (adding the OBRC { point
3(c) above) is the fact that the knowledge base includes thousands of items
of knowledge and the need is to asses their relevancy to the output rule. The
proposed approach of the OBRC relies on the following assumptions:
1. Ontologies express knowledge about a certain domain of interest.
2. It is possible to decide whether the terms from the rule and explanation are
present in a certain ontology.
3. If both terms from the rule and explanation are present in one ontology, they
are semantically connected, i.e., they are possibly from the same domain and
thus the explanation is relevant.9
4. The more common ontologies, the more relevant the explanation is.
The heuristic described above can be implemented using existing tools, e.g., the
LOV portal and its terms search service.10 LOV is used as one of the sources
7 The items of knowledge are extracted from the publicly available sources (statistical
o ces, ministries etc.). Nonetheless, it is possible to use any external data.
8 Here, this simulates the usual way of thinking of domain experts where the very high
or very low levels are interesting. The levels of the rows can be assigned either by
domain expert or using automated means based on ranking of the rows or based on
more sophisticated statistical methods.
9 There can be more than one attribute in the rule; we compute common ontologies for
each pair term from rule{term from explanation and weight it by number of pairs.
10 http://lov.okfn.org/dataset/lov/terms
of the OOSP tool (Online Ontology Set Picker) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] where one can use ontology
search based on lexical tokens. OOSP has been selected11 since it allows to
search for ontologies from various ontology collections such as BioPortal, LOV
and NanJing.12 In order to support this task we prepared a REST-based service
for searching of ontologies within OOSP. There are ve parameters: word to
be searched in ontologies, collection specifying a set of ontologies for searching
in, comparator specifying exact or token (fulltext) based search, entities stating
which kind of entities (classes, properties etc.) should be considered, scope means
which part of ontology should be searched through such as local names, labels
or comments.13
3
      </p>
    </sec>
    <sec id="sec-2">
      <title>The Usage Example</title>
      <p>Let us demonstrate the approach on the real data set from the nancial
services industry (FSI) domain, items of knowledge being from FSI (Flat price,
Income, Mortgage) and healthcare domain (Diabetics,14 Abortions15). The data
mining process generated several rules, one of them being Region(V ysocina) !
Loan(100 150i,16 three candidate explanations17 are retrieved:
1. Region(V ysocina) : M ortgage(very low)18
2. Region(V ysocina) : Diabetics(very low)
3. Region(V ysocina) : Abortions(very low)
As obvious, the rst explanation is relevant to the resulting rule, i.e., it is from
the FSI domain so as the attribute Loan from the resulting rule. Thus, it could
be useful for the end-user as an additional knowledge helping to explain the
resulting rule. The explanations (2) and (3) are from completely di erent domain
(healthcare) and this should be re ected by the OBRC.</p>
      <p>The results of the requests on the OOSP service are presented in Table 2. As
ontology pool we use a set of ontologies from LOV (Nov. 2017 snapshot),
OntoFarm, NanJing and Bioportal (Nov. 2017 snapshot) available from the OOSP
service.19</p>
      <p>All the 3 requests yield 2 common ontologies for the terms. To take also the
frequency of the terms from explanations (term 2) into account, relative
frequency (% of common ontologies { %CO ) is computed. For request #1, from
the 3 ontologies containing term \mortgage", 2 of them are common with the
11 However, any other similar tool for an ontology search could be used.
12 http://ws.nju.edu.cn/njvr/
13 For example, https://owl.vse.cz/OOSPservices/api/v1/search3?word=vehicle&amp;
collection=all1&amp;comparator=token&amp;entities=7&amp;scope=15
14 Average number of diabetics per regions per 100.000 inhabitants.
15 Number of abortions per regions per 100 newborns.
16 In Region Vysocina, amount of loan taken by a client is 100-150 thous. CZK.
17 They satisfy both the conditions 3(a) and 3(b) stated above.
18 In Region Vysocina, the average amount of mortgage taken is very low.
19 We also included Bioportal because of the healthcare domain.
term \loan" (which is 66%). Intuitively, this seems as a very strong correlation
between the two terms. For term 'diabetics' and 'abortions' the %CO is much
lower (7% and 6% respectively). We can then score the explanations according
to %CO and return, for example, only the top 3 to the user using some
minimum threshold for %CO (e.g. 50 %). Based on this example, we can say that
the OBRC might have the ability to distinguish between di erent domains and
thus improving the relevancy of the retrieved explanations. To support this fact,
additional experiments need to be conducted.
4</p>
    </sec>
    <sec id="sec-3">
      <title>Discussions, Conclusions and Future Work</title>
      <p>It is assumed that the knowledge base will be shared across the users from
di erent domains. This approach has several limitations. Very general ontologies
can include practically any concept even from di erent domains { this limitation
can be mitigated by the fact that the majority of ontologies in the collection
are domain-speci c. Further, the names of the terms have to be related to its
semantic meaning, which could be problematic in case of encoded column names
(e.g., CF 108). Next, there can be natural language problems: e.g., di erent
languages, di erent forms of one word (singular, plural etc.), homonyms etc.</p>
      <p>To conclude, the OBRC is useful in situations where only one word is used for
naming both the attribute and the measure. This word needs to have a semantic
meaning to utilize the OBRC. To enlarge the ability to nd relevant
explanations, more sophisticated algorithms dealing with linguistic problems need to
be deployed. That is true for the multi-word names and morphological forms of
words. For increasing the probability of nding relevant terms, dictionary of
synonyms (e.g., WordNet)20 could be used. The implementation of those algorithms
is left as a future work. More advanced methods of measuring the relevancy (e.g.,
measuring distance between the two terms) will be developed in future.
Acknowledgement OZ has been partly supported by the CSF grant no. 18-23964S.
20 https://wordnet.princeton.edu/</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Svatek</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rauch</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Flek</surname>
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Ontology-Based Explanation of Discovered Associations in the Domain of Social Reality</article-title>
          .
          <source>In: ECML/PKDD05</source>
          .
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Nekvapil</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Data Mining with Trusted Knowledge</article-title>
          . In: FedCSIS.
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Zamazal</surname>
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Svatek</surname>
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>OOSP: Ontological Benchmarks Made on the Fly</article-title>
          . In: SumPre Workshop at ESWC 2015. Portoroz, Slovenia.
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>