Abstract
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for complex hierarchical objects.
We discuss how various problems can be represented by means of complex objects described by hierarchical attributes, and how to use similarity between them for predicting the relevant algorithms corresponding to these objects. The complex object attributes are of different types: basic attributes related to problem definition (e.g. features of object parts), attributes reflecting some additional characteristic of problem (e.g. features of more complex objects inferred from properties of their parts and their relations), and attributes representing algorithm structures (e.g. order and/or properties of operations used to solve the given problem). We show how to define these particular attributes sets, and how to recognize the similarity of objects in order to transform algorithms corresponding to these objects to a new algorithm relevant for the new incompletely defined object [1],[4].
Object similarity is defined on several levels; basic attribute recognition level, characteristic attribute recognition level and algorithm operation recognition level. Dependencies between attributes are used to link different levels. These dependencies can be extracted from data tables specifying the links.
We discuss how to classify new objects, and how to synthetize algorithm for such new object, on the basis of algorithms corresponding to similar objects. The main problem is the generation of rules enabling to create operation sequences for a new algorithm. These rules are generated using rough set approach [5].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Aamodt & E. Plaza (1994). Case Based Reasoning: Foundational Issues, Methodological Variations, and System Approaches. AI Communications.
K. Hammond (1986). CHEF: A model of case-based planing. In Proc. of AAAI-86, Cambridge MA: AAAI Press/MIT Press.
J. Kolodner (1993). Case Based Reasoning. Morgan Kaufmann.
J. Wierzbicki (1998)-“CBR for complex objects represented in hierarchical information systems”, (procedings First International Conference-Rough Sets and Current Trends in Computing, Warsaw 1998, Springer-Verlag Berlin Heidelberg.
Z.Pawlak (1991). Rough Sets. Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Boston, London, Dordrecht.
L. Polkowski, A. Skowron, J. Komorowski (1996). Approximate case-based reason ing: A rough mereological approach. In: H.D. Barkhard, M. Lenz (eds.), Fourth German Workshop on Case-Based Reasoning. System Development and Evaluation, Informatik Berichte 55, Humboldt University, Berlin, 144–151.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wierzbicki, J. (2001). Rough Set Approach to CBR. In: Ziarko, W., Yao, Y. (eds) Rough Sets and Current Trends in Computing. RSCTC 2000. Lecture Notes in Computer Science(), vol 2005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45554-X_62
Download citation
DOI: https://doi.org/10.1007/3-540-45554-X_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43074-2
Online ISBN: 978-3-540-45554-7
eBook Packages: Springer Book Archive