DocumentCode
441964
Title
On the structure of reduction of information system
Author
Chen, De-Gang ; Tsang, Eric C C
Author_Institution
Dept. of Math. & Phys., North China Electr. Power Univ., Beijing, China
Volume
5
fYear
2005
fDate
18-21 Aug. 2005
Firstpage
3125
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.
Keywords
matrix algebra; rough set theory; decision class; discernibility matrix; information system; local reduction; relative reduction; rough set; Artificial intelligence; Databases; Diseases; Information entropy; Information systems; Intelligent systems; Mathematics; Physics computing; Rough sets; Set theory; Rough sets; core; discernibility matrix; local reduction; reduction;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2005. Proceedings of 2005 International Conference on
Conference_Location
Guangzhou, China
Print_ISBN
0-7803-9091-1
Type
conf
DOI
10.1109/ICMLC.2005.1527479
Filename
1527479
Link To Document