Decomposition of CBR

CBR methods can be divided into four steps, retrieve - find the best matching of a previous case, reuse - find what can be reused from old cases, revise - check if the proposed solution is correct, and retain - learn from the problem solving experience. This decomposition of methods depends heavily on Aamodt and Plaza [4], and is illustrated in Fig 2.2.

  

Figure 2.4: The CBR Cycle.

Before outlining the substructures, we explain how cases are indexed, which is vital for fast retrieval of cases. In order not to search through all cases in the casebase (in linear time), some features are selected for organizing the cases into a tree. Similar cases can then be found by traversing the tree instead of searching the whole casebase.