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

基于不完备信息系统的决策树生成算法
引用本文:关晓蔷,钱宇华.基于不完备信息系统的决策树生成算法[J].计算机科学,2012,39(1):156-158.
作者姓名:关晓蔷  钱宇华
作者单位:山西大学计算机与信息技术学院 计算智能与中文信息处理省部共建重点实验室太原030006
基金项目:国家自然科学基金,山西省青年科技基金
摘    要:决策树是一种有效地进行实例分类的数据挖掘方法。在处理不完备信息系统中的缺省值数据时,现有决策树算法大多使用猜测技术。在不改变缺失值的情况下,利用极大相容块的概念定义了不完备决策表中条件属性对决策属性的决策支持度,将其作为属性选择的启发式信息。同时,提出了一种不完备信息系统中的决策树生成算法IDTBDS,该算法不仅可以快速得到规则集,而且具有较高的准确率。

关 键 词:决策树  不完备信息系统  决策支持度

Algorithm for Generating Decision Tree Based on Incomplete Information Systems
GUAN Xiao-qiang , QIAN Yu-hua.Algorithm for Generating Decision Tree Based on Incomplete Information Systems[J].Computer Science,2012,39(1):156-158.
Authors:GUAN Xiao-qiang  QIAN Yu-hua
Affiliation:(Key Laboratory of Ministry of Education for Computation Intelligence and Chinese Information Processing,School of Computer and Information Technology,Shanxi University,Taiyuan 030006,China)
Abstract:Decision trees are a kind of effective data mining methods to case classification. During processing objects with missing values in the incomplete information systems, the guessing technologies are often used in most of the existing decision tree algorithms. In this paper, we defined a condition attribute's decision support degree with respect to the decision attribute with the concept of a maximal consistent block, which can be regarded as the heuristic information.Moreover, we proposed an algorithm for generating a decision tree from an incomplete information system, which called IDTBDS. Note that the proposed algorithm not only fast extract the rule sets, and but also these rules possess more classification accuracy.
Keywords:Decision tree  Incomplete information systems  Decision support degree
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号