<!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>Overview of the 4R CBR Cycle Modifications (Extended Version)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Viktor Eisenstadt</string-name>
          <email>viktor.eisenstadt@uni-hildesheim.de</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Klaus-Dieter Althof</string-name>
          <email>klaus-dieter.althof@dfki.de</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>German Research Center for Artificial Intelligence (DFKI) Trippstadter Strasse 122</institution>
          ,
          <addr-line>67663 Kaiserslautern</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Hildesheim, Institute of Computer Science Samelsonplatz 1</institution>
          ,
          <addr-line>31141 Hildesheim</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The currently most well-known approach to apply case-based reasoning (CBR) to an application or a concept is to use the 4R cycle that consists of the steps Retrieve, Reuse, Revise, and Retain. Being a widely accepted synonym for CBR, the classic setting of the 4R cycle became a dominant basis for CBR-based systems during the last decade. However, since its introduction in 1994, multiple modifications of the original cycle were developed as well, mostly with the purpose to add additional features that might be useful in specific application situations or to provide an alternative CBR solution that might be suitable for an entire domain and related domains. In this paper, we present an overview of the most notable CBR cycle modifications. We provide a description of the main features for each selected modification, and then compare them using a number of specific criteria. A special emphasis in this work will be put on Explainable AI (XAI) integration as one of the most recent trends in artificial intelligence. This work is an extended version of the 'Related Work' section of our ICCBR 2019 conference paper [5] that presents a flexibility-enhanced version of 4R. The main goals of this paper are to provide a researcher with a comfortable overview of the most relevant and interesting CBR cycle modifications and to discuss the future of the 4R CBR cycle.</p>
      </abstract>
      <kwd-group>
        <kwd>Case-based reasoning</kwd>
        <kwd>Survey</kwd>
        <kwd>CBR cycle</kwd>
        <kwd>Modification</kwd>
        <kwd>Retrieval</kwd>
        <kwd>Explainable AI</kwd>
        <kwd>Adaptation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Most applications that use case-based reasoning (CBR) as their underlying
structure implement the CBR’s most well-known mode of operation in the form
of the ‘4R’ cycle that consists of the steps Retrieve (search for the most similar
Copyright © 2019 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).
cases), Reuse (adaptation of the solution of the most similar case to the current
problem), Revise (check for correctness of the adaptation), and Retain (saving
of the accepted solution together with the problem as a separate case in the
case memory). The 4R cycle was introduced by Aamodt and Plaza in 1994 [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
as a result of development of the CBR research area that emerged from the
idea of dynamic memory by Schank [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. Since then, because of their versatility
and adaptability of use, the 4 R-steps became a widely used approach basis for
CBR-based applications and also a synonym for CBR itself. In Figure 1, the
original order of execution of the 4 R-steps is shown.
      </p>
      <p>The usage of the 4R cycle, however, difers from application to application:
some of them use the cycle only partly (that is, a partial use of a subset of the
R-steps is implemented, e.g., only Retrieve+Reuse), whereas other systems make
use of all steps to achieve their goals. Furthermore, in some very specific use
cases, the 4R cycle underwent structural changes to comply with requirements of
its domain of use, i.e., it was structurally modified/edited to contain additional
steps or to reorganize or summarize some of the original steps. This paper is
intended to provide an overview of the most interesting modifications, presenting
the most well-known as well as lesser known ones. Additionally, our goal is to
retrace the development and use of the 4R cycle for diferent domains and tasks.</p>
    </sec>
    <sec id="sec-2">
      <title>Retrieve</title>
    </sec>
    <sec id="sec-3">
      <title>Reuse</title>
    </sec>
    <sec id="sec-4">
      <title>Retain</title>
    </sec>
    <sec id="sec-5">
      <title>Revise</title>
      <p>This paper is structured as follows: first, we give a short explanation of what
exactly we consider a CBR cycle modification, providing a diference between a
modification and a hybrid approach. In Section 3, we provide a description of
main features for each of the selected modifications and rate them with criteria,
such as modification strength , versatility of use, integration of explainability, and
future-proveness. In Section 4, we discuss the questions arising from the results
of this work and conclude this paper.
2</p>
      <sec id="sec-5-1">
        <title>What is a Modification?</title>
        <p>To define what we will consider a modification of the CBR cycle in this paper,
we decided to follow the approach we are best familiar with: the modification of
objects or approaches in computer programming. For example, a modification of
an algorithm or simply of the source code.</p>
        <p>
          Usually, a modification of an object is defined as inserting, deleting, or
summarizing of its properties (in our case: the steps of the 4R cycle), the same
is valid for algorithms and/or the source code, where the reasonable reordering
during the refactoring of the code can also be considered a modification. Based on
these considerations, we defined the following criteria for the examined approaches
to be counted as a 4R modification:
1. The modification, as described above, should originate from the 4R CBR cycle
and not from the alternative CBR cycles or procedures (e.g., by Hunt [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]
or by Leak [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]). The alternative cycles or procedures do not count as a
modification as well. The modification also should not originate from another
modification.
2. The hybrid approaches will not be considered, in order to focus the survey only
on the four R-steps and reduce the scope. The hybrid approaches combine
CBR with other AI methods (e.g., artificial neural networks), usually without
modification of the cycle itself. However, if the situation occurs in which it
will not be possible to definitely determine if the approach is a hybrid or a
4R modification, then the decision will be made in favor of modification.
3. If the approach identifies itself as a 4R modification it will be included, but
with a remark that (one of) the two criteria above were not met.
3
        </p>
      </sec>
      <sec id="sec-5-2">
        <title>The 4R Cycle Modifications</title>
        <p>
          This section contains the selected, most notable, CBR cycle modifications. All of
them were already shortly mentioned in a comparison table of modifications in
the ‘Related Work’ section of our work on FLEA-CBR, a flexibility-enhanced
extension of the 4R cycle [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. Besides the criteria already used in that paper, that
is, the versatility of use and integration of XAI, for this extended version we added
two additional criteria: modification strength ( major, middle, or minor) and an
estimation of the potential of the approach for use in the future considering the
current AI trends.
3.1
        </p>
        <sec id="sec-5-2-1">
          <title>CBR-based Recipe Recommender IntelliMeal (Skjold and Øynes 2017)</title>
          <p>
            The most recent modification approach we present in this survey is an integral part
of the cooking recipe recommender IntelliMeal [
            <xref ref-type="bibr" rid="ref20">20</xref>
            ] developed at the Norwegian
University of Science and Technology (NTNU) in 2017. This approach was
developed in the context of other applications created for the Computer Cooking
Contest (CCC, a regular competition of the ICCBR conference). IntelliMeal uses
the CBR framework MyCBR [
            <xref ref-type="bibr" rid="ref4">4</xref>
            ] to manage the case base and its underlying
data model and to conduct retrieval of similar cases, i.e., recipes with ingredients.
The main goal of the approach, identically to other CCC approaches [
            <xref ref-type="bibr" rid="ref2 ref3 ref9">2, 3, 9</xref>
            ], is
not to find the most similar recipe to the given one, but to create a new one by
adapting the instances of the case base to the query recipe.
          </p>
          <p>To achieve this goal, IntelliMeal makes use of all steps of the 4R cycle, but
does not execute them in the original order, instead, three additional steps are
inserted that break the 4R order to enhance the cycle with the following actions
(see also Figure 2)1:
– Separation of the query into desired and undesired attributes, i.e., ingredients
(inserted before Retrieve).
– Setting up of an ephemeral case base after Reuse that contains already adapted
cases but excludes cases with high similarity to the undesired attributes.
– Retrieval in the ephemeral case base for the following recipe revision process.</p>
          <p>
            The middle modification approach of IntelliMeal cannot be considered versatile
or universal as it is clearly bound to the cooking domain, especially the adaptation
process is very domain-specific. There is also no explanation facility available.
However, the system can be considered future-proof as its structure allows for
conversion into, e.g., a GAN-based [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ] approach where one artificial neural network
can adapt the recipes and other rate them to estimate its success.
          </p>
          <p>Query
separation</p>
          <p>Retrieve in
case base</p>
          <p>Reuse
Retain</p>
          <p>Revise</p>
          <p>Create
ephemeral
case base
Retrieve in
ephemeral
case base
1 In this and other Figures of this paper, grey boxes indicate non-original cycle steps.
3.2</p>
          <p>
            Neocortex-inspired Decision Support System CHAMPION
(Hohimer et al. 2011)
The framework CHAMPION [
            <xref ref-type="bibr" rid="ref10">10</xref>
            ], developed at the Pacific Northwest National
Laboratory (Washington, USA), aims at providing a human neocortex-inspired
cognitive architercture for decision support that is based on a hierarchically
constructed system of intelligent agents.
          </p>
          <p>The mode of operation of CHAMPION includes a modification of the classic
4R cycle, which is used as the internal mechanism of the agents of the system. The
higher ranked group agents (in CHAMPION denoted as AMCs: Auto-associative
Memory Columns) reason on a knowledge base unit, denoted by a sub-grah of the
entire knowledge graph, in order to draw conclusions from solved problems and
insert them into the base graph. ACMs can choose the knowledge unit of interest.
Another group of agents works with the raw data and passes the extracted entities
to the working memory of the approach from which the ACM base graph is
constructed using the ontology rules.</p>
          <p>CHAMPION significantly modifies the 4R order as it completely replaces the
Retrieve phase with the Reason phase during which no retrieval in the case base
takes part, instead, the corresponding agent applies description logic (DL) in
order to rate the self-performed classification of the new case: if the classification
was correct, the afterwards produced solution is then retained in the case base.
After that it is analyzed in the Review phase, which is a new addition to the
cycle as well: during this phase (and the subsequent Revise) a statistical analysis
takes place whose result can improve the further classification processes. The
modified 4R CBR cycle of CHAMPION is shown in Figure 3.</p>
          <p>Reason</p>
          <p>Retain</p>
          <p>Review</p>
          <p>Revise</p>
          <p>CHAMPION is one of the few approaches presented in this work that can
be considered versatile or universal. The authors of this major modification do
not explicitly bind the system to one particular domain, therefore, taking the
neocortex-inspired nature of CHAMPION into account, the approach can be
considered an alternative to the currently existing cognitive architectures.</p>
          <p>
            An explanation feature is not available in CHAMPION, but for the future,
the approach can set a goal to be extended with a component that can provide
explainable representation of the graph reasoning.
coTag: Case-based Retrieval of Similar Code Passages
(Roth-Berghofer and Bahls 2008)
The system coTag [
            <xref ref-type="bibr" rid="ref16">16</xref>
            ] was developed at the Technical University of
Kaiserslautern (Germany) to help software developers tag and retrieve similar source
code snippets using the corresponding plugin for the integrated development
environment (IDE) Eclipse. A specific property of coTag is that it is able to
detect the user’s, i.e., the developer’s, context too, so that the most relevant code
passages can be found and presented.
          </p>
          <p>coTag uses the CBR cycle similarly to the traditional way, however, significant
changes were applied to the steps Reuse, Revise, and Retain. The first two were
replaced with the phases Explain and Customise.</p>
          <p>Explain is responsible for scrutinizing of the retrieval results, giving the user
concrete insights to the similarity assessment. Diferent scrutinizing types are
available, e.g., an explanation of similarity between tag sets or an explanation
for the trigram similarity between tags.</p>
          <p>The phase Customise allows for customization of user-generated similarity
measures, providing a possibility to correct the similarity assessment process for
subsequent retrievals. These subsequent search processes are executed as part
of Retain, where the corrected similarity measure is saved in the case base and
then used for the next retrieval process of this context. The modification of the
4R cycle implemented in coTag is shown in Figure 4.</p>
          <p>Retrieve</p>
          <p>Explain</p>
          <p>Customise</p>
          <p>Retain</p>
          <p>Unlike other approaches presented in this paper, coTag contains an explicit
explanation feature that is used to explain the similarity assessment of the
previous step Retrieve. This makes the major modification used in coTag unique,
nevertheless, technically bound to the domain of software development.</p>
          <p>
            The approach can be considered future-proof as, for example, the Retrieve
and Retain phases can be replaced by a summarizing step where a recurrent
neural network (RNN) suggests the next coding step in the current context.
The authors of this work [
            <xref ref-type="bibr" rid="ref6">6</xref>
            ] propose an extension of the original 4R cycle with
the Repartition step that is responsible for the reorganization of the case base of
the system in order to separate the entire case base in diferent, more specific
case bases, based on the similarity relation between solutions and problems. The
model was developed at the Bond University in Australia.
          </p>
          <p>Before presenting their modification, the authors of R 5 give a short overview
of the (then) available CBR models (i.e. not only the 4R cycle but also its
predecessors and contemporary alternatives), providing a foundation for their
research on the topic of CBR cycle extension. The author’s main claim for
modification of the cycle is that the problems and solutions were not examined
as separate entities and the similarities between all problems and all solutions
were not used to make up a case base.</p>
          <p>The R5 approach presented by Finnie and Sun reorganizes the original case
base by examining problems and solutions separately, seeking the similarity
relations between them and creating a number of separate case bases. This
Repartition step is placed between Revise and Retain to save the currently solved
and revised case in the correct case base. The authors also claim that this helps
to improve Retrieve efectively, as the case base with the most similar cases will
likely deliver the most acceptable solution to the new problem.</p>
          <p>Retrieve</p>
          <p>Reuse</p>
          <p>Revise
Repartition
of case base
Retain</p>
          <p>
            The minor modification R 5 presented in [
            <xref ref-type="bibr" rid="ref6">6</xref>
            ] does not contain any explanation
feature, however, taking into account that this work is focused on the management
task of the organization of case bases, it is understandable that none is provided
as the users of the system based on R5 will likely be interested in, e.g., how the
similarity was calculated and not how the current database is organized. It is an
universal approach as the authors do not provide any domain-specific features in
the corresponding paper.
          </p>
          <p>The R5 model can also be seen as future-proof, or, more exactly,
independent of current trend constraints, as it provides a methodology for case base
reorganization, but does not include any implementation or concrete constraints.
3.5</p>
          <p>
            Q-chef: Generation of Surprising Cooking Recipes with CBR
and Deep Learning (Grace et al. 2016)
The system Q-chef [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ], developed at the University of North Carolina in Charlotte,
employs a double-cycle structure to generate surprising cooking recipes. Similar
to IntelliMeal [
            <xref ref-type="bibr" rid="ref20">20</xref>
            ] (see also Section 3.1), Q-chef is one of the many applications
of CBR in the creative cooking domain. Unlike the other systems presented in
this work, the approach of Q-chef is not an entirely pure CBR solution: it makes
use of deep learning as one of its collaborative key components as well.
          </p>
          <p>The mode of operation of Q-chef consists of execution of two subsequent
cycles whose goal is to create a surprising but plausible recipe for the user. The
user can provide the desired features as components and the grade of creativity.
Both cycles operate on the same case base.</p>
          <p>The grade and the components are then fed to the first cycle, in Q-chef called
the problem framing, where the deep learning model determines the plausibility
and potential of surprising for the given requirements, based on the past recipes
from the case base.</p>
          <p>In the second cycle, the problem solving phase takes place, where the original
order of the 4R cycle is executed, including the retrieval for similar recipes in the
case base and the adaptation based on the results of the first cycle. The result of
the approach execution is a surprising recipe that corresponds to the criteria set
by the user.</p>
          <p>
            In the corresponfing work [
            <xref ref-type="bibr" rid="ref8">8</xref>
            ], the Q-chef system itself is not described as a
4R modification, and can probably also be seen as a hybrid approach. However,
it can definitely count as a modification if the first cycle will be considered an
additional or a pre-phase of 4R.
          </p>
          <p>Q-chef’s major modification does not provide an explanation step or
component, being clearly bound to the CBR creativity in cooking approach, it is also
not versatile. However, it can be considered future-proof, taking the increasing
number of CBR+deep learning combination approaches during the last years. As
a possible improvement, the user rating (i.e., if the final recipe was surprising or
not) can be included as a feature of the deep learning model.
3.6</p>
          <p>
            Case Base Maintenance Extension with Review and Restore
(Roth-Berghofer and Iglezakis 2001, Roth-Berghofer 2003)
The 4R CBR cycle modification that enhances the case base maintenance was
developed by Roth-Berghofer and Iglezakis [
            <xref ref-type="bibr" rid="ref15">15</xref>
            ] and in Roth-Berghofer’s PhD
thesis [
            <xref ref-type="bibr" rid="ref17">17</xref>
            ]. It was also further developed by Reinartz et al. [
            <xref ref-type="bibr" rid="ref14">14</xref>
            ].
          </p>
          <p>Maintenance is an important phase whose task is to keep the case base free
of redundant or irrelevant cases so that it contains relevant and unique cases as
complete as possible. The approach turns the 4R cycle efectively into a 6R cycle,
adding the phases Review and Restore to the cycle.</p>
          <p>
            These two phases take care not of the case base only, but also of other
knowledge containers (i.e., vocabulary, similarity measures, and adaptation rules).
The work of Reinartz et al. [
            <xref ref-type="bibr" rid="ref14">14</xref>
            ] (the basis of the description of 6R in this paper),
however, concentrates only on the case base maintenance. Both new phases are
positioned after the Retain step. 6R is one of the older and more well-known
modification approaches and had a high influence on the CBR maintenance
research area.
          </p>
          <p>During the Review phase the quality measurement of the cases in the case
base takes place that produces a specific quality value for each available case. A
monitoring service can then be used to enable specific operators that track the
quality of the cases and inform the subsequent Restore component that some of
them do not correspond to the quality and consistency criteria of the system.</p>
          <p>The Restore step, receiving this information, applies a number of specific
modification operators to edit the cases and/or remove them in order to keep
the quality level of the cae base.</p>
          <p>Furthermore, both new steps are part of the new Maintenance sub-cycle/phase
(together with Retain), other steps build the Application sub-cycle. Figure 6
shows both phases and the steps they contain.</p>
          <p>Retrieve</p>
          <p>Reuse</p>
          <p>Revise
Restore</p>
          <p>Review</p>
          <p>Retain</p>
          <p>Given its nature as an approach that was developed to improve the CBR
cycle in order to enhance the contemporary CBR maintenance research, 6R’s
middle modification can be considered fully universal and can be used with any
domain. The explanations features, however, are neither available nor planned to
be included. The future development of the approach can include the combination
with deep learning for the Review phase, where the classification of the case into
the quality classes (i.e., the assignment of a quality value) can be improved.
4</p>
        </sec>
      </sec>
      <sec id="sec-5-3">
        <title>Discussion and Conclusion</title>
        <p>The closing section of this paper aims at questioning the current development
of case-based reasoning applications and concepts and so initiate a discussion
on the following questions, taking the 4R cycle modifications described in the
previous sections as an inspiration foundation:
4.1</p>
        <p>
          Questions for Discussion
– Is the 4R CBR cycle still the best way to give structure to a CBR application
or can a modification of it, e.g., one of the named above or a completely new
one, be at least a competitor in the field of CBR resarch and development?
– Being CBR’s long-time go-to approach, the 4R cycle has established itself
as the basic standard of CBR, but can it hold this position? Or maybe the
new AI directions (GANs, deep CNNs [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ], transfer learning [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ],
responsible/explainable AI etc.) require a modified (modern) approach?
– If not a modification, but a completely new restructured alternative is required:
which approach or direction of the current AI and/or cognitive science, besides
4R itself, should be considered highly potential to be the main influence?
– Identically to the ideas of Schank: whose or which ideas or research work
should play the biggest role? Can one of the older alternatives, e.g., one of
the named in Section 2, be relevant again?
4.2
        </p>
        <sec id="sec-5-3-1">
          <title>Conclusion</title>
          <p>In this paper, we presented an overview of the 4R CBR cycle modifications that
can provide a foundation to discuss the questions named above. The presented
modifications extend, edit, or reorder the traditional order of execution – Retrieve
→ Reuse → Revise → Retain – and so provide a tailored solution for a specific
task or a domain or can be used universally for any domain. Most probably, the
future of modifications depends on the future of CBR itself: the more new CBR
approaches and application domains appear, the higher are the chances that new
modifications will be developed.</p>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Aamodt</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Plaza</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Case-based reasoning: Foundational issues, methodological variations, and system approaches</article-title>
          .
          <source>AI</source>
          communications
          <volume>7</volume>
          (
          <issue>1</issue>
          ),
          <fpage>39</fpage>
          -
          <lpage>59</lpage>
          (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Cordier</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dufour-Lussier</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lieber</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nauer</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Badra</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cojan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gaillard</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Infante-Blanco</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Molli</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Napoli</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , et al.:
          <article-title>Taaable: a case-based system for personalized cooking</article-title>
          .
          <source>In: Successful Case-based Reasoning Applications-2</source>
          . pp.
          <fpage>121</fpage>
          -
          <lpage>162</lpage>
          . Springer (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>DeMiguel</surname>
          </string-name>
          , J.,
          <string-name>
            <surname>Plaza</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Díaz-Agudo</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Colibricook: A cbr system for ontologybased recipe retrieval and adaptation</article-title>
          .
          <source>In: ECCBR Workshops</source>
          . pp.
          <fpage>199</fpage>
          -
          <lpage>208</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <source>DFKI GmbH: myCBR 3 tutorial information for ICCBR</source>
          <year>2012</year>
          (
          <year>2012</year>
          ), http:// mycbr-project.net/downloads/myCBR_3_tutorial_slides.pdf
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Eisenstadt</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Langenhan</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Althof</surname>
          </string-name>
          , K.D.:
          <article-title>Flea-cbr - a flexible alternative to the classic 4r cycle of case-based reasoning</article-title>
          .
          <source>In: International Conference on Case-Based Reasoning (ICCBR-2019)</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Finnie</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>R5 model for case-based reasoning</article-title>
          .
          <source>Knowledge-Based Systems 16(1)</source>
          ,
          <fpage>59</fpage>
          -
          <lpage>65</lpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Goodfellow</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pouget-Abadie</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mirza</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Warde-Farley</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ozair</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Courville</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Generative adversarial nets</article-title>
          .
          <source>In: Advances in neural information processing systems</source>
          . pp.
          <fpage>2672</fpage>
          -
          <lpage>2680</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Grace</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maher</surname>
            ,
            <given-names>M.L.</given-names>
          </string-name>
          , Wilson,
          <string-name>
            <given-names>D.C.</given-names>
            ,
            <surname>Najjar</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.A.</surname>
          </string-name>
          :
          <article-title>Combining cbr and deep learning to generate surprising recipe designs</article-title>
          .
          <source>In: International Conference on Case-Based Reasoning</source>
          . pp.
          <fpage>154</fpage>
          -
          <lpage>169</lpage>
          . Springer (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Hanft</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ihle</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bach</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Newo</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mänz</surname>
          </string-name>
          , J.:
          <article-title>Realising a cbr-based approach for computer cooking contest with e: Ias</article-title>
          . In: ECCBR Workshops. pp.
          <fpage>249</fpage>
          -
          <lpage>258</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Hohimer</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Greitzer</surname>
            ,
            <given-names>F.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Noonan</surname>
            ,
            <given-names>C.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Strasburg</surname>
            ,
            <given-names>J.D.</given-names>
          </string-name>
          : Champion:
          <article-title>Intelligent hierarchical reasoning agents for enhanced decision support</article-title>
          .
          <source>In: STIDS</source>
          . pp.
          <fpage>36</fpage>
          -
          <lpage>43</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Hunt</surname>
          </string-name>
          , J.:
          <article-title>Evolutionary case based design</article-title>
          . In: Watson,
          <string-name>
            <surname>I.D</surname>
          </string-name>
          . (ed.)
          <source>Progress in CaseBased Reasoning</source>
          . Springer Berlin Heidelberg, Berlin, Heidelberg (
          <year>1995</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Leake</surname>
            ,
            <given-names>D.B.</given-names>
          </string-name>
          :
          <article-title>Case-Based Reasoning: Experiences, lessons and future directions</article-title>
          . MIT press (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Pan</surname>
            ,
            <given-names>S.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          :
          <article-title>A survey on transfer learning</article-title>
          .
          <source>IEEE Transactions on knowledge and data engineering</source>
          <volume>22</volume>
          (
          <issue>10</issue>
          ),
          <fpage>1345</fpage>
          -
          <lpage>1359</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Reinartz</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Iglezakis</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roth-Berghofer</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Review and restore for case-base maintenance</article-title>
          .
          <source>Computational Intelligence</source>
          <volume>17</volume>
          (
          <issue>2</issue>
          ),
          <fpage>214</fpage>
          -
          <lpage>234</lpage>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Roth-Berghofer</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Iglezakis</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Six steps in case-based reasoning: Towards a maintenance methodology for case-based reasoning systems</article-title>
          .
          <source>In: Proceedings of the 9th German Workshop on Case-Based Reasoning</source>
          . pp.
          <fpage>198</fpage>
          -
          <lpage>208</lpage>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Roth-Berghofer</surname>
            ,
            <given-names>T.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bahls</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Code tagging and similarity-based retrieval with mycbr</article-title>
          .
          <source>In: International Conference on Innovative Techniques and Applications of Artificial Intelligence</source>
          . pp.
          <fpage>19</fpage>
          -
          <lpage>32</lpage>
          . Springer (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Roth-Berghofer</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Knowledge Maintenance of Case-based Reasoning Systems: The SIAM Methodology</article-title>
          .
          <article-title>Dissertationen zur künstlichen Intelligenz</article-title>
          , Aka - Akademische
          <string-name>
            <surname>Verlagsgesellschaft</surname>
          </string-name>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Schank</surname>
            ,
            <given-names>R.C.</given-names>
          </string-name>
          :
          <article-title>Dynamic memory: A theory of reminding and learning in computers and people</article-title>
          , vol.
          <volume>240</volume>
          . Cambridge University Press Cambridge (
          <year>1982</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Simonyan</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zisserman</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Very deep convolutional networks for large-scale image recognition</article-title>
          .
          <source>arXiv preprint arXiv:1409.1556</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Skjold</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Øynes</surname>
            ,
            <given-names>M.S.</given-names>
          </string-name>
          :
          <article-title>Case-Based Reasoning and Computational Creativity in a Recipe Recommender System</article-title>
          .
          <source>Master's thesis</source>
          ,
          <source>NTNU</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>