首页> 外文会议>Society of Photo-Optical Instrumentation Engineers Conference on Data Mining and Knowledge Discovery >Knowledge Reduction Algorithms Based on Rough Set and Conditional Information Entropy
【24h】

Knowledge Reduction Algorithms Based on Rough Set and Conditional Information Entropy

机译:基于粗糙集和条件信息熵的知识减少算法

获取原文

摘要

Rough Set is a valid mathematical theory developed in recent years, which has the ability to deal with imprecise, uncertain, and vague information. It has been applied in such fields as machine learning, data mining,intelligent data analyzing and control algorithm acquiring successfully. Many researchers have studied rough sets in different view. In this paper, the authors discuss the reduction of knowledge using information entropy in rough set theory. First, the changing tendency of the conditional entropy of decision attributes given condition attributes is studied from the viewpoint of information. Then, two new algorithms based on conditional entropy are developed. These two algorithms are analyzed and compared with MIBARK algorithm. Furthermore, our simulation results show that the algorithms can find the minimal reduction in most cases.
机译:粗糙集是近年来开发的有效数学理论,具有处理不精确,不确定和模糊信息的能力。它已应用于机器学习,数据挖掘,智能数据分析和控制算法成功的这些领域。许多研究人员在不同的视野中研究了粗糙的套装。在本文中,作者讨论了在粗糙集理论中使用信息熵的减少。首先,从信息的观点来看,研究了给定条件属性的决策属性的条件熵的变化趋势。然后,开发了两个基于条件熵的新算法。分析了这两种算法,并与Mibark算法进行了比较。此外,我们的仿真结果表明,大多数情况下,该算法可以找到最小的减少。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号