Reduction and Axiomization of Covering Generalized Rough Sets

CASIA OpenIR > 09年以前成果

	Reduction and Axiomization of Covering Generalized Rough Sets
	William Zhu; Fei-Yue Wang
发表期刊	Information Sciences
	2003
卷号	152 期号:-页码:217-230
摘要	This paper investigates some basic properties of covering generalized rough sets, and their comparison with the corresponding ones of Pawlaks rough sets, a tool for data mining. The focus here is on the concepts and conditions for two coverings to generate the same covering lower approximation or the same covering upper approximation. The concept of reducts of coverings is introduced and the procedure to find a reduct for a covering is given. It has been proved that the reduct of a covering is the minimal covering that generates the same covering lower approximation or the same covering upper approximation, so this concept is also a technique to get rid of redundancy in data mining. Furthermore, it has been shown that covering lower and upper approximations determine each other. Finally, a set of axioms is constructed to characterize the covering lower approximation operation.
关键词	Computing With Words Covering Covering Lower And Upper Approximations Fuzzy Sets Reduct Rough Sets
文献类型	期刊论文
条目标识符	http://ir.ia.ac.cn/handle/173211/14571
专题	09年以前成果
通讯作者	Fei-Yue Wang
推荐引用方式 GB/T 7714	William Zhu,Fei-Yue Wang. Reduction and Axiomization of Covering Generalized Rough Sets[J]. Information Sciences,2003,152(-):217-230.
APA	William Zhu,&Fei-Yue Wang.(2003).Reduction and Axiomization of Covering Generalized Rough Sets.Information Sciences,152(-),217-230.
MLA	William Zhu,et al."Reduction and Axiomization of Covering Generalized Rough Sets".Information Sciences 152.-(2003):217-230.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
Reduction and Axiomi（133KB）	期刊论文	作者接受稿	开放获取	CC BY-NC-SA	浏览