| 注册
首页|期刊导航|计算机工程与应用|粗糙集不确定性度量的矩阵运算

粗糙集不确定性度量的矩阵运算

解滨 米据生 张军鹏

计算机工程与应用2011,Vol.47Issue(29):42-45,4.
计算机工程与应用2011,Vol.47Issue(29):42-45,4.DOI:10.3778/j.issn.1002-8331.2011.29.012

粗糙集不确定性度量的矩阵运算

Matrix computation for measuring uncertainty of rough sets

解滨 1米据生 2张军鹏1

作者信息

  • 1. 河北师范大学数学与信息科学学院,石家庄050016
  • 2. 河北师范大学信息技术学院,石家庄050016
  • 折叠

摘要

Abstract

As one of the most important issues in rough set theory,roughness and fuzziness of rough sets have been widely studied.An improved method is proposed for measuring the uncertainty of rough sets based on fuzzy theory and granular computing theory.A definition of relative knowledge granulation and a concept of boundary entropy for an information sys tem are given, under which the measure functions of roughness and fuzziness are modified. Both of roughness and fuzziness are monotonously decreasing with the refining of knowledge granularities in approximation spaces.Two matrix algorithms are presented for measuring the roughness and fuzziness of rough sets,which are easy to implement.

关键词

粗糙集/不确定性/知识粒度/粗糙度/模糊度

Key words

rough sets/uncertainty/knowledge granularities/roughness/fuzziness

分类

信息技术与安全科学

引用本文复制引用

解滨,米据生,张军鹏..粗糙集不确定性度量的矩阵运算[J].计算机工程与应用,2011,47(29):42-45,4.

基金项目

国家自然科学基金(the National Natural Science Foundation of China under Grant No.60773174,No.60963006) (the National Natural Science Foundation of China under Grant No.60773174,No.60963006)

河北省自然科学基金(No.F2009000316). (No.F2009000316)

计算机工程与应用

OACSCDCSTPCD

1002-8331

访问量0
|
下载量0
段落导航相关论文