DocumentCode :
2396512
Title :
On the upper approximations of covering generalized rough sets
Author :
Tsang, Eric C C ; Chen, Degang ; Lee, John W T ; Yeung, Daniel S.
Author_Institution :
Dept. of Comput., Hong Kong Polytech. Univ., Kowloon, China
Volume :
7
fYear :
2004
fDate :
26-29 Aug. 2004
Firstpage :
4200
Abstract :
The covering generalized rough set is an improvement of Pawlak rough set to deal with more complex practical problems which the latter one cannot handle. However, many basic notions in this theory are not as widely agreeable as in the Pawlak rough set theory. We mainly improve the definition of upper approximation for covering generalized rough sets to make it more reasonable than the existing ones. Thus we set up a framework for the approximation operators of covering rough sets.
Keywords :
approximation theory; generalisation (artificial intelligence); rough set theory; Pawlak rough set theory; covering generalized rough set; upper approximation; Algebra; Cybernetics; Data analysis; Information systems; Mathematics; Rough sets; Set theory; Uncertainty;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
Print_ISBN :
0-7803-8403-2
Type :
conf
DOI :
10.1109/ICMLC.2004.1384576
Filename :
1384576
Link To Document :
بازگشت