Por favor, use este identificador para citar o enlazar este ítem:
doi.org/10.1016/j.knosys.2014.05.014
Twittear
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Lupani, Eduardo | - |
dc.contributor.author | Juarez, Jose M. | - |
dc.contributor.author | Palma Méndez, José Tomás | - |
dc.contributor.other | Facultades, Departamentos, Servicios y Escuelas::Facultades de la UMU::Facultad de Informática | es |
dc.date.accessioned | 2021-04-23T09:56:00Z | - |
dc.date.available | 2021-04-23T09:56:00Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | Knowledge-Based Systems, Volume 67, 2014, Pages 180-194 | es |
dc.identifier.issn | 0950-7051 | - |
dc.identifier.uri | http://hdl.handle.net/10201/107041 | - |
dc.description | © <2014>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ This document is the Accepted Manuscript version of a Published Work that appeared in final form in [Knowledge-Based Systems]. | - |
dc.description.abstract | he success of a Case-Based Reasoning (CBR) system closely depends on its knowledge-base, named the case-base. The life cycle of CBR systems usually implies updating the case-base with new cases. However, it also implies removing useless cases for reasons of efficiency. This process is known as Case-Base Maintenance (CBM) and, in recent decades, great efforts have been made to automatise this process using different kind of algorithms (deterministic and non-deterministic). Indeed, CBR system designers find it difficult to choose from the wealth of algorithms available to maintain the case-base. Despite the importance of such a key decision, little attention has been paid to evaluating these algorithms. Although classical validation methods have been used, such as Cross-Validation and Hold-Out, they are not always valid for non-deterministic algorithms. In this work, we analyse this problem from a methodological point of view, providing an exhaustive review of these evaluation methods supported by experimentation. We also propose a specific methodology for evaluating Case-Base Maintenance algorithms (the αβ evaluation). Experiment results show that this method is the most suitable for evaluating most of the algorithms and datasets studied. | es |
dc.format | application/pdf | es |
dc.format.extent | 40 | es |
dc.language | eng | es |
dc.relation | This work was partially funded by the Ministry of Economy and Com- petitiveness, by the Seneca Research Foundation of the Region of Murcia under project 15277/PI/10, and by the Spanish Ministry of Science and Inno- vation+European FEDER+PlanE funds under the project TIN2009-14372- C03-01 and under the grant BES-2010-030294. | es |
dc.rights | info:eu-repo/semantics/openAccess | es |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Case-Base Reasoning, Case-Base Maintenance, Evaluation | es |
dc.subject.other | CDU::0 - Generalidades.::00 - Ciencia y conocimiento. Investigación. Cultura. Humanidades.::004 - Ciencia y tecnología de los ordenadores. Informática. | es |
dc.title | Evaluating Case-Base Maintenance algorithms | es |
dc.type | info:eu-repo/semantics/annotation | es |
dc.identifier.doi | doi.org/10.1016/j.knosys.2014.05.014 | - |
Aparece en las colecciones: | Artículos: Ingeniería de la Información y las Comunicaciones |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
manuscript.pdf | 458,18 kB | Adobe PDF | Visualizar/Abrir |
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons