Efficient Real Time Maintenance of Retrieval Knowledge in Case-Based Reasoning

Abstract. In this paper, we investigate two novel indexing schemes called DHS and D-HS+PSR(II) designed for use in case-based reasoning systems. D-HS is based on a matrix of cases indexed by their discretised attribute values. DHS+PSR(II) extends D-HS by combining the matrix with an additional tree-like indexing structure to facilitate solution reuse. DHS+PSR(II)’s novelty lies in its ability to improve retrieval efficiency over time by reusing previously encountered solution patterns. Its benefits include its accuracy, speed and ability to facilitate efficient real time maintenance of retrieval knowledge as the size of the case-base grows. We present empirical results from an analyses of 20 case-bases and demonstrate the technique to be of similar competency to C4.5 yet much more efficient. Its performance advantages over C4.5 are shown to be especially apparent when tested on case-bases which grow in size over time.

• Type: Conference
• Year: 2003
• Where: ICCBR
• Authors: David W. Patterson, Mykola Galushka, Niall Rooney
• Keywords: Additional Tree-like Indexing, Case-based Reasoning Systems, ICCBR 2003, Schemes Called Dhs