首页 | 本学科首页   官方微博 | 高级检索  
     

基于新的条件熵的决策树规则提取方法
引用本文:孙林,徐久成,马媛媛.基于新的条件熵的决策树规则提取方法[J].计算机应用,2007,27(4):884-887.
作者姓名:孙林  徐久成  马媛媛
作者单位:河南师范大学,计算机与信息技术学院,河南,新乡,453007
基金项目:河南省自然科学基金 , 河南省高校新世纪优秀人才支持计划
摘    要:分析了知识约简过程中现有信息熵反映决策表“决策能力”的局限性,定义了一种新的条件熵,以弥补现有信息熵的不足;然后对传统启发式方法中选择属性的标准进行改进,由此给出了新的属性重要性定义;以新的属性重要性为启发式信息设计决策树规则提取方法。该方法的优点在于构造决策树及提取决策规则前不进行属性约简,计算直观,时间复杂度较低。应用实例分析的结果表明,该方法能提取更为简洁有效的决策规则。

关 键 词:粗糙集  数据挖掘  条件熵  规则  决策树
文章编号:1001-9081(2007)04-0884-04
收稿时间:2006-10-23
修稿时间:2006-10-23

Rules extraction method of decision tree based on new conditional entropy
SUN Lin,XU Jiu-cheng,MA Yuan-yuan.Rules extraction method of decision tree based on new conditional entropy[J].journal of Computer Applications,2007,27(4):884-887.
Authors:SUN Lin  XU Jiu-cheng  MA Yuan-yuan
Affiliation:College of Computer and Information Technology, Henan Normal University, Xinxiang Henan 453007, China
Abstract:The disadvantages of the current information entropy for estimating decision ability were analyzed deeply. To eliminate the limitations, a new conditional entropy was defined. The attribute selection metric of traditional heuristic algorithm was modified, so the new improved significance of an attribute was proposed. Finally, a heuristic algorithm for rifles extraction of decision tree was designed. This reduction method does not need attribute reduction before extracting decision rifles, and its computation is direct and efficient, and its time complexity is less than the others. The experiment and comparison show that the algorithm provides more precise and simple decision rules.
Keywords:rough set  data mining  conditional entropy  rule  decision tree
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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