DETD: Dynamic policy for case base maintenance based on EK-NNclus algorithm and case Types Detection - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

DETD: Dynamic policy for case base maintenance based on EK-NNclus algorithm and case Types Detection

Résumé

Case Based Reasoning (CBR) systems know a success in various domains. Consequently, we find several works focusing on Case Base Maintenance (CBM) that aim to preserve CBR systems performance. Thus, CBM tools are generally offering techniques to select only the most potential cases for problem-solving. However, cases are full of imperfection since they represent real world situations, which makes this task harder. In addition, new problems having substantially new solutions will be found in case bases over the time. Hence, we aim, in this paper, to propose a new CBM approach having the ability to manage uncertainty and the dynamic aspect of maintenance using the evidential clustering technique called EK-NNclus based on belief function theory, where clusters' number is fixed automatically and changes from one maintenance application to another. Finally, the maintenance task is performed through selecting only two types of cases.
Fichier principal
Vignette du fichier
IPMU18_DETD.pdf (321.86 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03643827 , version 1 (16-04-2022)

Identifiants

Citer

Safa Ben Ayed, Zied Elouedi, Eric Lefevre. DETD: Dynamic policy for case base maintenance based on EK-NNclus algorithm and case Types Detection. International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU'2018, Jun 2018, Cadiz, Spain. pp.370-382, ⟨10.1007/978-3-319-91473-2_32⟩. ⟨hal-03643827⟩

Collections

UNIV-ARTOIS LGI2A
32 Consultations
27 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More