Please use this identifier to cite or link to this item:
Title: On the structure of reduction of information system
Authors: Chen, DG
Tsang, ECC
Keywords: Matrix algebra
Rough set theory
Issue Date: 2005
Publisher: IEEE
Source: Proceedings of 2005 International Conference on Machine Learning and Cybernetics, 2005, 18-21 August 2005, Guangzhou, China, v. 5, p. 3125-3129 How to cite?
Abstract: In this paper a deeper investigation on the structure of reduction of information system is presented. The definition of local reduction is proposed in information system 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 matrices of local reduction. So deep insight on the structure of reductions of rough sets is presented and the existing reductions of rough sets can be brought into the framework of local reduction.
ISBN: 0-7803-9091-1
DOI: 10.1109/ICMLC.2005.1527479
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Dec 10, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.