A criterion of comparison between two case bases
Identifieur interne : 00D057 ( Main/Merge ); précédent : 00D056; suivant : 00D058A criterion of comparison between two case bases
Auteurs : Jean Lieber [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: This paper presents a criterion of comparison between two case bases for a case-based system for which the retrieval process is done thanks to a similarity metric. Such a criterion can be useful for at least two things. First, it allows to define what a better case base of a given size can be. Second it enables us to build a “forgetting criterion” which aims at answering the question “What are the p cases that can be lost from the base that conduct to a minimal loss of performance?” The definition of case-based reasoning given in this paper stresses the fact that the goal of the similarity measure is to give an o priori estimation of the performance of the adaptation process. With an introducing example -the “locksmith's problem”- and then more generally, the criterion is defined thanks to a number associated with each case base; this number is characteristic of the mean performance of the system working with this base. It seems that very few results can be demonstrated without hypothesis on the representation of problems. For this reason, we have performed a study for two different types of representation of these problems (or on their associated indices). Finally we solve the locksmith's problem.
Url:
DOI: 10.1007/3-540-60364-6_29
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002212
- to stream Istex, to step Curation: 002182
- to stream Istex, to step Checkpoint: 002C15
Links to Exploration step
ISTEX:927F505592607D93F091B2EC6FB609F29F7C25FALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A criterion of comparison between two case bases</title><author><name sortKey="Lieber, Jean" sort="Lieber, Jean" uniqKey="Lieber J" first="Jean" last="Lieber">Jean Lieber</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:927F505592607D93F091B2EC6FB609F29F7C25FA</idno><date when="1995" year="1995">1995</date><idno type="doi">10.1007/3-540-60364-6_29</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-1M05XNB5-Q/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002212</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002212</idno><idno type="wicri:Area/Istex/Curation">002182</idno><idno type="wicri:Area/Istex/Checkpoint">002C15</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002C15</idno><idno type="wicri:doubleKey">0302-9743:1995:Lieber J:a:criterion:of</idno><idno type="wicri:Area/Main/Merge">00D057</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A criterion of comparison between two case bases</title><author><name sortKey="Lieber, Jean" sort="Lieber, Jean" uniqKey="Lieber J" first="Jean" last="Lieber">Jean Lieber</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>RFIA group CRIN CNRS, INRIA Lorraine, B.P. 239, 54506, Vandœuvre-lès-Nancy Cedex</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper presents a criterion of comparison between two case bases for a case-based system for which the retrieval process is done thanks to a similarity metric. Such a criterion can be useful for at least two things. First, it allows to define what a better case base of a given size can be. Second it enables us to build a “forgetting criterion” which aims at answering the question “What are the p cases that can be lost from the base that conduct to a minimal loss of performance?” The definition of case-based reasoning given in this paper stresses the fact that the goal of the similarity measure is to give an o priori estimation of the performance of the adaptation process. With an introducing example -the “locksmith's problem”- and then more generally, the criterion is defined thanks to a number associated with each case base; this number is characteristic of the mean performance of the system working with this base. It seems that very few results can be demonstrated without hypothesis on the representation of problems. For this reason, we have performed a study for two different types of representation of these problems (or on their associated indices). Finally we solve the locksmith's problem.</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 00D057 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00D057 | 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é= ISTEX:927F505592607D93F091B2EC6FB609F29F7C25FA
|texte= A criterion of comparison between two case bases
}}
| This area was generated with Dilib version V0.6.33. |  |