基于决策树的数据挖掘算法的技术研究-计算机应用专业论文.docxVIP

太原理工大学硕士研究生毕业论文 太原理工大学硕士研究生毕业论文 基于决策树的数据挖掘算法的技术研究 摘 要 决策树学习算法在数据挖掘技术中具有很重要的作 用，本文研究了决策树学习算法中最为重要的一种ID3 (Information Definition)算法，并引入用户兴趣度的概 念定义了ID3的改进算法，在一定程度上解决了决策支 持过程中大数据掩盖小数据的问题。 首先，本文提出了在传统ID3算法的基础上，引入 用户兴趣度的概念来改进ID3算法，在ID3算法信息熵 计算公式中，对信息量加权和增加用户兴趣度，使得算 法不仅仅是依赖实例进行分类，而是在实例的基础上对 具体属性加入先验知识调节其对分类的信息量，提高分 类的准确性，并用实例验证了改进算法的有效性。 其次，提出了利用属性对正例的影响度来比较属性 对分类提供的信息量，进而选择分类属性构造决策树的 条件概率决策树算法，同时实例计算说明该算法有效地 简化了决策树的生成过程。 为了对算法进行评价，论文还设计了一个用不同算 法对罗斯文商贸数据库进行规则提取的试验系统，利用 该系统提取了非常实用的商业规则。 关键词：数据挖掘，决策树算法，ID3算法，信息增益， 熵 太原理工大学硕士研究生毕业论文RESEARCH 太原理工大学硕士研究生毕业论文 RESEARCH oN TECHNOLoGY oF DATA MINING ALGoRITHM BASED oN DECISION TREE ABSTRACT The decision tree learning algorithm is very useful in data mining technique．The ID3 algorithm is studied in this thesis，which is the key algorithm of decision tree 1eanling． The improved algorithm of ID3 is proposed by introducing user-interest，which resolves the problem of“the big data covers up the fraction”in the decision support process in certain degree． Firstly,based on the traditional ID3，the rnethod of improving ID3 is put forward by introducing the concept of user-interest， which adds user-interest to infonnation entropy in the ID3 algorithm．Therefore it makes the algorithm depend not only on train sets but also on field knowledge of studied attribute．In this way the improved algorithm increases the classification precision．And an example is trained by ID3，which proves that improved algorithm is efficient． SecondlN the thesis puts forward that conditional probability of attribute to positive example can be used to compare the 1nformation which attribute provides SO as to n 太原理工大学硕士研究生毕业论文construct 太原理工大学硕士研究生毕业论文 construct decision tree and to get classify rules．And a demonstration shows that the algorithm simplifies the decision tree’S building process e箭ciently． To evaluate the algorithm，a data-mining trial system is designed which uses different algorithms to extract the decision rules in Northwind database．By this trial system p