<!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>Feature-Centric Approaches to Case-Base Maintenance</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Brian Schack Advisor: Dr. David Leake</string-name>
          <email>leake@indiana.edu</email>
          <email>schackb@indiana.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Informatics and Computing, Indiana University Bloomington IN 47408</institution>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <fpage>287</fpage>
      <lpage>291</lpage>
      <abstract>
        <p>Flexible case-base maintenance (FCBM) and adaptation-guided feature deletion (AGFD) extend case-base maintenance (CBM) research. FBCM examines superficial properties of cases and their features such as the size of a case or the rarity of a feature. Then it deletes either entire cases, or components of cases, measuring competence by the number of problems solved and measuring size by the number of case-feature pairs. AGFD harnesses the adaptation knowledge of a system in order to improve FCBM. It prioritizes cases for maintenance based on the recoverability of their deleted components. Experiments evaluated FCBM in three domains: film recommendations, Congressional bill sponsorship, and travel agency packages, and AGFD in a path-finding domain. The proposed research plan is to continue to explore and improve approaches to CBM and their relationship with each of the other phases of the CBR cycle.</p>
      </abstract>
      <kwd-group>
        <kwd>Case-base maintenance</kwd>
        <kwd>case-base compression</kwd>
        <kwd>case deletion</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The performance of a case-based reasoning system depends on the coverage of its case
base and the quality of its cases. As the number of cases in the case base grows,
storage constraints and retrieval costs [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ] necessitate limiting the size, and so case base
maintenance [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] remains an active area of CBR research through methods such as
competence-based case deletion [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], optimizing the trade-off between size and
accuracy [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], deletion aimed at preserving diversity [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], and strategies for forgetting (e.g.
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]). On the flip side, other methods limit which cases to retain during problem solving
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] or the order to add cases from a candidate set [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ]. All of these strategies delete
or add entire cases as indivisible units, therefore this research summary refers to them
as per-case maintenance strategies.
      </p>
      <p>
        Research on the maintenance of case contents has generally focused on quality
improvement rather than case-base compression (e.g., [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]). The key novelty of flexible
case-base maintenance 1 is that it removes components of case solutions. This research
summary describes FCBM by contrasting it with per-case maintenance and builds on it
with adaptation-guided feature deletion. Then, it concludes with the remaining research
questions and the upcoming research plan.
1 Earlier research [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] referred to flexible case-base maintenance as flexible feature deletion.
      </p>
      <p>This name change reflects feedback from the reviewers.</p>
    </sec>
    <sec id="sec-2">
      <title>Flexible Case-Base Maintenance</title>
      <p>Per-case strategies reflect two common implicit assumptions: (1) that all of the cases
in the CBR system will have sufficiently uniform size that the size effects of deletion
or addition do not depend on the chosen case, and (2) that the size of the internal
contents of cases cannot be reduced. In domains for which each case must contain uniform
knowledge, so that removal of any case information would severely impair the ability
to use the cases, per-case strategies are the only appropriate choice. However, in some
CBR domains, case contents are more flexible.</p>
      <p>Flexible case-base maintenance questions the assumption of uniform case size in
case-base maintenance. The assumption of uniform size means that, if cases are of
different size, it is not possible, for example, to favor retention of smaller cases when
those cases have comparable coverage. It also questions the assumption of maintenance
only on a per-case basis, proposing that compression strategies can consider not only
case deletion/addition but the deletion of components of particular cases. Rather than
pre-determining a static set of features to be used throughout the life of the CBR system,
the set of features to include in the case base could be adjusted based on requirements
for storage, processing speed, and accuracy.</p>
      <p>There need not be a requirement that all cases in the case base include the same set
of features, just as there need not be uniform collections of components in the solution
parts of cases, and the solutions need not be represented at the same level of granularity.
FCBM is a new, more flexible maintenance approach in which selective compression
can be done at the level of the contents of individual cases, by removing selected
features from either indexing or solution information. Thus, this can be used to maintain
both indexing features and features of a solution.</p>
      <p>
        The motivation for adjusting case contents arises from domains in which cases are
large and can be represented in multiple ways. For example, CBR has attracted interest
for reasoning from imagery such as medical images (e.g., [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]). From any image,
different features may be extracted, at different resolutions, and the amount of information
required to represent different images might vary dramatically. In diagnostic domains,
numerous features may carry information relevant to the diagnosis, with different pieces
relevant to different degrees for different problems. When CBR is applied to design
support, stored designs could selectively include different subsets of a full design or could
include the design at different levels of detail. In a case-based planner generating highly
complex plans, it is possible to retain the entire plan, or only key pieces, or to preserve
full details for parts of the plans and high-level abstractions for others.
      </p>
      <p>
        Experiments evaluated eight CBM strategies and three hybrid strategies [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] across
three domains: film recommendations, Congressional bill sponsorships, and travel agency
packages. Results supported that, FBCM may outperform per-case maintenance at the
same levels of compression for suitable domains where cases have varying sizes,
contents are compressible, and reasoning requires different amounts of information.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Adaptation-Guided Feature Deletion</title>
      <p>
        When flexible case-base maintenance removes components of cases, for flat feature
representations, its process is restricted to deleting particular features from a feature vector.
However, for structured cases, FCBM includes a wider space of possible operations, not
restricted to deleting individual features, or even limited to deletion per se. FCBM could
compress cases through substructure deletion, substructure substitution, or substructure
abstraction. These correspond to common operations for case adaptation, and an
adaption chain can apply such operations successively [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. If the adaptation component
contains procedures for these, then adaptation-guided feature deletion can apply them
directly. If the adaptation knowledge includes specific guidance on applicability, then
the reuse of the adaptation knowledge makes it available to the maintenance phase.
      </p>
      <p>
        Case abstraction research, because it aims to compact the case base by removing
concrete cases subsumed by abstractions [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], can also be seen as in the spirit of
replacing cases with more compact versions. For a recent example, ICARUS [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] retains
abstract planning cases in a tree structure according to similarities, and this resembles
feature bundling except constrained to a hierarchy. Exploiting adaptation knowledge for
FCBM raises the key question of when an adaptation should be applied for FCBM. This
depends crucially on four factors: compression, feature-centric recoverability, quality
retention, and recovery cost.
      </p>
      <p>– Compression: Compression simply refers to the change in case base size from
applying an adaptation. However, because FCBM can change case sizes by feature
deletion, this is measured not in terms of the number of cases, but in terms of the
finest-grained subunit of cases that is meaningful to delete. For cases represented
by feature vectors, this is a feature-value pair.
– Feature-centric recoverability: Feature-centric recoverability refers to the ability
of the system to recover a competent solution to the problem of a given case from
the FCBM-modified case and the remaining case base. Recovering the competence
may not require recovering a solution identical to the original if multiple solutions
are satisfactory.
– Quality retention: Quality retention refers to the quality of the solutions the system
is able to generate, beyond simply generating a correct solution. For example, in a
path planning domain, a deletion from a path would be recoverable if the system
were still able to generate some path between the same endpoints. Quality retention
might be measured by the ratio of the costs of old and new paths.
– Recovery cost: Recovery cost refers to the resources required to generate a new
solution to the problem. For example, in a case-based planner able to draw on a
generative planner when needed, all deletions might be recoverable, but some might
be computationally expensive when done by reasoning from scratch. In those
instances, other deletions might be more appropriate.</p>
      <p>
        We note that feature-centric recoverability is closely related to the notion of
reachability, defined by Smyth and Keane [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. However, there is an important difference.
Reachability refers to the ability to adapt other cases in the case base to cover the
problem addressed by a candidate case. Feature-centric recoverability refers to the ability
to adapt either other cases in the case base or the FCBM-revised case to restore the
coverage that the candidate case initially provided.
      </p>
    </sec>
    <sec id="sec-4">
      <title>Remaining Research Questions and Challenges</title>
      <p>
        The FCBM approach raises a rich range of questions for fully exploiting its potential.
Questions include how FCBM strategies should interact with the indexing and
adaptation knowledge containers, how feature deletion can preserve case integrity, and how
feature deletion should be reflected in case provenance and explanation.
– Coupling feature deletion with index maintenance: As case contents are deleted,
the relevance of case indices may change. Consequently, this researcher’s
hypothesis is that FCBM needs accompanying index maintenance to assure that, as cases
are compressed, the system still retrieves the most similar cases. I intend to
evaluate this by measuring the performance of different combinations of FCBM and
indexing strategies. Additionally, feature weight information might suggest features
which could be deleted with limited harm.
– Maintaining case integrity despite feature deletion: Another question is the
relationship of feature deletion to the cohesiveness of a case. From the early days of
CBR, an argument for CBR has been that cases can implicitly capture interactions
among case parts. Deleting portions of a case risks some of that cohesion, making
it a concern to address in feature deletion strategies. I intend to formally define case
cohesiveness and measure the impact of FCBM strategies on this metric.
– Reflecting feature deletion in provenance and explanation: Because feature
deletion results in stored cases which differ from the cases originally captured, it (like
case adaptation) may weaken the ability to justify proposed solutions by past
experience. Likewise, changes from the original cases may make it difficult to apply
provenance-based methods for predicting solution characteristics such as solution
accuracy and trust (e.g., [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]). I intend to extend provenance-based explanations
(when possible) to explain solutions adapted from cases restructured by FCBM.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>This research summary described two approaches which build on past ideas about
CBM. FCBM removes components of cases, and adaptation-guided feature deletion
uses adaptation knowledge. The proposed research plan is to continue to explore and
improve upon approaches to CBM and their relationship with each of the other phases
of the CBR cycle.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>
        This research summary contains excerpts from two earlier papers by the same co-author
[
        <xref ref-type="bibr" rid="ref12 ref19">12, 19</xref>
        ].
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Francis</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ram</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Computational models of the utility problem and their application to a utility analysis of case-based reasoning</article-title>
          .
          <source>In: Proceedings of the Workshop on Knowledge Compilation and Speed-Up Learning</source>
          . (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Smyth</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cunningham</surname>
            ,
            <given-names>P.:</given-names>
          </string-name>
          <article-title>The utility problem analysed: A case-based reasoning perspective</article-title>
          .
          <source>In: Proceedings of the Third European Workshop on Case-Based Reasoning</source>
          , Berlin, Springer (
          <year>1996</year>
          )
          <fpage>392</fpage>
          -
          <lpage>399</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3. Wilson,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Leake</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          :
          <article-title>Maintaining case-based reasoners: Dimensions and directions</article-title>
          .
          <source>Computational Intelligence</source>
          <volume>17</volume>
          (
          <issue>2</issue>
          ) (
          <year>2001</year>
          )
          <fpage>196</fpage>
          -
          <lpage>213</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Smyth</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Keane</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Remembering to forget: A competence-preserving case deletion policy for case-based reasoning systems</article-title>
          .
          <source>In: Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence</source>
          , San Mateo, Morgan Kaufmann (
          <year>1995</year>
          )
          <fpage>377</fpage>
          -
          <lpage>382</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Lupiani</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Craw</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Massie</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Jua´rez,
          <string-name>
            <given-names>J.M.</given-names>
            ,
            <surname>Palma</surname>
          </string-name>
          , J.T.:
          <article-title>A multi-objective evolutionary algorithm fitness function for case-base maintenance</article-title>
          .
          <source>In: Case-Based Reasoning Research and Development - 21st International Conference, (ICCBR-13)</source>
          , Springer 218-232
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Lieber</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>A criterion of comparison between two case bases</article-title>
          .
          <source>In: Advances in Case-Based Reasoning. Volume 984 of Lecture Notes in Computer Science</source>
          . Springer, Berlin (
          <year>1995</year>
          )
          <fpage>87</fpage>
          -
          <lpage>100</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7. Ontan˜ o´n,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Plaza</surname>
          </string-name>
          , E.:
          <article-title>Collaborative case retention strategies for CBR agents</article-title>
          .
          <source>In: CaseBased Reasoning Research and Development: Proceedings of the Fifth International Conference on Case-Based Reasoning, ICCBR-03</source>
          , Berlin, Springer-Verlag (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Mun</surname>
          </string-name>
          <article-title>˜oz-</article-title>
          <string-name>
            <surname>Avila</surname>
            ,
            <given-names>H.:</given-names>
          </string-name>
          <article-title>A case retention policy based on detrimental retrieval</article-title>
          .
          <source>In: Proceedings of ICCBR-99</source>
          . (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          :
          <article-title>Remembering to add: Competence-preserving case-addition policies for case base maintenance</article-title>
          .
          <source>In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence</source>
          , Morgan Kaufmann (
          <year>1999</year>
          )
          <fpage>234</fpage>
          -
          <lpage>241</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Smyth</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McKenna</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Building compact competent case-bases</article-title>
          .
          <source>In: Proceedings of the Third International Conference on Case-Based Reasoning</source>
          , Berlin, Springer Verlag (
          <year>1999</year>
          )
          <fpage>329</fpage>
          -
          <lpage>342</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Racine</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          :
          <article-title>Maintaining unstructured case bases</article-title>
          .
          <source>In: Case-Based Reasoning Research and Development, ICCBR</source>
          <year>1997</year>
          , Berlin, Springer (
          <year>1997</year>
          )
          <fpage>553</fpage>
          -
          <lpage>564</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Leake</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Schack</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          (
          <year>2015</year>
          ,
          <article-title>September)</article-title>
          .
          <source>Flexible Feature Deletion: Compacting Case Bases by Selectively Compressing Case Contents. In: International Conference on CaseBased Reasoning</source>
          (pp.
          <fpage>212</fpage>
          -
          <lpage>227</lpage>
          ). Springer International Publishing.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13. Wilson,
          <string-name>
            <surname>D.</surname>
            ,
            <given-names>O</given-names>
          </string-name>
          <string-name>
            <surname>'Sullivan</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Medical imagery in case-based reasoning</article-title>
          . In Perner, P., ed.
          <source>: Case-Based Reasoning on Images and Signals. Volume 73 of Studies in Computational Intelligence</source>
          . Springer (
          <year>2008</year>
          )
          <fpage>389</fpage>
          -
          <lpage>418</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Cummins</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Bridge</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          (
          <year>2009</year>
          ,
          <article-title>July)</article-title>
          .
          <article-title>Maintenance by a committee of experts: The MACE approach to case-base maintenance</article-title>
          .
          <source>In International Conference on Case-Based Reasoning</source>
          (pp.
          <fpage>120</fpage>
          -
          <lpage>134</lpage>
          ). Springer Berlin Heidelberg.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Fuchs</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lieber</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mille</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Napoli</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2014</year>
          ).
          <article-title>Differential adaptation: An operational approach to adaptation for solving numerical problems with CBR</article-title>
          .
          <source>Knowledge-Based Systems</source>
          ,
          <volume>68</volume>
          ,
          <fpage>103</fpage>
          -
          <lpage>114</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Bergmann</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wilke</surname>
          </string-name>
          , W.:
          <article-title>On the role of abstraction in case-based reasoning</article-title>
          .
          <source>In: Advances in Case-Based Reasoning</source>
          , Third European Workshop, EWCBR-
          <volume>96</volume>
          , Lausanne, Switzerland,
          <source>November 14-16</source>
          ,
          <year>1996</year>
          , Proceedings. (
          <year>1996</year>
          )
          <fpage>28</fpage>
          -
          <lpage>43</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Menager</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          (
          <year>2016</year>
          ,
          <article-title>October)</article-title>
          .
          <article-title>Episodic Memory in a Cognitive Model</article-title>
          .
          <source>In International Conference on Case-Based Reasoning Doctoral Consortium</source>
          . Springer International Publishing.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Leake</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Whitehead</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Case provenance: The value of remembering case sources</article-title>
          .
          <source>In: Case-Based Reasoning Research and Development: Proceedings of the Seventh International Conference on Case-Based Reasoning, ICCBR-07</source>
          , Berlin, Springer-Verlag (
          <year>2007</year>
          )
          <fpage>194</fpage>
          -
          <lpage>208</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Leake</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Schack</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          (
          <year>2016</year>
          ,
          <article-title>October)</article-title>
          .
          <article-title>Adaptation-Guided Feature Deletion: Testing Recoverability to Guide Case Compression</article-title>
          .
          <source>In: International Conference on Case-Based Reasoning</source>
          . Springer International Publishing.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>