Skip to main content

Efficient Similarity Determination and Case Construction Techniques for Case-Based Reasoning

  • Conference paper
  • First Online:
Book cover Advances in Case-Based Reasoning (ECCBR 2002)

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

Included in the following conference series:

Abstract

In this paper, we present three techniques for knowledge discovery in case-based reasoning. The first two techniques D-HS and D-HS+SR are concerned with the discovery of similarity knowledge and operate on an uncompacted case-base while the third technique D-HS+PSR is concerned with the discovery of both similarity and case knowledge and operates on a compacted case-base. All three techniques provide a very efficient and competent means of similarity determination in CBR, which are empirically shown to be up to 25 times faster than k-NN without any loss in competency. D-HS+PSR proposes a novel approach to automatically engineering compact case-bases with a minimal overhead to the system, compared to other approaches such as case deletion/addition. Additionally as the approach provides a means for automatically reducing the number of cases required in the case-base without any loss in problem solving competency it has the greatest implication of the three techniques for reducing the effects of the utility problem in CBR.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aha, D. W. and Breslow, L. Refining conversational case libraries. In Proceedings of the 2nd International Conference on Case-based Reasoning,-ICCBR-97, pp 267–276, Providence RI, USA, 1997.

    Google Scholar 

  2. Anand, SS; Patterson, DW and Hughes, JG. Knowledge Intensive Exception Spaces, AAAI-98, pp 574–579, 1998.

    Google Scholar 

  3. Cost, S.; and Salzberg, S. 1993. A Weighted Nearest Neighbour Algorithm for Learning with Symbolic Features. Machine Learning 10: 57–78.

    Google Scholar 

  4. Deangdej, J., Lukose, D., Tsui, E., Beinat, P. and Prophet, L. Dynamically creating indices for two million cases: A real world problem. In Smith, I. And Faltings, B. eds., Advances in Case-Based Reasoning, Lecture Notes in AI,. Springer-Verlag. 105-119. Berlin: Springer Verlag 1996.

    Google Scholar 

  5. Fox, S. and Leake, D.B. Using Introspective reasoning to refine indexing. In roceedings of the 14th International Joint Conference on Artificial Intelligence. Montreal, Canada, August, pp 391–387. 1995.

    Google Scholar 

  6. Hanney, K. and Keane M. Learning Adaptation Rules from a Case-Base, Proc. Advances in Case-Based Reasoning, 3rd European Workshop, EWCBR-96, pp 179–192, Lausanne, Switzerland, November 1996.

    Google Scholar 

  7. Hunt, J.E., Cooke, D.E. and Holstein, H. Case-memory and retrieval based on the immune system. 1st International Conference on Case-Based reasoning (ICCBR-95), pp 205–216,. 1995.

    Google Scholar 

  8. McSherry, D. Automating case selection in the construction of a case library. Proceedings of ES99, the19th SGES International Conference on Knowledge-Based Systems and Applied Artificial Intelligence, Cambridge, pp 163–177, December 1999

    Google Scholar 

  9. Patterson, D., Anand, S.S., Dubitzky, D. and Hughes, J.G. Towards Automated Case Knowledge Discovery in the M2 Case-Based Reasoning System, Knowledge and Information Systems:An International Journal, (1), pp 61–82, Springer Verlag, 1999.

    Google Scholar 

  10. Patterson, D; Anand, SS; Dubitzky, D and Hughes, JG. A Knowledge Light Approach to Similarity Maintenance for Improving Case-Based Competence. Workshop on Flexible Strategies for Maintaining Knowledge Containers 14th European Conference on Artificial Intelligence, ECAI 2000. PP 65–77. 2000

    Google Scholar 

  11. Patterson, D., Rooney, N. & Galushka, M. Towards Dynamic Maintenance of Retrieval Knowledge in CBR. Proceedings of the 15th International FLAIRS Conference. AAAI Press. 2002

    Google Scholar 

  12. Portinale, L., Torasso, P. and Magro, D. Dynamic Case Memory Management, Proc. ECAI 98, pp. 73–78, John Wiley and Sons, Brighton, 1998.

    Google Scholar 

  13. Portinale, L., Torasso, P. and Magro, D. Speed up quality and competence in multi model reasoning Proceedings of the 3rd International Conference in Case-Based Reasoning pp 303–317, 1999.

    Google Scholar 

  14. Racine, K. and Yang, Q. Maintaining unstructured case-bases. In the Proceedings of the 2nd International Conference on case-Based Reasoning, ICCBR-97, pp 553–564, Providence, RI, USA. 1997.

    Google Scholar 

  15. Richter, M. The Knowledge Contained in Similarity Measures. Invited Talk, The First International Conference in Case-Based Reasoning, Sesimbra, Portugal, October, 1995.

    Google Scholar 

  16. Stanfill, C.; and Waltz, D. 1986. Towards Memory-based Reasoning. Communications of the ACM. 29(12): 1213–1228.

    Article  Google Scholar 

  17. Smyth, B. and Keane, M. Remembering to Forget.: A Competence-Preserving case Deletion Policy for Case-Based Reasoning Systems. Proceedings of 14th IJCAI, pp377–382. 1995.

    Google Scholar 

  18. Smyth, B. Constructing Competent Case-Based Reasoners: Theories, Tools and techniques. Workshop On Automating the Construction of Case-Based Reasoners, Sixteenth International Joint Conference on Artificial Intelligence, Stockholm, Sweden, pp 17–23 1999

    Google Scholar 

  19. Smyth, B. and McKenna, E. Footprint-based retrieval. Proceedings of the 3rd International Conference on Case-Based Reasoning, Munich, Germany, pp 343–357. July 1999.

    Google Scholar 

  20. Tadepalli, P. A theory of unsupervised speedup learning. Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-92), pp 229–234, 1992.

    Google Scholar 

  21. Wettschereck et al 1997. Wettschereck, D.; Aha, D.; and Mohri, T. 1997. A Review of Empirical Evaluation of Feature Weighting Methods for a Class of Lazy Learning Algorithms, Artificial Intelligence Review Journal.

    Google Scholar 

  22. Zang, Z. and Yang, Q. Towards lifetime maintenance of case-based indexes for continual case-based reasoning. In Proceedings of the 8th International Conference on Artificial Intelligence: Methodology, Systems, Applications, Sozopol, Bulgaria, 1998.

    Google Scholar 

  23. Zhu, J. and Yang, Q. Remembering to Add: Competence-preserving Case Addition Policies for Case-base Maintenance. In International Joint Conference in Artificial Intelligence 1999 (IJCAI-99), pp. 234–239. 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Patterson, D.W., Rooney, N., Galushka, M. (2002). Efficient Similarity Determination and Case Construction Techniques for Case-Based Reasoning. In: Craw, S., Preece, A. (eds) Advances in Case-Based Reasoning. ECCBR 2002. Lecture Notes in Computer Science(), vol 2416. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46119-1_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-46119-1_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44109-0

  • Online ISBN: 978-3-540-46119-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics