基于覆盖的粗糙模糊集的粗糙熵

计算机科学 ›› 2006, Vol. 33 ›› Issue (10): 179-181.

基于覆盖的粗糙模糊集的粗糙熵

徐菲菲苗夺谦李道国魏莱

同济大学计算机科学与工程系,上海200092

出版日期:2018-11-17 发布日期:2018-11-17
基金资助:
国家自然科学基金项目（60175016,60475019）、山西省高校高科技研究开发项目（20051277）.

XU Fei-Fei, MIAO Duo-Qian, LI Dao-Guo, WEI Lai （Department of Computer Science and Technology, Tongji University, Shanghai 200092）

Online:2018-11-17 Published:2018-11-17

摘要/Abstract

摘要： 覆盖约简是研究覆盖去冗余问题的一种有效方法。本文在基于最简覆盖的粗糙集模型的基础上，将粗糙度和粗糙熵的概念引入基于最简覆盖的粗糙模糊集，用来度量其不确定性程度；讨论了它们的一些性质，并通过实例说明粗糙熵比粗糙度更能精确地反映基于最简覆盖的粗糙模糊集的不确定性程度。

关键词: 粗糙模糊集最简覆盖粗糙度粗糙熵

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 cove

Key words: Rough fuzzy sets, Covering reduction, Roughness, Rough entropy

徐菲菲苗夺谦李道国魏莱. 基于覆盖的粗糙模糊集的粗糙熵[J]. 计算机科学, 2006, 33(10): 179-181. https://doi.org/

XU Fei-Fei, MIAO Duo-Qian, LI Dao-Guo, WEI Lai （Department of Computer Science and Technology, Tongji University, Shanghai 200092）. [J]. Computer Science, 2006, 33(10): 179-181. https://doi.org/

参考文献

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed