Hybrid Deletion Policies for Case Base Maintenance

Case memory maintenance in a Case-Based Reasoning system is important for two main reasons: (1) to control the case memory size; (2) to reduce irrelevant and redundant instances that may produce inconsistencies in the Case-Based Reasoning system. In this paper we present two approaches based on deletion policies to the maintenance of case memories. The foundations of both approaches are the Rough Sets Theory, but each one applies a different policy to delete or maintain cases. The main purpose of these methods is to maintain the competence of the system and reduce, as much as possible, the size of the case memory. Experiments using different domains, most of them from the UCI repository, show that the reduction techniques maintain the competence obtained by the original case memory. The results obtained are compared with those obtained using well-known reduction techniques.

[1]  Marnix J. J. Garvels,et al.  The splitting method in rare event simulation , 2000 .

[2]  David C. Wilson,et al.  Maintaining Case‐Based Reasoners: Dimensions and Directions , 2001, Comput. Intell..

[3]  D. Kibler,et al.  Instance-based learning algorithms , 2004, Machine Learning.

[4]  Jing Wu,et al.  Keep It Simple: A Case-Base Maintenance Policy Based on Clustering and Information Theory , 2000, Canadian Conference on AI.

[5]  Qiang Yang,et al.  Remembering to Add: Competence-preserving Case-Addition Policies for Case Base Maintenance , 1999, IJCAI.

[6]  Pedro M. Domingos.  Control-Sensitive Feature Selection for Lazy Learners , 1997, Artificial Intelligence Review.

[7]  Barry Smyth,et al.  Competence Models and the Maintenance Problem , 2001, Comput. Intell..

[8]  Barry Smyth,et al.  Building Compact Competent Case-Bases , 1999, ICCBR.

[9]  P. Glynn,et al.  Notes: Conditions for the Applicability of the Regenerative Method , 1993 .

[10]  Thomas Roth-Berghofer,et al.  Review and Restore for Case‐Base Maintenance , 2001, Comput. Intell..

[11]  P. Glynn,et al.  A joint central limit theorem for the sample mean and regenerative variance estimator , 1987 .

[12]  Christopher J. Merz,et al.  UCI Repository of Machine Learning Databases , 1996 .

[13]  David W. Aha,et al.  Instance-Based Learning Algorithms , 1991, Machine Learning.

[14]  Perwez Shahabuddin.  Rare event simulation in stochastic models , 1995, WSC '95.

[15]  Steven Salzberg,et al.  A Nearest Hyperrectangle Learning Method , 1991, Machine Learning.

[16]  Luigi Portinale,et al.  Speed-Up, Quality and Competence in Multi-modal Case-Based Reasoning , 1999, ICCBR.

[17]  Elisabet Golobardes,et al.  Rough Sets Reduction Techniques for Case-Based Reasoning , 2001, ICCBR.

[18]  Paul Glasserman,et al.  Splitting for rare event simulation: analysis of simple cases , 1996, Winter Simulation Conference.

[19]  Christopher K. Riesbeck,et al.  Inside Case-Based Reasoning , 1989 .

[20]  Tony R. Martinez,et al.  Reduction Techniques for Instance-Based Learning Algorithms , 2000, Machine Learning.

[21]  P. Glynn.  Some topics in regenerative steady-state simulation , 1994 .

[22]  Xavier Llorà,et al.  Computer aided diagnosis with case-based reasoning and genetic algorithms , 2002, Knowl. Based Syst..

[23]  Barry Smyth,et al.  Remembering To Forget: A Competence-Preserving Case Deletion Policy for Case-Based Reasoning Systems , 1995, IJCAI.

[24]  David C. Wilson,et al.  Remembering Why to Remember: Performance-Guided Case-Base Maintenance , 2000, EWCBR.

[25]  P. Glasserman,et al.  A Look At Multilevel Splitting , 1998 .

[26]  Carla E. Brodley,et al.  Addressing the Selective Superiority Problem: Automatic Algorithm/Model Class Selection , 1993 .

[27]  Michael A. Crane,et al.  Simulating Stable Stochastic Systems: III. Regenerative Processes and Discrete-Event Simulations , 1975, Oper. Res..

[28]  Ronald W. Wolff,et al.  A Review of Regenerative Processes , 1993, SIAM Rev..