Covering Approximations in Set-Valued Information Systems

  As one of three basic theories of granular computing,rough set theory provides a useful tool for dealing with the granularity in information systems.Covering-based rough set theory is a generalization of this theory for handling covering data,which frequently appear in set-valued information systems.In this paper,we propose a covering in terms of attribute sets in a set-valued information system and study its responding three types of covering approximations.Moreover,we show that the covering approximation operators induced by indiscernible neighborhoods and neighborhoods are equal to the approximation operators induced by the tolerance and similarity relations,respectively.Meanwhile,the covering approximation operators induced by complementary neighborhoods are equal to the approximation operators induced by the inverse of the similarity relation.Finally,by introducing the concept of relational matrices,the relationships of these approximation operators are equivalently represented.

作者单位: Lab of Granular Computing,Minnan Normal University, Zhangzhou, China
母体文献: The 9th International Conference on Rough Sets and Knowledge Technology (RSKT 2014)(第九届粗糙集与知识技术国际会议)论文集
会议名称: The 9th International Conference on Rough Sets and Knowledge Technology (RSKT 2014)(第九届粗糙集与知识技术国际会议)
会议时间: 2014年1月1日
会议地点: 上海
主办单位: 中国人工智能学会,同济大学
语 种: eng
在线出版日期: 2015年8月31日