<!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>Exploring Deep Learning-Based Feature Extraction for Case-Based Reasoning Retrieval</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Zachary Wilkerson</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Indiana University</institution>
          ,
          <addr-line>Bloomington, IN</addr-line>
          ,
          <country country="US">United States</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Case-based reasoning performance is critically dependent on accurate retrieval, which in turn is supported by efective case indexing. Useful indices may be unavailable and/or dificult to generate manually, and so generating features for case indexing using deep learning is an appealing solution. This paper outlines a research plan investigating how deep learning systems may be leveraged and modified to generate high-quality features for case-based retrieval, including a methodology that explores various deep learning models, feature extraction approaches, and training considerations. It also outlines how already-published results make progress in these explorations and how future work will continue to expand upon the existing experimental foundation.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Case-Based Reasoning</kwd>
        <kwd>Deep Learning</kwd>
        <kwd>Feature Learning</kwd>
        <kwd>Hybrid Systems</kwd>
        <kwd>Indexing</kwd>
        <kwd>Retrieval</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Accurate case-based reasoning (CBR) performance derives from retrieving useful cases from the
case base, and efective retrieval depends on the quality of indices used to diferentiate cases.
Such indices may be defined through a combination of manual knowledge engineering (e.g.,
[
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]) and situation assessment. In these instances, the resulting indexing structures may both
capture key aspects of the domain and facilitate convincing explanations for humans. However,
manual knowledge engineering can be costly, and indices may be inaccurate or incomplete for
poorly understood domains or domains that lack well-defined, human-understandable features
(e.g., computer vision tasks).
      </p>
      <p>
        Methods for addressing these deficiencies have been explored in the literature through
symbolic approaches (e.g., [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]), but recent advances in deep learning (DL) make neural models
appealing to extract useful information from raw data for CBR. The resulting DL-CBR hybrid
systems ideally combine the inherent interpretability of CBR models via case presentation with
the inference/learning power of DL models. Various combinations of the two types of systems
have been researched, such as “twin systems" that leverage extracted weights from a network
model to guide CBR retrieval of explanatory cases [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and injecting CBR knowledge/structure
into DL “prototype network" systems to increase their interpretability (e.g., [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]). In particular,
hybrid systems leveraging DL models to extract features for CBR retrieval appear especially
promising (e.g., [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ]).
      </p>
      <p>However, despite the growing call to address the relative opacity of end-to-end DL systems,
and even with the relative success of DL-CBR hybridization, the numerous variables that
influence DL-based feature extraction for CBR are relatively unexplored at present. This research
aims to investigate this space to better understand how to optimize DL-CBR hybridization for
feature generation and similarity assessment for the highest possible accuracy.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Research Plan</title>
      <p>This research broadly investigates diferent variables/approaches that inform a general DL
model for feature extraction for CBR retrieval, with the overall goal of maximizing CBR retrieval
accuracy. Such extracted features may replace or supplement features developed through
manual knowledge engineering, depending on the domain.</p>
      <sec id="sec-2-1">
        <title>2.1. Research Objectives</title>
        <p>Under these broad investigation goals, this research aims to address three primary objectives:
1. Quantify how using extracted features and knowledge-engineered features in
concert may increase retrieval accuracy. In applications where some domain
knowledge is already present, extracted features may supplement existing features. Thus, it is
important to evaluate the circumstances (e.g., accuracy/comprehensiveness of
knowledgeengineered features in the domain) under which using both feature sets together is most
efective. Such an evaluation may be potentially influenced by a “curse of
dimensionality" resulting from large numbers of extracted features, independence (or lack thereof)
between knowledge-engineered and extracted features, and/or the continuous nature of
extracted features versus generally discrete knowledge-engineered ones.
2. Investigate the impact of network structures on extracted feature quality. Neural
architectures are a thoroughly-researched aspect of DL literature, and just as structure
significantly influences model performance and domain applicability, it may have a
similarly significant impact on CBR feature quality. As a necessarily incomplete list
of examples, the location of feature extraction within the network may influence the
complexity of extracted features, the DL model used may influence the way in which
features capture domain information (indeed some models may generate features that are
most applicable to certain domains/problems), and modifications to existing DL structures
(e.g., the addition/modification of layers and/or their properties) may further influence
how features are generated by the DL model.
3. Explore interplay between DL and CBR needs during network training. Previous
research on DL feature extraction for CBR retrieval operates on the plausible assumption
that useful features for end-to-end DL classification are also useful for CBR retrieval.
However, given that DL and CBR systems have diferent classification methodologies,
require diferent amounts of training data, etc., this may not always be the case. Exploring
these variables alongside developing novel implementations that focus on the coupling
of DL and CBR models (e.g., using CBR performance as a loss component to guide DL
backpropagation, and exploring methods for doing so with minimal concessions for
training eficiency) may further increase feature quality.</p>
        <p>
          Furthermore, these objectives do not operate in a vacuum. For one, the existence of
knowledgeengineered and/or extracted weights may further influence feature extraction; indeed,
DLbased weight extraction may exhibit similar patterns as feature extraction or derive from an
independent set of variables. For another, while case presentation is a useful medium for
explanation, the lack of interpretability of features extracted from DL models may limit its
efectiveness; additional per-feature explanation (e.g., [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]) and/or explanation-oriented retrieval
strategies (e.g., [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]) may be applicable to augment DL-CBR interpretability. Such projects
arguably extend beyond the doctoral research scope for this work, but they exist as potential
future research avenues and important contextual considerations for these experiments.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Methodology</title>
        <p>
          The research objectives described above are interdependent in their influence on DL feature
extraction for CBR retrieval, a fact that is underscored by current research progress to date [
          <xref ref-type="bibr" rid="ref10 ref11 ref12">10, 11,
12</xref>
          ]. My previously completed experiments have established proof-of-concept implementations
that highlight the accuracy benefits of using both knowledge-engineered and extracted features
in concert [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ], have evaluated how extracting features from diferent locations in the DL model
and extracting diferent numbers of features impact feature quality based on retrieval accuracy
[
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], and have explored how using diferent DL models for feature extraction (i.e., VGGNet,
Inception V3, and DenseNet) influence feature quality based on retrieval accuracy [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ].
        </p>
        <p>Looking ahead, the research plan going forward will continue on this foundation, with special
focus on maximizing CBR retrieval accuracy. Specifically, investigations such as integrating
CBR loss into backpropagation during training and using pretrained DL systems to minimize the
amount of training data required to establish a high-quality feature extraction model will focus
on balancing DL and CBR needs in the feature extraction process. These will be supplemented by
experimental results from finer-grained investigations on the horizon, such as exploring other
models (e.g., MLP mixers and transformers) as feature extractors, using case-based maintenance
methods to minimize case base size while still allowing for larger training data sets to increase
extracted feature quality, and/or evaluating a refined DL-CBR model(s) for a variety of image
classification domains (e.g., ImageNet, MNIST, etc.).</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Progress Summary</title>
      <p>
        Research to date has focused on establishing a conceptual foundation and
proof-of-conceptlevel implementations for DL-CBR hybridization for retrieval. The pertinent experiments
have supported a general architecture for DL-based feature extraction supporting CBR retrieval
(Figure 1) and have established the following specific conclusions in their respective publications:
1. Using extracted and knowledge-engineered features in concert can increase
retrieval accuracy [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Especially in instances where knowledge-engineered features
are useful but incomplete, supplementing the existing feature set with extracted features
can produce significant accuracy benefits.
2. Extracting features from later in the DL model frequently results in
higherquality features [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. In particular, while features have typically been extracted
immediately following convolution, ideally to capture the atomic elements of an image
(e.g., [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ]), it appears that extracting features immediately before the output layer (i.e.,
following the densely-connected layers) of a DL model produces higher-quality features.
3. There exists a “happy medium" for the number features to extract to maximize
feature quality [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. While DL models require a minimal number of trainable nodes to
converge on a solution, CBR systems can incur a “curse of dimensionality" given too many
features. As a result, optimal retrieval accuracy can be achieved at a “happy medium"
between these competing needs.
4. Feature quality derives strongly from a trade-of between model complexity and
training data requirements [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. In general, there appears to be no “catchall" model
for feature generation, especially in the data-sparse scenarios in which CBR systems are
frequently applied. Thus, more complex models are not necessarily better than simpler
models that can generalize better from less training data.
      </p>
      <p>Taken together, these conclusions support a broad foundation for DL-CBR hybridization for
retrieval that has the potential to guide future research applying DL principles to CBR. Future
work will focus on questions for further optimizations, such as integrating CBR needs into
the DL training process and maintaining a reasonable case base size while allowing for larger
training data sets to support the DL system, among other refinements and explorations.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Leake</surname>
          </string-name>
          ,
          <article-title>An indexing vocabulary for case-based explanation</article-title>
          ,
          <source>in: Proceedings of the Ninth National Conference on Artificial Intelligence</source>
          , AAAI Press, Menlo Park, CA,
          <year>1991</year>
          , pp.
          <fpage>10</fpage>
          -
          <lpage>15</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>R.</given-names>
            <surname>Schank</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brand</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Burke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Domeshek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Edelson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Ferguson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Freed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jona</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Krulwich</surname>
          </string-name>
          , E. Ohmayo,
          <string-name>
            <given-names>R.</given-names>
            <surname>Osgood</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Pryor</surname>
          </string-name>
          ,
          <article-title>Towards a general content theory of indices</article-title>
          ,
          <source>in: Proceedings of the 1990 AAAI spring symposium on Case-Based Reasoning</source>
          , AAAI Press, Menlo Park, CA,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bhatta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Goel</surname>
          </string-name>
          ,
          <article-title>Model-based learning of structural indices to design cases</article-title>
          ,
          <source>in: Proceedings of the IJCAI-93 Workshop on Reuse of Design, IJCAI</source>
          , Chambery, France,
          <year>1993</year>
          , pp.
          <fpage>A1</fpage>
          -
          <lpage>A13</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>E. M.</given-names>
            <surname>Kenny</surname>
          </string-name>
          , M. T. Keane,
          <article-title>Twin-systems to explain artificial neural networks using casebased reasoning: Comparative tests of feature-weighting methods in ANN-CBR twins for XAI</article-title>
          ,
          <source>in: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>C.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Tao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Barnett</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Rudin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. K.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <article-title>This looks like that: Deep learning for interpretable image recognition</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems</source>
          <volume>32</volume>
          ,
          <string-name>
            <surname>Curran</surname>
          </string-name>
          ,
          <year>2019</year>
          , pp.
          <fpage>8930</fpage>
          -
          <lpage>8941</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Sani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Wiratunga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Massie</surname>
          </string-name>
          ,
          <article-title>Learning deep features for kNN-based human activity recognition</article-title>
          ,
          <source>in: Proceedings of ICCBR</source>
          <year>2017</year>
          <article-title>Workshops (CAW, CBRDL, PO-CBR), Doctoral Consortium, and Competitions co-located with the 25th</article-title>
          <source>International Conference on Case-Based Reasoning (ICCBR</source>
          <year>2017</year>
          ), Trondheim, Norway, June 26-28,
          <year>2017</year>
          , volume
          <volume>2028</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>95</fpage>
          -
          <lpage>103</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Turner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. W.</given-names>
            <surname>Floyd</surname>
          </string-name>
          ,
          <string-name>
            <surname>K. M. Gupta</surname>
          </string-name>
          , T. Oates,
          <article-title>NOD-CC: A hybrid CBR-CNN architecture for novel object discovery</article-title>
          ,
          <source>in: Case-Based Reasoning Research and Development, ICCBR</source>
          <year>2019</year>
          ,
          <year>2019</year>
          , pp.
          <fpage>373</fpage>
          -
          <lpage>387</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>K.</given-names>
            <surname>Bach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Mork</surname>
          </string-name>
          ,
          <article-title>On the explanation of similarity for developing and deploying cbr systems</article-title>
          , in: FLAIRS,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D.</given-names>
            <surname>Doyle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Cunningham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bridge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Rahman</surname>
          </string-name>
          ,
          <article-title>Explanation oriented retrieval</article-title>
          ,
          <source>in: Advances in Case-Based Reasoning, ECCBR</source>
          <year>2004</year>
          , volume
          <volume>3155</volume>
          ,
          <year>2004</year>
          , pp.
          <fpage>157</fpage>
          -
          <lpage>168</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wilkerson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Leake</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Crandall</surname>
          </string-name>
          ,
          <article-title>On combining knowledge-engineered and networkextracted features for retrieval</article-title>
          ,
          <source>in: Case-Based Reasoning Research and Development, ICCBR</source>
          <year>2021</year>
          ,
          <year>2021</year>
          , pp.
          <fpage>248</fpage>
          -
          <lpage>262</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>D.</given-names>
            <surname>Leake</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wilkerson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Crandall</surname>
          </string-name>
          ,
          <article-title>Extracting case indices from convolutional neural networks: A comparative study</article-title>
          ,
          <source>in: Case-Based Reasoning Research and Development, ICCBR</source>
          <year>2022</year>
          ,
          <year>2022</year>
          , pp.
          <fpage>81</fpage>
          -
          <lpage>95</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>D.</given-names>
            <surname>Leake</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wilkerson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Crandall</surname>
          </string-name>
          ,
          <article-title>Examining the impact of network architecture on extracted feature quality for CBR</article-title>
          ,
          <source>in: Case-Based Reasoning Research and Development, ICCBR 2023 (in print)</source>
          ,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>