<!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>Concept of rule-based configurator for Auto-WEKA using OpenML</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Patryk Kiepas</string-name>
          <email>kiepas@student.agh.edu.pl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Szymon Bobek</string-name>
          <email>sbobek@agh.edu.pl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Grzegorz J. Nalepa</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>AGH University of Science and Technology</institution>
          ,
          <addr-line>al. A. Mickiewicza 30, 30-059 Krakow</addr-line>
          ,
          <country country="PL">Poland</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Despite a large amount of research devoted to improving meta-learning techniques, providing and using background knowledge for this task remains a challenge. In this paper we propose a mechanism for automatic recommendation of suitable machine learning algorithms and their parameters. We used OpenML database and use rule-based configurator to improve Auto-WEKA tool. This paper discusses the concept of our approach and the prototype tool based on the HEARTDROID rule engine being developed.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        or mean attribute entropy), and model-based information (e.g. J48 or kNN AUC). Each
of such characteristics has a different non-missing value coverage that varies from 6.5%
to 100%. We choose threshold for required values coverage to 20% to leave meaningful
meta-attributes. Missing values are filled with Amelia-II algorithm [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>Meta-knowledge combines meta-attributes from dataset characteristics with
corresponding algorithm label or ranking. We choose only fixed number of algorithms that
are taken into consideration (usually N top used in OpenML). After that we filter the
results with respect to performance and leave only the set of best algorithms. Afterwards
we consider meta-knowledge as labeled dataset. Using the WEKA J48 algorithm we
create decision tree which is converts to the XTT2 rule representation (ang. eXtended
Tabular Trees).</p>
      <p>Making recommendation We start with computing meta-attributes of new dataset by
uploading it to OpenML. Then we choose only characteristics used in created
metaknowledge. In the next step we match meta-attributes of new dataset with meta-knowledge.
This is done with use of meta-rules and rule-based configurator. The result consist of
algorithm name or ranking and set of parameters that according to the configurator fits
best the given dataset.</p>
      <p>In the third stage we reduce Auto-WEKA’s search space only to the recommended
algorithms. This is done by preparing experiment with so called XML-based BATCH
file. In that file we fill path to our new dataset in ARFF format and set up list of allowed
classifiers. Then we create an experiment and run optimization process. Result is in
form of classifier name with single set of parameters.</p>
      <p>Conclusion The main contribution of our work is a mechanism that allows to
speedup the meta-learning task by reducing search space for Auto-WEKA software with an
usage of knowledge from OpenML database. We tested our approach and the tool on
570 datasets. We built meta-knowledge using 15 most used algorithms from OpenML
focused on optimizing area under ROC. We benchmarked our best recommendations
against Random Forest method as standard criteria. In general for most datasets area
under ROC of our recommendations were higher (for 401 datasets with avg. 0:044).
For 169 datasets AUC of our suggestions were lower (avg. 0:057). It is worth to notice
that after a single setup, our system makes an instant recommendation.</p>
      <p>Our future work includes learning and gaining additional meta-knowledge during
recommendation mode, adding parameter suggestion in form of value ranges, adding
guidance for data preprocessing methods and including more data sources.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Brazdil</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giraud-Carrier</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Soares</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vilalta</surname>
          </string-name>
          , R.:
          <article-title>Meta-learning: Concepts and techniques</article-title>
          . In: Metalearning: Applications to Data Mining. Springer Publishing Company, Incorporated,
          <volume>1</volume>
          <fpage>edn</fpage>
          . (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Honaker</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>King</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blackwell</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Amelia</surname>
            <given-names>II</given-names>
          </string-name>
          :
          <article-title>A program for missing data</article-title>
          .
          <source>Journal of Statistical Software</source>
          <volume>45</volume>
          (
          <issue>7</issue>
          ),
          <fpage>1</fpage>
          -
          <lpage>47</lpage>
          (12
          <year>2011</year>
          ), http://www.jstatsoft.org/v45/i07
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Thornton</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hutter</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hoos</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leyton-Brown</surname>
          </string-name>
          , K.:
          <article-title>Auto-WEKA: Combined selection and hyperparameter optimization of classification algorithms</article-title>
          .
          <source>In: Proc. of KDD-2013</source>
          . pp.
          <fpage>847</fpage>
          -
          <lpage>855</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>