<!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>DL-CBR Hybridization for Feature Generation and Similarity Assessment</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, 47408</addr-line>
          ,
          <country country="US">United States</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Efective retrieval is essential to strong case-based reasoning performance, and retrieval quality is critically dependent on case indexing. Such indices are not always feasible to generate manually, and so a thorough exploration of how features and weights may be generated automatically (especially using deep learning) is necessary. To that end, this summary outlines a research plan for investigating structural influences on feature quality, how learned features may be used in concert with knowledge-engineered features, and how weights may be generated in feature-dense spaces created by feature learning. It also proposes a methodology for modular exploration of various models, training set sizes, numbers of features generated, etc., to provide a comprehensive foundation of index generation using deep learning. Finally, it points to already-published research that works towards some of these goals and illustrates how results from these existing projects inform future research plans.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Case-based reasoning</kwd>
        <kwd>Deep learning</kwd>
        <kwd>Hybrid systems</kwd>
        <kwd>Feature learning</kwd>
        <kwd>Weight learning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Case-based reasoning (CBR) performance relies significantly on retrieving useful cases from the
case base. In turn, retrieval quality depends on indices used to characterize/discriminate between
cases. High-quality indices can be derived through manual knowledge engineering (e.g., [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]),
but this approach can be costly and is not feasible in some domains. For example, indexing
vocabularies may be unsatisfactory for poorly-understood domains or for complex tasks such
as computer vision. An analogous challenge exists for weights as well–efective feature weights
can augment feature information for indexing, but even provided a comprehensive feature set,
it can be dificult and/or expensive to identify useful weighting information for those features.
      </p>
      <p>
        These problems may be addressed using feature and weight learning. Initially, this was
achieved using symbolic methods (e.g., [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]); however, with recent advances in deep learning (DL,
esp. in domains such as computer vision), it is natural to consider how increased performance of
DL architectures may be translated to CBR retrieval. Specifically, CBR systems can be described
as inherently interpretable via case presentation, but black-box DL systems are traditionally
viewed as more accurate for most domains; however, if a CBR system can be made more
accurate by leveraging DL methods/structures, then resulting DL-CBR hybrid systems may
be applicable to a wide variety of domains, representing a “best of both worlds" with regards
to accuracy and explainability (e.g., “Twin systems" by Kenny and Keane in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]). In this vein,
recent research leverages neural networks to generate and refine feature information inferred
from training examples for classification and/or explanation [
        <xref ref-type="bibr" rid="ref5 ref6 ref7">5, 6, 7</xref>
        ], but there still exist many
areas of potential DL-CBR integration for which there has been little or no research exploration.
      </p>
      <p>This research summary outlines strategies for exploring feature and weight learning using
DL in greater depth, presenting both a blueprint detailing potential research objectives and
methodologies as well as an overview of steps taken so far and the resulting publications.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Research Objectives and Methodology</title>
      <p>This research broadly seeks to deeply explore methods for leveraging DL models to generate
indexing information to supplement or replace information gathered through knowledge
engineering for computer vision-related tasks. This overarching goal can be subdivided into the
four primary investigation regions described below, which are followed by a proposed research
plan outline for exploring them.</p>
      <sec id="sec-2-1">
        <title>2.1. Exploring Methods for Generating High-Quality Features</title>
        <p>
          Under the umbrella of network-based feature generation, there exist multiple potential variables
that can influence feature quality. For one, diferent model structures provide unique pathways
for feature generation, exemplified by diferent computer vision approaches (e.g., comparing
AlexNet, Inception, DenseNet, transformers, and MLP-based models); additionally, architectures
may be leveraged in diferent ways (e.g., using ensembles of networks for localized feature
generation in the multi-net approach explored in [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]). For another, the way in which features
are extracted from DL models afects feature quality (e.g., extracting features from diferent
locations in a model). Analysis of the impact of such variables on feature quality is an essential
foundation for optimizing DL-CBR hybrid system performance.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Using Knowledge-Engineered and Learned Features in Concert</title>
        <p>While feature learning can be useful in domains for which generating features through
knowledge-engineering is not feasible, more research is required to evaluate feature
learning augmenting incomplete knowledge-engineered indices. This includes exploring methods
for efectively using both feature sets in concert, for which it may be necessary to mitigate
harmful efects of a “curse of dimensionality" as a result of extracted feature spaces being
generally denser than knowledge-engineered ones. Integrating knowledge-engineered and
network-generated features also requires investigation into potential discretization of
continuous network-generated features as well as into the independence of generated features and/or
their correlation with knowledge-engineered features.</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Refining Weight Learning Methods for Feature-Dense Spaces</title>
        <p>
          As mentioned above, using learned features can result in similarity assessment being performed
in feature-dense spaces, for which conventional methods of weight learning (e.g., [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]) may
be less efective. To this end, it is important to consider ways in which such techniques may
be refined to accommodate larger numbers of features, and/or to explore methods to extract
weights directly from a network architecture, potentially in concert with feature extraction.
This objective also encompasses how combinations of feature and weight learning methods
influence retrieval quality, especially with regards to extracting feature weights from diferent
network architectures.
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>2.4. Evaluating DL-CBR Hybrid Model Explainability</title>
        <p>Investigation of hybrid systems leveraging interpretable CBR structures alongside more opaque
DL systems demands contextualization relative to explainability. Innately, DL-CBR hybrid
systems imply an overall architecture that is more interpretable than an out-of-the-box DL
model but less so than a CBR system using only knowledge-engineered information. Thus, in
addition to optimizing index quality to maximize retrieval accuracy, it is important to assess
where on an explainability spectrum that this work sits and to take measures where possible to
maximize interpretability.</p>
      </sec>
      <sec id="sec-2-5">
        <title>2.5. Proposed Research Plan</title>
        <p>The four research objectives described above encompass a diverse range of research avenues,
and they present specific sub-goals that align with an overarching three-step process that guides
the proposed research methodology. Specifically, this process begins with deep exploration of
network-based index generation methods, including diferent ways in which generated indices
may be integrated into a CBR system. The second step involves post-processing of these indices,
particularly for optimizing CBR system performance/accuracy, but also potentially including
discretization for better combination with knowledge-engineered index information where
applicable. Finally, the resulting DL-CBR hybrid model is analyzed/contextualized with respect
to explainability, especially in comparison to CBR systems using only knowledge-engineered
indexing information.</p>
        <p>
          To this end, initial experiments imitating established index generation methods (e.g., [
          <xref ref-type="bibr" rid="ref5 ref7">5, 7</xref>
          ],
see next section for details) have established both a proof of concept that network-generated
and knowledge-engineered features used in concert can enable greater CBR accuracy than
either feature set used individually and that the network architecture/structure can have a
substantial impact on feature quality. Next steps will focus on other network structure influences
(esp. how diferent DL models afect feature quality), enabling a comprehensive analysis of
network-generated feature sets augmenting knowledge-engineered feature sets.
        </p>
        <p>Beyond this point, future experiments could continue in any of several directions. For one,
feature weighting strategies may be more deeply investigated and/or revised in the context
of potentially denser feature spaces created using network-generated features. For another,
potential relationships between knowledge-engineered and network-generated features may be
explored for explainability purposes. Such investigations would include dependency correlations
between knowledge-engineered and network-generated features and/or methods by which
continuous network-generated features may be discretized, along with the resulting impact on
feature quality.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Progress to Date</title>
      <p>As of the writing of this summary, most progress to date has focused on providing a conceptual
foundation and initial empirical tests for DL-CBR hybridization for retrieval, in line with the
objectives presented above. Specifically, such explorations include using network-generated
features in concert with knowledge-engineered features for greater classification accuracy,
as well as investigating structural influences (e.g., network architecture/structure and feature
extraction location) on feature quality, both using retrieval accuracy as proxy. The following
subsections summarize the associated publications.</p>
      <sec id="sec-3-1">
        <title>3.1. Augmenting Similarity Feature Engineering with Deep Learning</title>
        <p>
          This research [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] assumes the availability of knowledge-engineered feature information for a
given domain, but that such feature information may be incomplete and/or inaccurate. In these
instances, existing feature information may be supplemented by additional learned features
extracted from raw data using DL. In these instances, the inclusion of learned features improves
retrieval accuracy by capturing indexing information to which humans might not be sensitive.
        </p>
        <p>Results supporting this hypothesis are obtained using a zero-shot learning dataset for
computer vision. Each image is associated with a unique case, and per-class feature information
from the dataset is perturbed based on a random coeficient and combined with values extracted
from the image using a convolutional neural network (CNN) to form the case’s feature set. The
two combined sets of values represent knowledge-engineered and network-generated features,
respectively. Retrieval accuracy values for the aggregated feature set are compared against
corresponding accuracy values using either component set exclusively (Figure 1).</p>
        <p>Based on the outcomes from these initial tests, combining feature sets does improve retrieval
accuracy. However, additional variables such as the reliability of knowledge-engineered features
and the number of features extracted from the CNN may significantly influence the magnitude
of accuracy improvement. In addition, preliminary tests regarding weight extraction in parallel
with feature extraction suggest that more feature-dense spaces created by extracting features
from CNNs seem to accommodate established weighting strategies poorly.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Exploring Structural Influences on Generated Feature Efectiveness</title>
        <p>
          In contrast to the previous description, this work [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] specifically investigates how the way in
which features are extracted afects feature quality. To this end, two feature extraction locations
and a novel model ensemble structure that generates localized features are explored.
        </p>
        <p>The experiments investigate the hypothesis that extracting features from later in the network
results in higher-quality features from the perspective of the CBR system. Retrieval accuracy
values are used as proxy for feature quality among the three proposed methods and a CNN
baseline (Figure 2). Additionally, keeping in mind the consequences of feature-dense spaces
discovered in the previous work, varying numbers of features are extracted from each model.</p>
        <p>The results support the hypothesis and suggest that localized feature sets may be especially
accurate for feature-sparse scenarios preferred by CBR systems (if at the cost of increased
training time). The number of features does significantly impact retrieval performance as well,
both as a “curse of dimensionality" for large numbers of features and as a minimum requirement
for DL model convergence for smaller numbers of features.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Future Work</title>
      <p>Future work will build on the current publications’ findings while moving forward to address
other objectives. In the short term, research will focus on exploring feature generation using
both diferent DL models across multiple datasets and diferent experimental parameters (e.g.,
number of training examples). Later experiments will investigate potential weight generation
methods, as well as how weight generation methods are afected by the number of features.</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>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 International Conference on CaseBased Reasoning (ICCBR</article-title>
          <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="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>K.</given-names>
            <surname>Martin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Wiratunga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Massie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Clos</surname>
          </string-name>
          ,
          <article-title>A convolutional siamese network for developing similarity knowledge in the selfBACK dataset</article-title>
          ., in: A.
          <string-name>
            <surname>A. Sanchez-Ruiz</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          KofodPetersen (Eds.),
          <source>Proceedings of the ICCBR 2017 Workshop on Case-Based Reasoning and Deep Learning, CEUR Workshop Proceedings</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>85</fpage>
          -
          <lpage>94</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>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 2022 (in print)</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <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-list>
  </back>
</article>