On the Local Reduction of Information System
In this paper the definition of local reduction is proposed to describe the minimal description of a definable set by attributes of the given information system. The local reduction can present more optimal description for single decision class than the existing relative reductions. It is proven that the core of reduction or relative reduction can be expressed as the union of the cores of local reductions. The discernibility matrix of reduction and relative reduction can be obtained by composing discernibility matrixes of local reduction.
KeywordsRelative Reduction Decision System Decision Class Local Reduction Conditional Attribute
Unable to display preview. Download preview PDF.
- 2.Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems, Intelligent Decision support. In: Slowinski, R. (ed.) Handbook of applications and advances of the rough sets theory. Kluwer Academic Publishers, Dordrecht (1992)Google Scholar
- 3.Wu, W.-Z., Zhang, M., Li, H.-Z., Mi, J.-S.: Knowledge reduction in random information systems via Dempster–Shafer theory of evidence. Information Sciences (in Press)Google Scholar