Using genetic algorithms to discover selection criteria for contradictory solutions retrieved by CBR

  • Authors:
  • Costas Tsatsoulis;Brent Stephens

  • Affiliations:
  • Information and Telecommunication Technology Center, Department of Electrical Engineering and Computer Science, The University of Kansas;Information and Telecommunication Technology Center, Department of Electrical Engineering and Computer Science, The University of Kansas

  • Venue:
  • ICCBR'03 Proceedings of the 5th international conference on Case-based reasoning: Research and Development
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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).Suc h 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.