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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bradtke, S., & Lehnert, W. G. (1988). Some Experiments With Case-based Search. In Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI'88), Vol. 1, pp. 133–138 Saint-Paul (Minnesota).
Diday, E., Lemaire, J., Pouget, J., & Testu, F. (1982). Éléments d'analyse de données. Dunod.
Evans, D. J., & Stojmenović, I. (1989). On parallel computation of Voronoi diagrams. Parallel Computing, 12, 121–125.
Huang, X. D., Ariki, Y., & Jack, M. A. (1990). Vector Quantisation and Mixture Densities, chap. 4, pp. 111–135. Edinburgh University Press.
Jantke, K. P., & Lange, S. (1993). Case-Based Representation and Learning of Pattern Languages. In Proceedings of the first European Workshop on Case-Based Reasoning.
Kolodner, J. (1993). Case-Based Reasoning. Morgan Kaufmann, Inc.
Markovitch, S., & Scott, P. D. (1993). Information Filtering: Selection Mechanisms in Learning Systems. Machine Learning, 10, 113–151.
O'Leary, D. E. (1993). Verification and Validation of Case-Based Systems. Experts Systems With Applications, 6, 57–66.
Porter, B. W., Bareiss, R., & Holte, R. C. (1990). Concept Learning and Heuristic Classification in Weak-Theory Domains. Artificial Intelligence, 45, 229–263.
Riesbeck, C. K., & Schank, R. C. (1989). Inside Case-Based Reasoning. Lawrence Erlbaum Associates, Inc., Hillsdale, New Jersey.
Smyth, B., & Keane, M. T. (1994). Retrieving Adaptable Cases. In Wess, S., Althoff, K.-D., & Richter, M. (Eds.), Topics in Case-Based Reasoning — First European Workshop (EWCBR'93), Kaiserslautern, Lecture Notes in Artificial Intelligence 837, pp. 209–220. Springer Verlag, Berlin.
Veloso, M. M. (1994). Planning and learning by analogical reasoning. Lecture Notes in Artificial Intelligence. Springer Verlag, Berlin.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lieber, J. (1995). A criterion of comparison between two case bases. In: Haton, JP., Keane, M., Manago, M. (eds) Advances in Case-Based Reasoning. EWCBR 1994. Lecture Notes in Computer Science, vol 984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60364-6_29
Download citation
DOI: https://doi.org/10.1007/3-540-60364-6_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60364-1
Online ISBN: 978-3-540-45052-8
eBook Packages: Springer Book Archive