An investigation of the K-tree search algorithm for efficient case representation and retrieval

Abstract

This paper presents a new method of retrieving cases from a case-base on the K-tree search algorithm. Building an automated CBR system relies on representing knowledge in an appropriate form and having efficient case retrieval methods. Using the Intelligent Business Process Reengineering System (IBPRS) architecture as a base, we discuss a model-based case representation approach to solve the knowledge elicitation bottleneck problems. In addition to presenting the model-based case representation method, we introduce a K-tree search method to transform the case base into a tree structure, and discuss how it can be applied to the case retrieval process in IBPRS. The basic idea of the algorithm is to use various attribute values defined in the case label as general information for the case matching and retrieval.