<!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>Working with Ambiguous Case Representations</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Joseph Kendall-Morwick</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Washburn University</institution>
          ,
          <addr-line>1700 SW College Ave, Topeka, KS 66621</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>framework for retaining ambiguous experiential knowledge from which cases can be extracted at retrieval time. This framework is compared to and aligned with related approaches to managing complex cases and explained through the specification of a work in progress CBR system for form understanding.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Case Representation</kwd>
        <kwd>Process-Oriented Case-Based Reasoning</kwd>
        <kwd>Case-Based Design</kwd>
        <kwd>Form Understanding</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <sec id="sec-1-1">
        <title>Consider the following scenario:</title>
      </sec>
      <sec id="sec-1-2">
        <title>Simon is preparing dinner for his friends and considering his options. He wants to</title>
        <p>go with chili but knows there will be several vegetarians at the dinner. Looking
through recipes for vegetarian chili, he chooses one that features beans and smoked
peppers. He is now unsure what desert would go well with his choice of main.
He recalls the last dinner party he had been to with a smoky, earthy main dish
(burritos, in this case) had a desert, churros, that worked well. Finally, he notes
that his chili recipe contains coriander – an ingredient at least one of his guests
has an aversion to. Searching for advice, he finds a blog post for a curry recipe that
suggests substituting cumin for coriander.</p>
        <p>Computer aided cooking has been a popular domain with the CBR community, perhaps not
because we are all such bad cooks that we need a lot of computer assistance, but more so the
opposite: it serves as a salient example for applying the CBR cycle to problems with complex
case representations because we are mostly all familiar with the reasoning process. In this
example, we can see the complexity and inherent structure of the cases: dinner plans involve
individual recipes which involve individual ingredients and cooking techniques. However, in
Simon’s reasoning process, we also see how traditional notions of CBR may be challenged.</p>
        <p>The prior experience that Simon seeks to leverage comes in a number of formats. He recalls
a memory of an overall dinner plan (a case encompassing several dishes). He reads recipes
for single dishes, some he reuses entirely where the ‘solution’ of the case appears to be the
recipe itself, and others he extracts just a small element from; the ‘solution’ for his coriander
problem is simply to replace one ingredient. Simon is able to evaluate all of this experiential
knowledge and distill from it the relevant case details he needs to develop his dinner plans,
but the structure and boundaries of the ‘cases’ he leverages are not just complex (cannot be
represented with a simple feature vector), they are ambiguous (able to be interpreted in multiple
ways). Why was cumin of interest in the curry recipe and not coconut milk? Why wasn’t the
curry a solution to all of his constraints with the main dish – it also can be prepared vegetarian.
These cases could be reused in multiple ways with diferent problem descriptions to consider
and diferent solutions ofered, but these case details aren’t apparent until Simon views them
through the lens of a particular sub-task within his dinner plan that he is working on.</p>
        <p>Although this example is perhaps most relevant to case-based design, the ambiguity involved
in the scenario is apparent in many CBR domains involving complex cases, especially where
tasks are complex and involve multiple sub-tasks, or when multiple problem solving episodes
are related and directly influenced by solutions provided in prior episodes. This paper, for
example, will examine the role of ambiguity in case representations in the domain of form
understanding. However, even if this phenomenon was unique to case-based design, this paper
makes the argument that the benefit of loosening our restrictions on what it means to be a case
is beneficial. Put simply, for many problem domains involving complex cases, it is better to
take a more abstract view of the case base as a knowledge container holding experiences whose
interpretation as cases may be dependent on details of the problem to be solved.</p>
        <p>This paper isn’t introducing ambiguous cases as a brand new idea. There are many examples
of what would qualify as ambiguous cases in existing CBR literature. Furthermore, this paper
isn’t intended to be an authoritative review of ambiguous cases in prior CBR projects. However,
this paper makes several contributions:
• Several related projects are referenced to provide a broad view of ambiguous cases.</p>
        <p>Readers will be better versed in determining ambiguity present in their own CBR projects
and how to connect this ambiguity with the complexity of the task their system performs.
• This view is applied in an abstract framework intended to be compatible with and improve
existing approaches and frameworks dealing with ambiguous cases. Overall, this
framework presents a new perspective in CBR that encourages CBR researchers using complex
cases to consider how an ambiguous case representation could broaden the applicability
of their work and improve their problem solving capabilities.
• The abstract framework is illustrated through its application to the domain of document
understanding within a work in progress digitization project.</p>
        <p>The following section reviews other prior work that recommends modifications to traditional
CBR frameworks to address complex case structures and distinguishes these approaches from our
proposed perspective. In the third section, a unifying view over ambiguous cases is developed
through examination of the ambiguous qualities of complex cases used in other prior work. The
fourth section develops an abstract framework that provides a focus for implementations or CBR
frameworks looking to adopt this perspective. The fifth section introduces form understanding
as a problem domain for CBR and details how the proposed perspective will be applied through
an ongoing CBR research project implementing a case-based form understanding system. The
last section outlines conclusions and directions for future work.</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Prior Work Adapting CBR to Complex Case Structures</title>
      <p>
        It is not uncommon for CBR researchers, particularly those using complex case representations,
to consider frameworks with significant alterations to the traditional “4 R” case-based reasoning
cycle (Retrieval, Reuse, Revision, and Retention) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Working with complex cases can bring
unique challenges for comparison of cases. For example, determining subgraph isomorphism
(common when comparing graph-based complex cases) is NP-Complete [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The dificulty
of comparing complex cases, in turn, significantly impacts case retrieval, adaptation, and
retention. Because of this, CBR researchers have mitigated the impact of complex cases with
CBR frameworks that take an alternative view to the 4R cycle. Such frameworks can make it
easier to relieve storage and retrieval burdens associated with complex cases or to maximize
the benefit of the knowledge these cases contain.
      </p>
      <p>
        Eisenstadt et al. introduced FLEA-CBR to address a number of applications, but notably
case-based design tasks (in particular floor plan design with MetisCBR) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The framework
uses 4 phases (find, learn, explain, and adapt) that can be ordered in several ways. Eisenstadt et
al. developed this framework to address what they saw as the stifling sequential constraint of
the 4R cycle, particularly for creative tasks such as case-based design. While this paper also
amends the traditional definition of CBR, the primary focus is on how knowledge is structured
and interpreted within the system. This does carry implications for the CBR cycle (specifically
retrieval and retention), but does not necessarily shift away from the traditional 4R cycle as
FLEA-CBR does. Instead, there is more of a focus on the definition of the knowledge containers
utilized by a CBR system. These changes can be adopted instead of, or in addition to, any of the
proposed changes to the 4R cycle in the referenced literature.
      </p>
      <p>
        Such a focus on the knowledge containers of a CBR system to accommodate complex cases
is also not unprecedented. Cordier et al. implement an approach to acquiring adaptation
knowledge both from users and from data mining [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Klein et al. mitigate the challenges of
complex cases in the POCBR domain by maintaining retrieval knowledge augmenting the case
base [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. The proposed perspective difers mainly from these by focusing primarily on the case
knowledge container itself, how it is structured, and how it is utilized within the system. That
is, the focus is on how experiential knowledge is represented by the CBR system. However,
such extensions to traditional representations such as those suggested by this paper are also
not new and have been studied by CBR researchers. A non exhaustive selection of such work is
referenced in the following section while introducing a unifying perspective of ambiguity in
cases along with specific advice towards developing CBR systems that work with complex case
representations.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Recognizing Ambiguous Case Structures</title>
      <p>
        For the purposes of this paper, the concept of complexity in case representations will be
considered broadly to mean any significant divergence from a feature vector representation
in which a case is composed of a fixed-size vector of atomic values. In this sense, any of the
structured or semi-structured categories of representations recognized by Bergmann et al. would
be considered “complex” [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. An ambiguous case will be defined as a case having multiple
interpretations for the purpose of problem solving. Although complexity in case representations
often leads to ambiguity, they are not the same concept. This section will distinguish two
principal sources of ambiguity frequently found in complex case representations: conceptual
and compositional.
      </p>
      <p>
        Conceptually ambiguous cases contain syntactically atomic abstractions that make the case
ambiguous – that is, they contain symbols that cannot be decomposed but can be interpreted
in multiple ways, semantically. For example, in the workflow domain, Bergmann and Gil
developed a framework used in several workflow management CBR applications that provides
for a conceptual hierarchy of labels applied to graph elements [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Such cases exist in many
domains and are given many diferent names throughout the CBR literature but a common term
and perspective taken is a ‘generalized case’. Maximini et al. formally define a generalized case
as a representation of a subset of the case-space [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Bichindaritz considers various ways in
which these generalized cases are developed [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. A generalized case can be a means of case
base maintenance and case revision by retaining important qualities of a number of frequently
occurring and mostly redundant cases, either mined from the case base itself, or developed by
an expert. Although generalized cases represent more than one distinct reasoning episode and
may contain abstract components, they are still mostly recognized as a coherent case, readily
available for retrieval, and with distinct problem and solution descriptions.
      </p>
      <p>
        Compositionally ambiguous cases do not necessarily contain such abstractions, but the
boundaries of these cases may not neatly line up with a problem/solution pair. A compositionally
ambiguous case may contain multiple problems with one solution, multiple solutions with one
problem, or multiple cases entirely. They are distinct from conceptually ambiguous cases in that
the case knowledge is represented concretely and not abstractly and the source of ambiguity is
the boundary of the case rather than the concepts within it. One example is the Phala project
(Kendall-Morwick and Leake) which did not have a strict delineation between problem and
solution components of a case and instead extracted these components during the reuse phase
[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>
        Some case representations contain elements of both types of ambiguity. For example, semantic
traces of stroke management episodes used by Montani et al. contained frequent series of actions
that were abstracted in to a single “macro-action”, making the case ambiguous both in terms of
its content and concepts [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Zeyen et al. developed a system which extracted subworkflows
(workflow streams) from workflow cases and utilized them as adaptation knowledge [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
These cases also use the same semantic workflow framework previously mentioned to exhibit
conceptual ambiguity [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        Cases involving semi-structured data can typically be both conceptually ambiguous (using
more abstract terms and concepts in its descriptions) or compositionally ambiguous (conveying
numerous or otherwise structured concepts within the text). Berg et al. developed the
FEATURETAK framework to automate knowledge acquisition in the aviation domain [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Cases in
FEATURE-TAK are essentially mined from text sources but the process illustrates both the
ambiguity of their original source and how the retrieval process can be developed to extract a
leveragable case representation from a more ambiguous source.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. An Abstract Framework for Working with Ambiguous Cases</title>
      <p>Distinct from prior work, this paper suggests a framework that views the case base as a more
generalized knowledge container than a collection of discrete cases with distinct problem and
solution components. From this perspective we could instead view this knowledge container as
the experience base. This experience base (pictured in Figure 1) is the source of case knowledge
leveraged in latter phases of the 4R (or modified) cycle. This name “experience base” perhaps
implies the presence of discrete ‘experiences’; however, this framework does not require that the
content of the container necessarily be segmented in this way, nor does it require that elements
of this container also have distinct problem and solution components. However it also does
not forbid such structure. That is to say, a traditional case base still fits this framework. The
perspective simply requires that discrete cases with distinct problem and solution components
can be retrieved by some means from the experience base. The framework is considered abstract
in the sense that fewer constraints are placed on representations of experience than for a
traditional case representation, however this change does carry important implications for
retrieval and retention as described below.</p>
      <p>
        Retrieval within a system using a more generalized experience base involves not only finding
the case knowledge necessary to present cases to the reuse phase, but also assembling it in to
coherent cases. Commonly this will involve extracting cases from more ambiguous experiences,
similar to the approach taken by Kendall-Morwick and Leake [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Thus, the retrieval knowledge
of such a system would include not only traditional indexing strategies but also a view over
the experiential knowledge of the system that elicits discrete case structures ready for reuse.
In this way, the retrieval phase must be augmented to consider also “extraction” of cases from
existing experiential knowledge. The extraction component of retrieval is tied to the specifics
of the problem the system is attempting to solve, but this also means that the same experiential
knowledge can be applied to more varied problems within a system utilizing rich retrieval
knowledge that can provide multiple views over the experience base. The shared experience
base distinguishes this approach from simply developing several small CBR systems for each
sub-problem specification. Traditional case retrieval still falls within this interpretation of CBR
in which we would consider extraction to be an identity function between experiences and
cases.
      </p>
      <p>Retention is also complicated by this perspective. The case to be retained may not comprise
a new experience in the experience base and may instead involve an alteration of existing
experiences within this knowledge container. For example, a conceptually ambiguous case that
subsumes the most recent reasoning episode (as well as several prior reasoning episodes) may
be updated to better reflect a world in which the most recent case occurred (perhaps a concept
in the case becomes further abstracted). As another example, a compositionally ambiguous
case may be updated to include a portion or all of the most recent case. Or perhaps retention
is deferred to a time in which multiple cases have been resolved and are ready to be retained
collectively as a new experience in the experience base. This component of the retention phase
is referred to as “generalization”, and again, traditional case retention could fit this perspective
by simply performing no generalization on revised cases.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Exploring Ambiguous Case Structure in Case-Based Form</title>
    </sec>
    <sec id="sec-6">
      <title>Understanding</title>
      <p>This perspective on CBR is explored through early work to develop a case-based form
understanding system. This system is being developed as part of a project to digitize four decades
of physical documents used by the Computer Information Sciences department at Washburn
University and organize the information contained in these documents in a database. Forms are
the focus of this efort due to the structural nature of these documents that can be exploited by
CBR techniques.</p>
      <p>It’s worth noting that a project of this nature undertaken by an organization such as the
CIS department will benefit from the frequent occurrence of common document formats (for
example, internal course enrollment permission forms), allowing for carefully developed
domainspecific solutions and limiting the need for a sophisticated case-based approach. However, the
department’s records are primarily a test case for a project intended for personal use by the
general public. Individuals in their own personal lives collect a large number of disparate forms
containing important information for that individual that can be dificult to retrieve in situations
where that information can be important (medical issues, tax audits, etc), making for a more
compelling problem to which CBR can be brought to bear. Furthermore, unlike a computer
science department, most individuals do not have access to professional programmers that can
tailor software solutions to digitizing their personal files, thus highlighting the public benefit of
such an open source software project.</p>
      <p>This project is a work in progress. As of the time of this writing, scanning is currently
ongoing and source code for the form understanding system is being developed. The abstract
framework introduced in this paper, however, has been implemented through the development
of sub-problem specifications described in later subsections.</p>
      <p>
        While document scanning at Washburn University is ongoing, initial work in this project
is being performed with the FUNSD data set developed by Jaume et al. [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. This data set
contains 199 scanned documents containing form data from a variety of domains (ex. marketing,
advertising, scientific). Each scanned document is paired with ground truth JSON encoded data
containing a list of semantic entities (text and other data visually grouped together in the form).
Entities are labeled as headers, questions, answers, or other depending on their role within the
form. An example from this data set is pictured in Figure 2.
      </p>
      <p>Jaume et al. additionally recognize three primary sub-tasks for which the data set provides
training and testing data: text detection, text recognition, and form understanding, the last
of which is split in to word grouping, semantic entity labeling, and entity linking. While
various ML techniques are also applicable to these tasks, the opportunities for CBR, particularly
utilizing the framework presented in this paper, are identified for two components of the form
understanding problem along with two additional sub-tasks (document grouping and document
classification).</p>
      <p>Each sub-task will be performed either entirely manually (for evaluation purposes, the training
data of the FUNSD data set is considered manually developed cases), interactively (the system
provides a confidence score for a particular annotation and a user confirms or rejects it), or
automatically (annotations with high enough confidence scores are automatically accepted).
Results from reasoning episodes of each sub-task are retained within the experience base
through an ambiguous experience record (an ordered collection of annotated scans, henceforth
refereed to as a “document”) and reused in potentially any of the other sub-task scenarios. Tasks
can be performed in any order as the decisions recorded from any task can aid in the execution
of any other task. The diversity of sub-tasks coupled with the universal reliance on the same
experiential knowledge structure through each sub-task makes this form understanding domain
a good candidate for the implementation of the framework proposed in this paper.</p>
      <sec id="sec-6-1">
        <title>5.1. Document Reconstruction</title>
        <p>Documents within the FUNSD data set do well to capture most of the types of noise one
would encounter in a digitization project, however current progress through the Washburn
CIS digitization project has uncovered an additional sources of noise: multi page forms that
are split across several scans, forms that are duplicated in multiple scans, and multi-page scans
that contain several diferent forms. Therefore “document reconstruction” was added as an
additional task in which the page structure of the original documents is recovered from the
scans of those documents.</p>
        <p>For eficiency reasons, large stacks of physical documents are often scanned together in
duplex. After scanning, all PDFs are split in to single page files (from this point forward a “scan”
will refer to a one page file), but metadata conserving the order and grouping of the scans is
retained. A problem solving episode consists of comparing two scans not known to be related
and considering whether they are the same page, sequential pages in the same document, or
unrelated.</p>
        <p>Duplicate detection is fairly straightforward and can be performed successfully by comparing
the raw data in the scans. However, determining whether two scans are part of the same
physical document and the order they come in is more subtle and can benefit from the metadata
recorded from scanning but also annotations retained from this and other form understanding
sub-tasks described below. Cases are pairs of documents and are derived from the experience
base by splitting existing documents in to two. Queries can be generated by considering any
pair of existing documents in the experience base.</p>
      </sec>
      <sec id="sec-6-2">
        <title>5.2. Text Detection, Recognition, and Grouping</title>
        <p>The current plan is to implement these tasks with deep learning baselines evaluated through
the FUNSD project (such as Tesseract or the Google Vision API). The baselines perform well for
text detection and recognition. Word grouping involves determining what words recognized in
the scan should be considered as part of a group. FUNSD baselines consider this a clustering
problem but perform poorly against the ground truth assessment. Although there are not
current plans for a case-based approach to this task, a method improving on the baselines by
incorporating layout data and semantic annotations from other sub-tasks would be warranted
in future work.</p>
      </sec>
      <sec id="sec-6-3">
        <title>5.3. Semantic Entity Labeling and Linking</title>
        <p>This task is to assign semantic labels to known groups of words (question, answer, etc) and
determine which questions and answers are associated with each other. The first task is a
straightforward classification task. Given correctly annotated word groupings, cases are derived
from the experience base by extracting labeled word groupings along with contextual details of
the containing document. Queries can be generated from any unlabeled word grouping in any
document in the experience base.</p>
        <p>Linking labeled semantic entities involves generating cases by extracting existing linked
pairs of question-labeled and answer-labeled semantic entities as positive cases in a binary
classification task. Unlinked pairs will not be considered negative cases since, initially, most
needed labels will not be present. Confidence in linking two question and answer semantic
entities as a query will be determined from the similarity of the retrieved cases.</p>
      </sec>
      <sec id="sec-6-4">
        <title>5.4. Document Classification</title>
        <p>Classifications for documents associate them with known form types to facilitate information
extraction. Cases and queries for this task are straightforward: classified and unclassified
documents. Once word groupings are semantically labeled and linked in an unclassified document,
they can collectively be used as a basis of comparison to other classified documents for case
retrieval and reuse.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>6. Conclusions and Future Work</title>
      <p>This paper has outlined the subtle diference between complexity and ambiguity in case
representations and presented an abstract framework augmenting case representation, retrieval, and
retention that is designed to take advantage of this ambiguity in problem domains involving
complex and varied sub-tasks. The framework is explained through its relationship to prior
work and its integration in an ongoing form understanding project. As this framework only
involves a shift in how experiential knowledge is stored and retrieved, it is also compatible
with most existing alternative frameworks to the traditional 4R CBR cycle that are popular
in domains involving complex case representations. This framework is expected to enhance
the flexibility of CBR systems working in these problem domains and provide inspiration for
developers of full-featured frameworks used for design and other complex tasks.</p>
      <p>As the form understanding project is ongoing, future work will involve an analysis of the
results of the tasks described in section 5, comparing case-based approaches to machine learning
baselines. Additional work on this project is expected to further automate the process of
information extraction (for example, detecting hierarchical elements of forms and object detection).
Other future work could include a wider literature review of ambiguity in case representations.
As this framework is intended for CBR tasks with complex problem descriptions, additional
comparison of the extraction phase to problem elaboration methods as well as conversational
retrieval methods is warranted. Additionally, given that this framework involves frequent
updates to existing experiential data, rather than simply the addition and/or deletion of cases,
a comparison against studies of case base maintenance is important, as well as consideration
of the implications of managing the provenance of experiential data under this perspective.
Finally, although the form understanding project along with prior work in POCBR represents
significant diversity of application of this framework, application to new domains (potentially
creative applications, health CBR, or other design domains not mentioned) would be beneficial.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>V.</given-names>
            <surname>Eisenstadt</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.-D. Althof</surname>
          </string-name>
          ,
          <article-title>Overview of 4r cbr cycle modifications (extended version)</article-title>
          ,
          <source>in: Proceedings of the Conference on "Lernen</source>
          , Wissen, Daten,
          <source>Analysen"</source>
          , Berlin, Germany,
          <source>September 30 - October 2</source>
          ,
          <year>2019</year>
          , volume
          <volume>2454</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>230</fpage>
          -
          <lpage>240</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Cook</surname>
          </string-name>
          ,
          <article-title>The complexity of theorem-proving procedures</article-title>
          ,
          <source>in: Proceedings of the Third Annual ACM Symposium on Theory of Computing</source>
          , STOC '71,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>1971</year>
          , p.
          <fpage>151</fpage>
          -
          <lpage>158</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>V.</given-names>
            <surname>Eisenstadt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Langenhan</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.-D. Althof</surname>
          </string-name>
          ,
          <article-title>Flea-cbr - a flexible alternative to the classic 4r cycle of case-based reasoning</article-title>
          ,
          <source>in: Case-Based Reasoning Research and Development</source>
          , Springer International Publishing, Cham,
          <year>2019</year>
          , pp.
          <fpage>49</fpage>
          -
          <lpage>63</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Cordier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Gaillard</surname>
          </string-name>
          , E. Nauer,
          <article-title>Man-machine collaboration to acquire cooking adaptation knowledge for the taaable case-based reasoning system</article-title>
          ,
          <source>in: Proceedings of the 21st International Conference on World Wide Web, WWW '12 Companion</source>
          , Association for Computing Machinery, New York, NY, USA,
          <year>2012</year>
          , p.
          <fpage>1113</fpage>
          -
          <lpage>1120</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>P.</given-names>
            <surname>Klein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Malburg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bergmann</surname>
          </string-name>
          ,
          <article-title>Learning workflow embeddings to improve the performance of similarity-based retrieval for process-oriented case-based reasoning</article-title>
          ,
          <source>in: Case-Based Reasoning Research and Development</source>
          , Springer International Publishing, Cham,
          <year>2019</year>
          , pp.
          <fpage>188</fpage>
          -
          <lpage>203</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R.</given-names>
            <surname>Bergmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kolodner</surname>
          </string-name>
          , E. Plaza,
          <source>Representation in case-based reasoning</source>
          ,
          <source>The Knowledge Engineering Review</source>
          <volume>20</volume>
          (
          <year>2005</year>
          )
          <fpage>209</fpage>
          -
          <lpage>213</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>R.</given-names>
            <surname>Bergmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gil</surname>
          </string-name>
          ,
          <article-title>Similarity assessment and eficient retrieval of semantic workflows</article-title>
          ,
          <source>Information Systems</source>
          <volume>40</volume>
          (
          <year>2014</year>
          )
          <fpage>115</fpage>
          -
          <lpage>127</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>K.</given-names>
            <surname>Maximini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Maximini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bergmann</surname>
          </string-name>
          ,
          <article-title>An investigation of generalized cases</article-title>
          ,
          <source>in: Case-Based Reasoning Research and Development</source>
          , Springer Berlin Heidelberg, Berlin, Heidelberg,
          <year>2003</year>
          , pp.
          <fpage>261</fpage>
          -
          <lpage>275</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>I. Bichindaritz,</surname>
          </string-name>
          <article-title>The case for case based learning</article-title>
          ,
          <source>in: Case-Based Reasoning Research and Development</source>
          , Springer International Publishing, Cham,
          <year>2018</year>
          , pp.
          <fpage>45</fpage>
          -
          <lpage>61</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kendall-Morwick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Leake</surname>
          </string-name>
          ,
          <article-title>Facilitating representation and retrieval of structured cases: Principles and toolkit</article-title>
          ,
          <source>Information Systems</source>
          <volume>40</volume>
          (
          <year>2014</year>
          )
          <fpage>106</fpage>
          -
          <lpage>114</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S.</given-names>
            <surname>Montani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Striani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Quaglini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cavallini</surname>
          </string-name>
          , G. Leonardi,
          <article-title>Semantic trace comparison at multiple levels of abstraction</article-title>
          ,
          <source>in: Case-Based Reasoning Research and Development</source>
          , Springer International Publishing, Cham,
          <year>2017</year>
          , pp.
          <fpage>212</fpage>
          -
          <lpage>226</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>C.</given-names>
            <surname>Zeyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Malburg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bergmann</surname>
          </string-name>
          ,
          <article-title>Adaptation of scientific workflows by means of processoriented case-based reasoning</article-title>
          ,
          <source>in: Case-Based Reasoning Research and Development</source>
          , Springer International Publishing, Cham,
          <year>2019</year>
          , pp.
          <fpage>388</fpage>
          -
          <lpage>403</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>O.</given-names>
            <surname>Berg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Reuss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Stram</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.-D. Althof</surname>
          </string-name>
          ,
          <article-title>Comparing similarity learning with taxonomies and one-mode projection in context of the feature-tak framework</article-title>
          ,
          <source>in: Case-Based Reasoning Research and Development</source>
          , Springer International Publishing, Cham,
          <year>2019</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>16</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>G.</given-names>
            <surname>Jaume</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. Kemal</given-names>
            <surname>Ekenel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-P.</given-names>
            <surname>Thiran</surname>
          </string-name>
          ,
          <article-title>Funsd: A dataset for form understanding in noisy scanned documents</article-title>
          ,
          <source>in: 2019 International Conference on Document Analysis and Recognition Workshops (ICDARW)</source>
          , volume
          <volume>2</volume>
          ,
          <year>2019</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>