An Algorithm for Adaptation in Case-based Reasoning
Identifieur interne : 00A038 ( Main/Merge ); précédent : 00A037; suivant : 00A039An Algorithm for Adaptation in Case-based Reasoning
Auteurs : Béatrice Fuchs ; Jean Lieber ; Alain Mille ; Amedeo NapoliSource :
English descriptors
Abstract
The adaptation process is an important and complex step of case-based reasoning (CBR) and is most of the time designed for a specific application. This article presents a domain-independent algorithm for adaptation in CBR. Cases are mapped to a set of numerical descriptors filled with values and local constraint intervals. The algorithm computes every target solution descriptor by combining a source solution, a matching expressed as intervals of variations and dependencies between the source problem and its solution. It determines for every target solution descriptor an interval of the admissible values. In this interval, actual values satisfying global constraints can be chosen. This generic approach to adaptation is operational and introduces general and domain-independent adaptation operators. Therefore, this study is a contribution to the design of a general algorithm for adaptation in CBR.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 002A39
- to stream Crin, to step Curation: 002A39
- to stream Crin, to step Checkpoint: 001A04
Links to Exploration step
CRIN:fuchs00aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="385">An Algorithm for Adaptation in Case-based Reasoning</title></titleStmt><publicationStmt><idno type="RBID">CRIN:fuchs00a</idno><date when="2000" year="2000">2000</date><idno type="wicri:Area/Crin/Corpus">002A39</idno><idno type="wicri:Area/Crin/Curation">002A39</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002A39</idno><idno type="wicri:Area/Crin/Checkpoint">001A04</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001A04</idno><idno type="wicri:Area/Main/Merge">00A038</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">An Algorithm for Adaptation in Case-based Reasoning</title><author><name sortKey="Fuchs, Beatrice" sort="Fuchs, Beatrice" uniqKey="Fuchs B" first="Béatrice" last="Fuchs">Béatrice Fuchs</name></author><author><name sortKey="Lieber, Jean" sort="Lieber, Jean" uniqKey="Lieber J" first="Jean" last="Lieber">Jean Lieber</name></author><author><name sortKey="Mille, Alain" sort="Mille, Alain" uniqKey="Mille A" first="Alain" last="Mille">Alain Mille</name></author><author><name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>adaptation</term><term>case-based reasoning</term><term>domain-independant adaptation</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="3057">The adaptation process is an important and complex step of case-based reasoning (CBR) and is most of the time designed for a specific application. This article presents a domain-independent algorithm for adaptation in CBR. Cases are mapped to a set of numerical descriptors filled with values and local constraint intervals. The algorithm computes every target solution descriptor by combining a source solution, a matching expressed as intervals of variations and dependencies between the source problem and its solution. It determines for every target solution descriptor an interval of the admissible values. In this interval, actual values satisfying global constraints can be chosen. This generic approach to adaptation is operational and introduces general and domain-independent adaptation operators. Therefore, this study is a contribution to the design of a general algorithm for adaptation in CBR.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00A038 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00A038 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= CRIN:fuchs00a
|texte= An Algorithm for Adaptation in Case-based Reasoning
}}
| This area was generated with Dilib version V0.6.33. |  |