<!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>Preference-Based Meta-Learning using Dyad Ranking: Recommending Algorithms in Cold-Start Situations (Extended Abstract)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Dirk Schafer</string-name>
          <email>dirk.schaefer@uni-marburg.de</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Eyke Hullermeier</string-name>
          <email>eyke@upb.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, University of Paderborn</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Marburg</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Preference learning in general and label ranking in particular have been applied successfully for meta-learning problems in the past [1, 4, 3]. The bene ts of incorporating additional feature descriptions of alternatives in the context of preference learning have recently been shown for the dyad ranking framework [6]. Additional descriptions in the form of feature vectors are known in the recommender systems domain, too, where they are typically called sideinformation and used for tackling cold-start problems. These problems refer to situations where preference indicators (e.g., ratings) for new users or new items are not yet available (see Figure 1). In these situations, side-information helps by putting existing and new entities into relation. In this work, we make use Side-Information: Algorithm Parameters New Problems</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        New Parameters
New Parameters
&amp; new Problems
Fig. 1. Three kinds of cold-start problems are shown. They are characterized in that
no preference indicators are available for algorithms or problems. Side-information can
help in these situations for inferring preferences and thus recommendations.
of dyad ranking to predict a good ranking of candidate algorithms
contextualized by problem instances, assuming that algorithms exhibit a representation
in terms of a feature description. By generalizing over both, attributes of
problems as well as algorithms, it becomes possible to tackle cold-start scenarios in
which predictions are sought for algorithms that never occurred in the
training data. A similar viewpoint towards meta-learning has been taken in [
        <xref ref-type="bibr" rid="ref5 ref7">7, 5</xref>
        ],
where algorithm recommendation is tackled by means of collaborative ltering
(CF) techniques. However, in contrast to the description of users and items in
standard CF, side-information describing problems in meta-learning is usually
carefully crafted [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. As testbed, we present experimental results on the task of
genetic algorithm (GA) recommendation in the cold-start situation
corresponding to the lower right box in Figure 1. The (preference) meta-learning data set3
for this experiment consists of rankings over 72 di erent parameterized GAs
applied on the traveling salesman problem. The following leave-one-out cross
validation (LOOCV) procedure over a total number of 246 examples (problems)
and 72 GAs (referred to as labels) is applied: for a label Aj (1 j 72) the
bilinear Plackett-Luce model [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] is trained on 245 examples and is then used to
predict the ranking over all 72 labels for the left out example in two variants.
      </p>
      <p>In the rst variant (the \reference" situation), a method is trained on data
where the label Aj is part of the training set, whereas in the second variant
(the \cold start" situation) the same method is trained on data where Aj is
completely omitted. In addition to the Kendall value that is used to quantify
the quality of a predicted ranking in relation to a ground truth ranking, the
deviation between the predicted rank of Aj and the true rank is recorded.</p>
      <p>In the reference and the cold start situation, the Kendall values are almost
identical. Moreover, the average deviation from the true rank in the reference
case is 5.653 and in the cold-start scenario 5.712. These are rst encouraging
results. Future work could comprise experiments on further meta data sets and
address the development of further approaches for cold-start problems.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Artur</given-names>
            <surname>Aiguzhinov</surname>
          </string-name>
          , Carlos Soares, and
          <article-title>Ana Paula Serra. A Similarity-based Adaption of Naive Bayes for Label Ranking: Application to Metalearning for Algorithm Selection</article-title>
          . Planning to Learn Workshop (PlanLearn10) at ECAI, pages
          <volume>75</volume>
          {
          <fpage>78</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Pavel</given-names>
            <surname>Brazdil</surname>
          </string-name>
          , Christophe Giraud-Carrier,
          <string-name>
            <given-names>Carlos</given-names>
            <surname>Soares</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Ricardo</given-names>
            <surname>Vilalta</surname>
          </string-name>
          . Metalearning: Applications to Data Mining. Springer Publishing Company,
          <source>Incorporated, 1st edition</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Johannes</given-names>
            <surname>Fu</surname>
          </string-name>
          <article-title>rnkranz and Eyke Hullermeier</article-title>
          .
          <source>Preference Learning</source>
          . Springer-Verlag New York, Inc., New York, NY, USA, 1st edition,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Jorge</given-names>
            <surname>Kanda</surname>
          </string-name>
          , Carlos Soares, Eduardo Hruschka, and Andre De Carvalho.
          <article-title>A MetaLearning Approach to Select Meta-Heuristics for the Traveling Salesman Problem Using MLP-Based Label Ranking</article-title>
          .
          <source>19th International Conference on Neural Information Processing (ICONIP</source>
          <year>2012</year>
          ), 7665 LNCS:
          <volume>488</volume>
          {
          <fpage>495</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Mustafa</given-names>
            <surname>Misir</surname>
          </string-name>
          and
          <string-name>
            <given-names>Michele</given-names>
            <surname>Sebag</surname>
          </string-name>
          .
          <article-title>Algorithm Selection as a Collaborative Filtering Problem</article-title>
          .
          <source>Research report, INRIA</source>
          ,
          <year>December 2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Dirk</given-names>
            <surname>Scha</surname>
          </string-name>
          <article-title>fer and Eyke Hullermeier. Dyad Ranking Using a Bilinear Plackett-Luce Model</article-title>
          .
          <source>In Proceedings of the European Conference on Machine Learning and Principles and Practices of Knowledge Discovery in Databases</source>
          . Springer-Verlag,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>David</given-names>
            <surname>Stern</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Horst</given-names>
            <surname>Samulowitz</surname>
          </string-name>
          , Luca Pulina, and
          <string-name>
            <given-names>Universita</given-names>
            <surname>Genova</surname>
          </string-name>
          .
          <source>Collaborative Expert Portfolio Management. Arti cial Intelligence</source>
          ,
          <volume>116</volume>
          (
          <issue>3</issue>
          ):
          <volume>179</volume>
          {
          <fpage>184</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>3 Available at https://www.cs.uni-paderborn.de/fachgebiete/intelligente-systeme/</mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>