首页 | 官方网站   微博 | 高级检索  
     

一种基于条件熵的增量式属性约简算法
引用本文:刘薇,梁吉业,魏巍,钱宇华.一种基于条件熵的增量式属性约简算法[J].计算机科学,2011,38(1):229-231.
作者姓名:刘薇  梁吉业  魏巍  钱宇华
作者单位:山西大学计算机与信息技术学院计算机智能与中文信息处理教育部重点实验室,太原,030006
基金项目:本文受国家自然科学基金(No. 60773133, 70971080, 60903110),广西省自然科学基金(No.2008011038,2009021017-1)资助。
摘    要:粗糙集是一种处理不确定、不完全知识的数学工具,属性约简是粗糙集理论的重要研究内容之一。提出了一种基于条件熵的快速增量约简方法,主要分析了在对象动态增加情况下信息熵的变化机制。该算法通过判断更新前决策表的约简属性对新增对象的区分情况来计算新的条件熵值,就可以快速求解出更新后的决策表的属性约简结果。实验结果也进一步验证了该方法的有效性。

关 键 词:条件熵,增量式,属性约简,决策表

Incremental Algorithm for Attribute Reduction Based on Conditional Entropy
LIU Wei,LIANG Ji-ye,WEI Wei,QIAN Yu-hua.Incremental Algorithm for Attribute Reduction Based on Conditional Entropy[J].Computer Science,2011,38(1):229-231.
Authors:LIU Wei  LIANG Ji-ye  WEI Wei  QIAN Yu-hua
Affiliation:(Key Laboratory of Ministry of Education for Computation Intelligence and Chinese Information Processing, School of Computer & Information Technology,Shanxi University,Taiyuan 030006,China)
Abstract:Rough set theory is a mathematic tool to deal with incomplete and uncertain information, in which attribute reduction is one of important issues. The changing mechanism of condition entropy was analyzed when a new object was added to the original decision table. Based on this mechanism, a new incremental algorithm for attribute reduction was proposed. In this algorithm we divided the added objects into three cases. Furthermore, by these different cases incremental attribute reduces could be calculated quickly. At last, the validity of the proposed algorithm was depicted by an experiment.
Keywords:Conditional entropy  Incrcmcntal  Attribute reduction  Decision table
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号