|
|||||
|
|
| 多粒度粗糙集和覆盖粗糙集间的近似与约简关系* | |
| 引用本文： | 谭安辉,李进金,吴伟志. 多粒度粗糙集和覆盖粗糙集间的近似与约简关系*[J]. 模式识别与人工智能, 2016, 29(8): 691-697. DOI: 10.16451/j.cnki.issn1003-6059.201608003 |
| 作者姓名： | 谭安辉 李进金 吴伟志 |
| 作者单位： | 1.浙江海洋大学 数理与信息学院 舟山 316022 2. 浙江海洋大学 浙江省海洋大数据挖掘与应用重点实验室 舟山 316022 3. 闽南师范大学 数学与统计学院 漳州 363000 |
| 基金项目： | 国家自然科学基金项目(No.61573321)、 浙江省自然科学基金项目(No.LY14F030001,LZ12F03002)、浙江海洋大学科研启动经费(No.21065014715)资助 |
| 摘 要： | 多粒度粗糙集和覆盖粗糙集是2种重要的数据处理机制.文中从近似集和属性约简2个角度探讨完备信息系统与不完备信息系统中多粒度粗糙集和覆盖粗糙集的关系.通过构造信息系统的粒空间，证明乐观多粒度粗糙集近似等价于松覆盖粗糙集近似，悲观多粒度粗糙集近似等价于紧覆盖粗糙集近似，即乐观多粒度粗糙集和悲观多粒度粗糙集可分别表示为松覆盖粗糙集和紧覆盖粗糙集.进一步指出信息系统的2类多粒度粗糙集的协调集可转化为2类覆盖粗糙集的协调集，并刻画多粒度粗糙集约简与覆盖粗糙集约简间的密切联系. |
| 关 键 词： | 粒计算 多粒度 覆盖 粗糙集 近似 约简 |
| 收稿时间： | 2015-09-08 |
Approximation and Reduction Relationships between Multi-granulation Rough Sets and Covering Rough Sets |
|
| TAN Anhui,LI Jinjin,WU Weizhi. Approximation and Reduction Relationships between Multi-granulation Rough Sets and Covering Rough Sets[J]. Pattern Recognition and Artificial Intelligence, 2016, 29(8): 691-697. DOI: 10.16451/j.cnki.issn1003-6059.201608003 | |
| Authors: | TAN Anhui LI Jinjin WU Weizhi |
| Affiliation: | 1.School of Mathematics, Physics and Information Science, Zhejiang Ocean University, Zhoushan 316022 2.Key Laboratory of Oceanographic Big Data Mining and Application of Zhejiang Province,Zhejiang Ocean University, Zhoushan 316022 3.School of Mathematics and Statistics, Minnan Normal University, Zhangzhou 363000 |
| Abstract: | Multi-granulation rough sets and covering rough sets are two important mechanisms of data processing. From the viewpoint of approximation and reduction, therelationship between multi-granulation rough sets and covering rough sets in complete and incomplete information systems are discussed. Through constructing a space of granules of an information system, it is proved that the optimistic and pessimistic multi-granulation approximations are equivalent to the loose and tense covering approximations, respectively. It means that the optimistic and pessimistic multi-granulation rough sets can be represented by the loose and tense covering rough sets, respectively. Furthermore, two types of consistent sets in multi-granulation rough sets can be transformed into two types of consistent sets in covering rough sets, and there are close relationships of reduction between multi-granulation rough sets and covering rough sets. |
| Keywords: | Granular Computing Multi-granulation Covering Rough Set Approximation Reduction |
| 点击此处可从《模式识别与人工智能》浏览原始摘要信息 | |
| 点击此处可从《模式识别与人工智能》下载全文 | |