粗集结合决策树的一种数据挖掘算法  

A Data Mining Algorithm for Rough Sets and Decision Trees

作　　者：吴艳艳[1] 

机构地区：[1]华中科技大学工程计算与仿真研究所,湖北武汉430074

出　　处：《计算机工程与科学》2004年第2期60-62,共3页Computer Engineering & Science

摘　　要：决策树是一种重要的数据挖掘方法,本文将决策树的基本建树思想ID3算法与对象决策属性化简的粗集理论相结合,得到一种新型的决策树建树方法。通过实例证明了该方法的效率有所提高,使挖掘的效果更简单、更容易理解。Decision Trees is an important method for data mining. A new method of building a decision tree is given in this paper, which is based on the algorithm for ID3 and rough sets. This paper also improves its efficiency with an example and gives a rule reduction method to make the results succinct and easy-to-understand.

关 键 词：粗集 决策树 数据挖掘 ID3算法 知识表达系统 

分 类 号：TP311.131[自动化与计算机技术—计算机软件与理论]