<!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>Planning to learn: Recent Developments and Future Directions</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Filip Zelezny</string-name>
          <email>zelezny@fel.cvut.cz</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Czech Technical University in Prague, Faculty of Electrical Engineering Technicka 2</institution>
          ,
          <addr-line>16627 Prague 6</addr-line>
          ,
          <country country="CZ">Czech Republic</country>
        </aff>
      </contrib-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The talk will cover my lab's recent research concerning planning to learn and
discuss its relationships to relevant work of other researchers.</p>
      <p>
        I will rst introduce a machine-learning application that had motivated us
to explore how knowledge-discovery work ows could be designed automatically
using a data-mining ontology. In particular, we mined product-engineering data
such as CAD documents for structural design patterns [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. This task entailed the
orchestration of numerous data-preprocessing and machine-learning algorithms
in surprisingly complex work ows. The involved technique of sorted re nement
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] lead to non-linear, non-tree knowledge discovery work ows, in that the data
ow was forked into individually processed data streams later reuniting as inputs
to an inductive logic programming algorithm.
      </p>
      <p>
        Given the circumstances above, we wanted to see if the user could be
alleviated from composing such complex work ows manually. To this end, we started
to develop a knowledge-discovery ontology to capture the functionalities,
constraints and mutual relations among data mining algorithms. Building on
established strategies for automatic planning, we implemented a planning algorithm
that proposes a suitable work ow using knowledge represented in the ontology,
accessed by the planner through the standard SPARQL querying interface. I
will review the main concepts of the ontology and the planning task, following
mainly the paper [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        Next I will present how the mentioned developed concepts were integrated
and exploited in the machine-learning suite Orange4WS in collaboration with
the Dept. of Knowledge Technologies at the Jozef Stefan Institute in Slovenia.
This part will be based mainly on the paper [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. I will also review our latest
developments in an alternative approach to work ow planning [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], which
exploits the de nitions of some domain-speci c experience-proven work ows. Such
established work ows are viewed as initial templates, which are algorithmically
optimized by exploring their variations such as a replacement of an algorithm by
a functionally similar algorithm or by a suitable sub-work ow. These variations
are achieved by applying special graph-rewriting rules applicable to non-linear
and non-tree work ow graphs.
      </p>
      <p>
        As for related work, I will mainly discuss the relationships of the e orts above
to the knowledge-discovery ontology project KDOnto [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], the more foundational
(and less procedurally oriented) ontology OntoDM [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], and the relevant
achievements of the recent eLico project. Here, the ontology-based work ow planning
concepts [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] were integrated in the popular software tools Taverna and
RapidMiner.
      </p>
      <p>Finally, the talk will cover some selected topics, which I argue to be
worthwhile a concentrated investigation in the future. Most imporantly, I will outline
the idea of semantic meta-learning, in which a meta-learner could learn and
reason on the basis of the semantics of (object-level) data attributes. I will also
suggest to elaborate a theoretical framework in which performance indicators
for data models (such as classi er accuracies) would be jointly estimated from
validation experiments with the currently analysed data, and from accuracies of
similar models in similar previous experiments.</p>
      <p>Acknowledgements. The talk covers my joint work with Monika Zemenova, Petr
Kremen, Jir Belohradsky, Radom r Cernoch, Ondrej Kuzelka, Matej Holec, Vid
Podpecan, Igor Trajkovski, Nada Lavrac, David Monge, and C.G. Garino. I
am supported by the Czech Science Foundation through project P103/10/1875
Learning from Theories.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Zakova</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zelezny</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garcia-Sedano</surname>
            ,
            <given-names>J.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tissot</surname>
            ,
            <given-names>C.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lavrac</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kremen</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Molina</surname>
          </string-name>
          , J.:
          <article-title>Relational data mining applied to virtual engineering of product designs</article-title>
          .
          <source>In: Procs. of the 16th Int. Conf. on Inductive Logic Programming (ILP'06)</source>
          , Springer (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Zakova</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zelezny</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Exploiting term, predicate, and feature taxonomies in propositionalization and propositional rule learning</article-title>
          .
          <source>In: The 18th Eur. Conf. on Machine Learning and the 11th Eur. Conf. on Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD'07)</source>
          , Springer (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Zakova</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kremen</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zelezny</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lavrac</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          :
          <article-title>Automatic knowledge discovery work ow composition through ontology-based planning</article-title>
          .
          <source>IEEE Transactions on Automation Science and Engineering</source>
          <volume>8</volume>
          (
          <year>2011</year>
          )
          <volume>253</volume>
          {
          <fpage>264</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Zakova</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Podpecan</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zelezny</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lavrac</surname>
          </string-name>
          , N.:
          <article-title>Advancing data mining work ow construction: A framework and cases using the orange toolkit</article-title>
          .
          <source>In: Int. Workshop on Third Generation Data Mining: Towards Service-oriented Knowledge Discovery (SoKD'09)</source>
          . (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Belohradsky</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Monge</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zelezny</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Holec</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garino</surname>
            ,
            <given-names>C.G.</given-names>
          </string-name>
          :
          <article-title>Template-based semi-automatic work ow construction for gene expression data analysis</article-title>
          .
          <source>In: Proc. of the 24th Int. Sympos. on Computer-Based Medical Systems (CBMS'11)</source>
          , IEEE Computer Society (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Diamantini</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Potena</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Storti</surname>
          </string-name>
          , E.:
          <article-title>Kddonto: An ontology for discovery and composition of kdd algorithms</article-title>
          .
          <source>In: Int. Workshop on Third Generation Data Mining: Towards Service-oriented Knowledge Discovery (SoKD'09)</source>
          . (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Panov</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Soldatova</surname>
            ,
            <given-names>L.N.</given-names>
          </string-name>
          , Dzeroski, S.:
          <article-title>Towards an ontology of data mining investigations</article-title>
          .
          <source>In: Procs. of the 12th Int. Conf. on Discovery Science (DS'09)</source>
          , Springer (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Hilario</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nguyen</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Do</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Woznica</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kalousis</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Ontology-based metamining of knowledge discovery work ows</article-title>
          .
          <source>In: Meta-Learning in Computational Intelligence</source>
          . Springer (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>