| 基于覆盖的粗糙模糊集的粗糙熵 |
| |
| 引用本文： | 徐菲菲,苗夺谦,李道国,魏莱.基于覆盖的粗糙模糊集的粗糙熵[J].计算机科学,2006,33(10):179-181. |
| |
| 作者姓名： | 徐菲菲 苗夺谦 李道国 魏莱 |
| |
| 作者单位： | 同济大学计算机科学与工程系,上海,200092 |
| |
| 基金项目： | 国家自然科学基金;山西省高科技开发项目 |
| |
| 摘 要： | 覆盖约简是研究覆盖去冗余问题的一种有效方法。本文在基于最简覆盖的粗糙集模型的基础上,将粗糙度和粗糙熵的概念引入基于最简覆盖的粗糙模糊集,用来度量其不确定性程度;讨论了它们的一些性质,并通过实例说明粗糙熵比粗糙度更能精确地反映基于最简覆盖的粗糙模糊集的不确定性程度。
|
| 关 键 词： | 粗糙模糊集 最简覆盖 粗糙度 粗糙熵 |
Rough Entropy of Rough Fuzzy Sets Based on Covering |
| |
| XU Fei-Fei,MIAO Duo-Qian,LI Dao-Guo,WEI Lai.Rough Entropy of Rough Fuzzy Sets Based on Covering[J].Computer Science,2006,33(10):179-181. |
| |
| Authors: | XU Fei-Fei MIAO Duo-Qian LI Dao-Guo WEI Lai |
| |
| Affiliation: | Department of Computer Science and Technology, Tongji University, Shanghai 200092 |
| |
| Abstract: | Covering reduction is an efficient way of research on simplifying covering problem. On the basis of study on generalized rough sets covering reduction, roughness and rough entropy are introduced to discuss the uncertainty of rough fuzzy sets based on covering reduction, and their properties are established. Moreover, we give an example to show that, as an accuracy measure, rough entropy is better than roughness. |
| |
| Keywords: | Rough fuzzy sets Covering reduction Roughness Rough entropy |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机科学》浏览原始摘要信息 |
|
点击此处可从《计算机科学》下载全文 |
|
