Title :
The relative reduction of covering generalized rough sets
Author :
Zhang, Yanlan ; Li, Jinjin
Author_Institution :
Dept. of Comp. Sci. & Eng., Zhangzhou Normal Univ., Zhangzhou
Abstract :
In covering generalized rough set theory, it is necessary to discuss the relative relation between knowledge represented by covering. This paper proposes two kinds of relative reductions in a family of coverings, and constructs two discernibility matrixes to investigate the structure of all relative reductions. Also, the reduction of ordered information system under dominance relation is used to show an application of the method of reduction introduced in this paper.
Keywords :
information systems; matrix algebra; rough set theory; discernibility matrixes; generalized rough set theory covering; ordered information system; relative reduction; Data mining; Information systems; Rough sets; Set theory;
Conference_Titel :
Granular Computing, 2008. GrC 2008. IEEE International Conference on
Conference_Location :
Hangzhou
Print_ISBN :
978-1-4244-2512-9
Electronic_ISBN :
978-1-4244-2513-6
DOI :
10.1109/GRC.2008.4664647
