Skip to main content
SpringerLink
Log in

Using k-d trees to improve the retrieval step in case-based reasoning

  • Selected Papers
  • Conference paper
  • First Online:
Topics in Case-Based Reasoning (EWCBR 1993)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 837))

Included in the following conference series:

Abstract

Retrieval of cases is one important step within the case-based reasoning paradigm. We propose an improvement of this stage in the process model for finding most similar cases with an average effort of O[log 2 n], n number of cases. The basic idea of the algorithm is to use the heterogeneity of the search space for a density-based structuring and to employ this precomputed structure, a k- d tree, for efficient case retrieval according to a given similarity measure. Besides illustrating the basic idea, we present empirical results of a comparison of four different k- d tree generating strategies and introduce the notion of dynamic bounds which significantly reduce the retrieval effort. The presented approach is fully implemented and used within two case-based reasoning systems for classification and diagnostic tasks, Patdex and Inreca.

Funding for this research has been partially provided by the Commission of the European Communities (Esprit contract P6322, the InReCa project). The partners of InReCa are AcknoSoft (prime contractor, France), tecInno (Germany), Irish Multimedia Systems (Ireland), and the University of Kaiserslautern (Germany).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. David W. Aha. Case-Based Learning Algorithms. In Ray Bareiss, editor, Proceedings CBR Workshop 1991, pages 147–158. Morgan Kaufmann Publishers, 1991.

    Google Scholar 

  2. Klaus-Dieter Althoff and Stefan Wess. Case-Based Knowledge Acquisition, Learning and Problem Solving for Diagnostic Real World Tasks. In Proceedings of the 5th European Knowledge Acquisition Workshop EKAW'91, 1991.

    Google Scholar 

  3. Klaus-Dieter Althoff and Stefan Wess. Case-Based Reasoning and Expert System Development. In Franz Schmalhofer, Gerhard Strube, and Thomas Wetter, editors, Contemporary Knowledge Engineering and Cognition. Springer-Verlag, Berlin, 1992. In preparation.

    Google Scholar 

  4. Peter Anick, Evangelos Simoudis, Bruce Croft, William Mark, and Chris Riesbeck, editors. Case-Based Reasoning and Information Retrieval, Stanford University, March 1993. American Association for Artificial Intelligence, AAAI — Spring Symposium Series.

    Google Scholar 

  5. R. Barletta and W. Mark. Explanation-Based Indexing of Cases. In Kolodner [20], pages 50–61.

    Google Scholar 

  6. J.L. Bentley. Multidimensional binary search trees used for associative searching. Com. of the ACM, 18:509–517, 1975.

    Google Scholar 

  7. A.J. Broder. Strategies for efficient incremental nearest neighbor search. Pattern Recognition, 23:171–178, 1990.

    Google Scholar 

  8. E. Charniak, and D. McDermott. Introduction to AI. Addison-Wesley, 1985.

    Google Scholar 

  9. Belur Dasarathy. Nearest Neighbor Norms: NN Pattern Classification Techniques. IEEE Computer Society Press, 1990.

    Google Scholar 

  10. E. A. Feigenbaum. The simulation of verbal learning behavior. In E. A. Feigenbaum and J. Feldman, editors, Computers and Thought. McGraw-Hill, 1963.

    Google Scholar 

  11. D. Fisher. Cobweb: Knowledge acquisition via conceptual clustering. Machine Learning, 2:139–172, 1987.

    Google Scholar 

  12. J.H. Friedman, J.L. Bentley, and R.A. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Trans. math. Software, 3:209–226, 1977.

    Google Scholar 

  13. J. H. Gennari, P. Langley, and D. Fisher. Models of incremental concept formation. Artificial Intelligence, 40:11–61, 1989.

    Google Scholar 

  14. Dedre Gentner and Kenneth D. Forbus. Mac/Fac: A model of similarity-based retrieval. In Proceedings of the 13th Annual Conference of the Cognitive Science Society, pages 504–509, 1991.

    Google Scholar 

  15. Kristian J. Hammond, editor. Proceedings: Case-Based Reasoning Workshop. Morgan Kaufmann Publishers, 1989.

    Google Scholar 

  16. K. J. Holyoak and K. Koh. Analogical Problem Solving: Effects of Surface and Structural Similarity in Analogical Transfer. In Midwestern Psychological Association, editor, Proceedings of the Conference of the Midwestern Psychological Association, 1986. May 1986.

    Google Scholar 

  17. Dietmar Janetzko, Stefan Wess, and Erica Melis. Goal-Driven Similarity Assessment. In Hans-Jürgen Ohlbach, editor, Proc. German Workshop on AI (GWAI'92). Springer Verlag, 1993.

    Google Scholar 

  18. Dennis Kibler, David Aha, and Marc Albert. Comparing instance-averaging with instance filtering learning algorithms. In Proceedings of the third European Working Session on Learning, pages 63–80, 1988.

    Google Scholar 

  19. Janet L. Kolodner. Retrieval and Organizational Strategies in Conceptual Memory. PhD thesis, Yale University, 1980.

    Google Scholar 

  20. Janet L. Kolodner, editor. Proceedings Case-Based Reasoning Workshop. Morgan Kaufmann Publishers, 1988.

    Google Scholar 

  21. Janet L. Kolodner. Retrieving Events from a Case Memory: A Parallel Implementation. In Proc. Case-Based Reasoning Workshop [20], pages 233–249.

    Google Scholar 

  22. J.L. Kolodner, R.L. Simpson, and K. Sycara. A Process Model of Case-Based Reasoning in Problem Solving. In IJCAI, editor, Proc. IJCAI 1985, pages 284–290. Morgan Kaufmann Publishers, 1985. Los Angeles, California, USA.

    Google Scholar 

  23. M. Manago, K.D. Althoff, E. Auriol, R. Traphöner, S. Wess, N. Conruyt, and F. Maurer. Induction and reasoning from cases. In M.M. Richter, S. Wess, K.D. Althoff, and F. Maurer, editors, First European Workshop on Case-Based Reasoning (EWCBR-93), pages 3313–318, 1993.

    Google Scholar 

  24. Kurt Mehlhorn. Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry. Springer, 1984.

    Google Scholar 

  25. Hannes Öchsner and Stefan Wess. Ähnlichkeitsbasiertes Retrieval von Fallbeispielen durch Assoziative Suche in einem mehrdimensionalen Datenraum. In K-D. Althoff, S. Wess, B. Bartsch-Spörl, and D. Janetzko, editors, Ähnlichkeit von Fällen in Systemen des fallbasierten Schlieβens, SEKI-Report, Universität Kaiserslautern, SFB 314, 25.–26. Juni, June 1992.

    Google Scholar 

  26. Stephen M. Omohundro. Five balltree construction algorithms. Technical report, International Computer Science Institue, 1989.

    Google Scholar 

  27. B. W. Porter. Similarity Assessment: Computation vs. Representation. In Hammond [15], pages 82–84.

    Google Scholar 

  28. J.R. Quinlan. Learning efficient classification procedures and their application to chess endgames. In R. Michalski, J. Carbonell, and T. Mitchell, editors, Maschine Learning. Tioga Press, 1983.

    Google Scholar 

  29. Michael M. Richter and Stefan Wess. Similarity, Uncertainty and Case-Based Reasoning in Patdex. In Robert S. Boyer, editor, Automated Reasoning, Essays in Honor of Woody Bledsoe, pages 249–265. Kluwer Academic Publishing, 1991.

    Google Scholar 

  30. Craig Stanfill and David Waltz. Toward Memory-Based Reasoning. Com. of the ACM, 29(12):1213–1229, 1986.

    Google Scholar 

  31. R. H. Stottler, A. L. Henke, and J. A. King. Rapid Retrieval Algorithms for Case-Based Reasoning. In Proceedings of the 11th International Conference on Artificial Intelligence IJCAI-89, pages 233–237, 1989. Detroit, Michigan, USA.

    Google Scholar 

  32. Toshikazu Tanaka and Naomichi Sueda. Combining strict matching and similarity assessment for retrieving appropriate cases efficiently. In Anick et al. [4].

    Google Scholar 

  33. P. Thagard and K. I. Holyoak. Why Indexing is the Wrong Way to Think About Analog Retrieval. In Hammond [15], pages 36–40.

    Google Scholar 

  34. Amos Tversky. Features of Similarity. Psychological Review, 84:327–352, 1977.

    Google Scholar 

  35. Stefan Wess. Patdex — Inkrementelle und wissensbasierte Verbesserung von Ähnlichkeitsurteilen in der fallbasierten Diagnostik. In Tagungsband 2. deutsche Expertensystemtagung XPS-93, Hamburg, 1993. Springer Verlag.

    Google Scholar 

  36. Stefan Wess. Fallbasiertes Problemlösen in wissensbasierten Systemen zur Entscheidungsunterstützung und Diagnostik. Xd PhD thesis, Fachbereich Informatik, Universität Kaiserslautern, 1994. (in preparation).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Kaiserslautern, D-67653, Kaiserslautern, Germany

    Stefan Wess, Klaus-Dieter Althoff & Guido Derwand

Authors
  1. Stefan Wess
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus-Dieter Althoff
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guido Derwand
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stefan Wess Klaus-Dieter Althoff Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wess, S., Althoff, KD., Derwand, G. (1994). Using k-d trees to improve the retrieval step in case-based reasoning. In: Wess, S., Althoff, KD., Richter, M.M. (eds) Topics in Case-Based Reasoning. EWCBR 1993. Lecture Notes in Computer Science, vol 837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58330-0_85

Download citation

  • DOI: https://doi.org/10.1007/3-540-58330-0_85

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58330-1

  • Online ISBN: 978-3-540-48655-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation