Abstract
Chapter 8 presents basic retrieval algorithms. The contents in this chapter will help a designer determine how to efficiently retrieve useful cases, what depends on the complexity of case representation and similarity assessment. It includes methods such as sequential retrieval, two-level retrieval, and retrieval methods with more complex indexing, geometric methods and Voronoi diagrams. As a major example of index-based retrieval, we consider kd-trees and their improvement with decision trees. This is reminiscent of databases, but with the additional task of searching for cases that are not stored. For this purpose we also discuss tests such as BOB and BWB. Because only part of the retrieval methods may be useful in certain CBR systems, readers may select to study some sections only depending on their application interest. More advanced retrieval methods are shown in Chap. 14, Advanced Retrieval. The reading of all previous chapters is recommended.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Althoff K-D (1997) Evaluating case-based reasoning systems: the INRECA case study. Habilitationsschrift, University of Kaiserslautern
Auriol E, Wess S, Manago M et al. (1995) INRECA: a seamlessly integrated system based on inductive inference and case-based reasoning. In: Veloso MM, Aamodt A (eds) ICCBR-95: case-based reasoning research and development. First international conference on case-based reasoning, Sesimbra, Portugal, October 1995. Lecture notes in computer science (lecture notes in artificial intelligence), vol 1010. Springer, Berlin, p 371
Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18:509–517
Bergmann R (2001) Highlights of the European INRECA projects. In: Aha DW, Watson ID (eds) ICCBR 2001: case-based reasoning research and development. 4th international conference on case-based reasoning, Vancouver, BC, Canada, July/August 2001. Lecture notes in computer science (lecture notes in artificial intelligence), vol 2080. Springer, Berlin, p 1
Gentner D, Forbus KD (1991) MAC/FAC: a model of similarity-based retrieval. In: Proceedings of the cognitive science society. Erlbaum, Hillsdale, p 504
Kolahdouzan M, Shahabi C (2004) Voronoi-based k-nearest neighbour search for spatial network databases. In: Nascimento MA, Özsu MT, Kossmann D et al. (eds) VLDB 2004: thirtieth international conference on very large databases, Toronto, Canada, August 31–September 3 2004. Morgan Kaufmann, San Mateo, p 840
Okabe A, Boots B, Sugihara K, Chiu SN (2000) Spatial tessellations: concepts and applications of Voronoi diagrams, 2nd edn. Wiley, England
Schumacher J (2002) Empolis Orenge—an open platform for knowledge management applications. In: Minor M, Staab S (eds) Experience management: sharing experiences about sharing the experience. Papers from the 1st German workshop on experience management, Berlin, 7–8 March 2002. GI, Bonn, p 61
Stottler RH, Henke AL, King JA (1989) Rapid retrieval algorithms for case-based reasoning. In: IJCAI 1989: eleventh international joint conference on artificial intelligence, vol 1. Morgan Kaufmann, San Mateo, p 233
Wess S, Althoff K-D, Derwand G (1993) Using kd-trees to improve the retrieval step in case-based reasoning. In: Wess S, Althoff K-D, Richter MM (eds) Topics in case-based reasoning. EWCBR-93: first European Workshop, Kaiserslautern, Germany, 1–5 November 1993. Lecture notes in artificial intelligence, vol 837. Springer, Berlin, p 167
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Richter, M.M., Weber, R.O. (2013). Retrieval. In: Case-Based Reasoning. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40167-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-40167-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40166-4
Online ISBN: 978-3-642-40167-1
eBook Packages: Computer ScienceComputer Science (R0)