引用本文:苗夺谦,王 珏.粗糙集理论中概念与运算的信息表示*.软件学报,1999,10(2):113-116
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 9647次   下载 7194 本文二维码信息
码上扫一扫!
分享到: 微信 更多
粗糙集理论中概念与运算的信息表示*
苗夺谦1,2, 王 珏2
1.山西大学数学系,太原,030006;2.中国科学院自动化研究所,北京,100080
摘要:
粗糙集理论对知识进行了形式化定义,为知识处理提供了一套严密的分析工具,但在代数表示下,粗糙集理论的本质不易被理解,并且,尚无高效的知识约简算法.该文首先建立了知识与信息之间的关系;然后,在此基础上给出了粗糙集理论中概念与运算的信息表示;最后,证明了知识约简在信息和代数两种不同表示下是等价的.这些结论有助于人们深刻理解粗糙集理论的本质,同时,为寻找高效的知识约简算法奠定了基础.
关键词:  粗糙集,知识表示,知识约简,信息熵,等价性.
DOI:
分类号:
基金项目:本文研究得到国家863高科技项目基金、国家青年基金和山西省青年基金资助.
An Information Representation of the Concepts and Operations in Rough Set Theory
MIAO Duo-qian,WANG Jue
Abstract:
Rough set theory proposes a formal definition of knowledge and provides a series of tools to deal with knowledge. However, in the algebraic representation of this theory, it is difficult to understand the essence of rough set theory, and efficient algorithm of knowledge reduction has not been found. In this paper, a relationship between knowledge and information is set up, and then based on the relationship an information representation of the concepts and operations about rough set theory is given. Finally, the equivalence properties between information representation and algebraic representation of knowledge reduction are proved. These conclusions are helpful for people to understand the essence of rough set theory and essential to seek new efficient algorithm of knowledge reduction.
Key words:  Rough set, knowledge representation, knowledge reduction, information entropy, equivalence property.