• Aucun résultat trouvé

Flexible Feature Deletion: Companion Video

N/A
N/A
Protected

Academic year: 2022

Partager "Flexible Feature Deletion: Companion Video"

Copied!
1
0
0

Texte intégral

(1)

Flexible Feature Deletion: Companion Video

?

Brian Schack and Rachael Summers Indiana University Bloomington, Bloomington, USA

Abstract. As the number of cases in a case-base reasoning system in- creases, both storage cost and retrieval time also increase. Case-base maintenance mitigates this problem by deleting cases, and various or- derings of the cases for deletion attempt to minimize the loss of problem solving competence. Existing methods assume (1) that the cases have a uniform size and (2) that the case contents are indivisible. In contrast to assumption (1), flexible feature deletion balances the varying storage costs of different cases with their competence benefits. And for assump- tion (2), flexible feature deletion subdivides selected cases by deleting or compressing their features or subcomponents. Experimental results sup- ported that, for suitable cases bases, flexible feature deletion can outper- form existing per-case strategies. In this companion video, a live-action, life-size CBR robot demonstrates each of the four phases of the CBR cycle: retrieve, reuse, revise, and retain. And a teacher explains flexible feature deletion while the robot performs maintenance on articles of his clothing.

Keywords: Case-based Reasoning, Case-base Maintenance, Flexible Fea- ture Deletion, Feature Reduction, Case Deletion, Case-base Compression

?This video accompanies the paper: Leake, D., and Schack, B. (2015). Flexible Feature Deletion: Compacting Case Bases by Selectively Compressing Case Contents. In Proceedings of the 23rd International Conference on Case-Based Reasoning, 212-227.

Springer.

Copyright © 2017 for this paper by its authors. Copying permitted for private and academic purpose. In Proceedings of the ICCBR 2017 Workshops. Trondheim, Norway

293

Références

Documents relatifs

Abstract—In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is

Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques.. We first show that if the cost function c is decomposable, Le., can be represented as

If the distance matrix C fulfills the Demidenko (Kalmanson, Supnick) conditions, it is called a Euclidean Demidenko (Kalmanson, Supnick) matrix the séquence P is called a

For instance, assume that a given corrective task has a duration of 3 time periods and induces a very small loss of revenue (or none at all) if we wait, say, two time periods to

Therefore, similar to [8], work in progress involves designing a case-base maintenance strategy which models the competence holes in a case base and targets

As the number of cases in the case base grows, stor- age constraints and retrieval costs [1, 2] necessitate limiting the size, and so case base maintenance [3] remains an active area

In this section, we shall describe the empirical evaluation of finding an optimal relaxation of randomly generated feature subscriptions using constraint programming, partial

On the positive side, we show that the unweighted problem is polynomial-time solvable for proper interval graphs, and that the weighted cluster deletion prob- lem is