摘要
Rough set theory is a technique of granular computing. In this paper, we study a type of generalized rough sets based on covering. There are several literatures[1,40-43] exploring covering-based rough sets. Our focus of this paper is on the dualities in rough operations.
Rough set theory is a technique of granular computing. In this paper, we study a type of generalized rough sets based on coveting. There are several literatures[ 1,40-43 ] exploring covering-based rough sets. Our focus of this paper is on the dualities in rough operations.
出处
《南昌工程学院学报》
CAS
2006年第2期56-59,共4页
Journal of Nanchang Institute of Technology
基金
The New Economy ResearchFund ofNew Zealand
