A New Type of Covering-Based Rough Sets

  As a technique for granular computing,rough sets deal with the vagueness and granularity in information systems.Covering-based rough sets are natural extensions of the classical rough sets by relaxing the partitions to coverings and have been applied for many fields.In this paper,a new type of covering-based rough sets are proposed and the properties of this new type of covering-based rough sets are studied.First,we introduce a concept of inclusion degree into covering-based rough set theory to explore some properties of the new type of covering approximation space.Second,a new type of covering-based rough sets is established based on inclusion degree.Moreover,some properties of the new type of covering-based rough sets are studied.Finally,a simple application of the new type of covering-based rough sets to network security is given.

作者: Bin Yang William Zhu
作者单位: Lab of Granular Computing,Minnan Normal University, Zhangzhou 363000, 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日