Skip to main content

Using Genetic Algorithms to Discover Selection Criteria for Contradictory Solutions Retrieved by CBR

  • Conference paper
  • First Online:
  • 988 Accesses

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

Abstract

In certain domains a case base may contain contradictory but correct cases. The contradictory solutions are due to known domain and problem characteristics which are not part of the case description, and which cannot be formally or explicitly described. In such situations it is important to develop methods that will use these criteria to select among the competing solutions of the matching cases Our domain of application was the assignment of billing numbers to the shipment of goods, and the case base contained numerous cases of similar or even identical problems that had different solutions (billing numbers). Such contradictory solutions were correct and an outcome of domain constraints and characteristics that were not part of the cases and were also not formally known and defined. It was assumed that the frequency with which a solution appeared among the retrieved cases and the recency of the time the solution had been applied were important for selecting among competing solutions, but there was no explicit way for doing so. In this paper we show how we used genetic algorithms to discover methods to combine and operationalize vague selection criteria such as “recency” and “frequency.” GAs helped us discover selection criteria for the contradictory solutions retrieved by CBR retrieval and significantly improved the accuracy and performance of the CBR system.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. de Silva Garza, A.G. and M.L. Maher: ”An Evolutionary Approach to Case Adaptation,” in Proceedings of 3rd Int. Conf. on CBR (ICCBR-99),K.-D. Althoff, R. Bergmann and L.K. Branting (Eds.), Berling: Springer-Verlag, (1999) 162–172.

    Google Scholar 

  2. Huang, Y.: ”An Evolutionary Agent Model of Case-Based Classification,” in Proceedings of 3rd European CBR Workshop (EWCBR-96), I. Smith and B. Faltings (Eds.), Berling: Springer-Verlag, (1996) 193–203.

    Google Scholar 

  3. Hunt, J.: ”Evolutionary Case Based Design,” in Progress in Case-Based Reasoning: 1st UK Workshop, I.D. Watson (Ed.), Berlin: Springer-Verlag, (1995) 17–31.

    Google Scholar 

  4. Job, D., Miller, J. and Shankararaman, V.: ”Combining CBR abd GA for Designing FPGAs,” in Proceedings of 3rd Int.Cnf.on Computational Intelligence and Multimedia Applications, (1999) 133–137.

    Google Scholar 

  5. Kelly, J.D. and Davis, L.: ”A Hybrid Genetic Algorithm for Classification,” in Proceedings of 12th Int. Conf. on AI (IJCAI-91), (1991) 645–650.

    Google Scholar 

  6. Kolodner, J: ”Selecting the Best Case for a Case-Based Reasoner,” in Proceedings of 11th Ann. Conf. of the Cognitive Science Society, Hillsdale, NJ: Larence Erlbaum Associates, (1989) 155–162.

    Google Scholar 

  7. Kool, K., Daelemans, W. and Zavrel, J.: ”Genetic Algorithms for Feature Relevance Assignment in Memory-Based Language Processing,” in Proceedings of 4th Conf.on Computational Natural Language Learning and of the 2nd Learning Language in Logic Workshop, Lisbon, Somerset, NJ: Association for Computational Linguistics, (2000) 103–106.

    Google Scholar 

  8. Leake, D.B.and Wilson, D.C: ”Case-Base Maintenance: Dimensions and Directions,” in Proceedings of European Workshop on Case-Based Reasoning. Springer-Verlag, Berlin Heidelberg New York (1998) 196–207.

    Google Scholar 

  9. Liu, X.: ”Combining Genetic Algorithms and Case-based Reasoning for Structure Design,” M.S. Computer Science Thesis, University of Nevada at Reno (1996).

    Google Scholar 

  10. Louis, S.J. and Johnson, J.: ”Robustness of Case-Initialized Genetic Algorithms,” in Proceedings of 12th Int.Florida AI Research Society (FLAIRS-99), (1999) 129–133.

    Google Scholar 

  11. Oatley, G., Tait, J. and McIntyre, J.: ”A Case-based Reasoning Tool for Vibration Analysis,” in Applications and Innovations in Expert Systems VI: Proceedings of the BCS Expert Systems Conference, R. Milne, A. Macintosh and M. Bramer (eds.), Berlin: Springer-Verlag (1998).

    Google Scholar 

  12. Perez E.I., Coello, C.A. and Aguirre, A.H.: ”Extracting and Re-Using Design Patterns from Genetic Algorithms using Case-Based Reasoning,” in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2002, Langdon, W.B.et al. (Eds.), San Francisco, CA: Morgan Kaufmann Publishers, (2002).

    Google Scholar 

  13. Purvis, L. and Athalye, S.: ”Towards Improving Case Adaptability with a Genetic Algorithm,” in 2nd Int. Conf. on CBR (ICCBR-97), Leake, D.B. and E. Plaza (Eds.), Berlin: Springer-Verlag, (1997) 403–412.

    Google Scholar 

  14. Ramsey, C.L. and Grefenstette, J.J.: ”Case-Based Initialization of Genetic Algorithms,” in Proceedings of 5th Int. Conf. on Genetic Algorithms, (1993) 84–91.

    Google Scholar 

  15. Shin, K. and Han, I: ”Case-based Reasoning Supported by Genetic Algorithms for Corporate Bond Rating,” J. of Expert Systems with Applications 16(2), (1999) 85–95.

    Article  Google Scholar 

  16. Skalak, D.B: ”Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms,” in Proceedings of 11th Int. Conf. on Machine Learning, (1994) 293–301.

    Google Scholar 

  17. Smyth, B. and McKenna, E.: ”Modeling the Competence of Case-Bases,” in Proceedings of 4th European Workshop on Case-Based Reasoning, EWCBR-98, Lecture Notes in Artificial Intelligence 1488, Smyth, B.and Cunningham, P.) (Eds.), Berlin: Springer Verlag, (1998) 208–

    Google Scholar 

  18. Soh, L-K., Tsatsoulis, C., Jones, M. and Agah, A: ”Evolving Cases for Case-Based Reasoning Multiagent Negotiations,” in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2001, Spector, L. et al (Eds.), San Francisco, CA: Morgan Kaufmann Publishers, 909 (2001).

    Google Scholar 

  19. Soh, L-K. and Tsatsoulis, C.: ”Combining Genetic Algorithms and Case-Based Reasoning for Genetic Learning of a Casebase: A Conceptual Framework,” in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2001, Spector, L. et al (Eds.), San Francisco, CA: Morgan Kaufmann Publishers, (2001) 376–383.

    Google Scholar 

  20. Zhu, J and Yang, Q.: ”Remembering to Add: Competence-Preserving Case-Addition Policies for Case Base Maintenance,” in Proceedings of the Fifteenth Int. J. Conf. on Artificial Intelligence. Morgan Kaufman (1999) 234–239.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tsatsoulis, C., Stephens, B. (2003). Using Genetic Algorithms to Discover Selection Criteria for Contradictory Solutions Retrieved by CBR. In: Ashley, K.D., Bridge, D.G. (eds) Case-Based Reasoning Research and Development. ICCBR 2003. Lecture Notes in Computer Science(), vol 2689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45006-8_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-45006-8_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45006-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics