基于粗糙集理论的网络评教研究本科毕业设计.docVIP

摘 要 数据的约简包括属性约简和属性值约简[1]，现在数据约简的方法很多，粗糙集理论是数据约简和数据挖掘的重要工具，数据约简和数据挖掘相互联系，它们没有必然的划分界限，通过粗糙集工具和决策树工具以及用粗糙集理论建立决策树的理论可以将数据约简的理论方法加以开发推广，本文通过对数据约简理论的发散研究，结合现在比较前沿的观点和实例阐明数学工具和方法理论之间的联系。首先介绍数据约简工具Rough Sets理论应用范围和前景，粗糙集理论历史，特点以及与粗糙集理论相关的基本概念和基本的约简算法（包括A.Skowron提出的分辨矩阵约简算法和基于可辨识矩阵的启发式约简算法），粗糙集在数据挖掘中的应用，包括数据挖掘的基本概念，数据挖掘的基本任务（重点介绍了现在流行的基于决策树的数据分类算法），并且给出了粗糙集在数据挖掘中的应用举例。用粗糙集理论可以建立决策树，包括决策树的核心技术，粗糙集理论构造决策树的方法和决策树的应用介绍，现又新提出的双论域下粗糙集数据约简方法。然后分析国内外网络的教学评估系统的研究成果，并且结合课堂教学质量评价表，将数据约简理论成功运用于网络评教中。 关键字：数据约简，Rough Sets理论，数据挖掘，网络的教学评价，离算化。 Abstract Reduction of data, including attribute reduction and attribute value reduction [1], data reduction is now a lot of methods, rough set theory is the data reduction and an important tool for data mining, data reduction and data mining interrelated, they are not the delineation of boundaries is bound through the rough set tools and decision tree tools, as well as the establishment of rough set theory with the theory of decision tree could be the theory of data reduction methods to promote the development of this paper the data reduction of the divergence theory, in combination with cutting-edge Now views and examples of mathematical tools and methods to clarify the link between theory. First data reduction tool introduced Rough Sets Theory and prospects of applications, rough set theory of history, characteristics of the rough set theory and basic concepts and basic reduction algorithm (including A. Skowron proposed reduction algorithm to distinguish Matrices and Heuristic attribute reduction based on discernibulity matrix and its application), rough Set in the application of data mining, including the basic concepts of data mining, data mining of the basic tasks (focusing on the now popular data-based decision tree classification algorithm), and rough sets are given in the application of data mining, for example. Rough set theory with the theory of decision tree, including the core technology decision tree, decision tree stru