| 广义覆盖粗集的约简 |
| |
| 引用本文： | 张燕兰,李进金.广义覆盖粗集的约简[J].模糊系统与数学,2010,24(3). |
| |
| 作者姓名： | 张燕兰 李进金 |
| |
| 作者单位： | 漳州师范学院,计算机科学与工程系,福建,漳州,363000 |
| |
| 基金项目： | 国家自然科学基金资助项目，福建省科技项目 |
| |
| 摘 要： | 在保持一对覆盖上、下近似算子不变的条件下,探讨覆盖族的约简.利用所构造的辩识矩阵给出覆盖族的约简与核心的判别定理,并提出基于信息量的寻找最小约简的算法,从而进一步完善广义覆盖粗集的约简理论.
|
| 关 键 词： | 覆盖上、下近似算子 约简 辨识矩阵 信息量 |
The Reduction of Covering Generalized Rough Sets |
| |
| ZHANG Yan-lan,LI Jin-jin.The Reduction of Covering Generalized Rough Sets[J].Fuzzy Systems and Mathematics,2010,24(3). |
| |
| Authors: | ZHANG Yan-lan LI Jin-jin |
| |
| Institution: | ZHANG Yan-lan,LI Jin-jin (Department of Computer,Zhangzhou Normal College,Zhangzhou 363000,China) |
| |
| Abstract: | This paper proposes the reduction for a family of coverings preserving the upper approximation operator and lower approximation operator. Then,it constructs a discernibility matrix to give judgement theorems for reducts and core. It also gives an algorithm based on information quantity for the reduction. The results add something divertive to covering generalized rough sets. |
| |
| Keywords: | Covering Upper (Lower) Approximation Operator Discernibility Matrix Information Quantity Reduction |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
