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

基于粗集的数据挖掘算法研究及应用摘 基于粗集的数据挖掘算法研究及应用 摘 要 随着数据量的飞速增长，数据挖掘成为从大量数掘中发现知识的重要手段。 粗集是一种处理模糊和不确定性数掘的工具，因而成为数据挖掘中的重要框架。 约简和核是粗集理论的核心内容，数据经过约简后更有价值，更能准确的获取 知识。本文针对粗集展开如下工作： 首先，本文在国内外有关数据挖掘(DM)与知识发现(KDD)方面的学术研究 成果的基础上，研究了数据离散化处理和数据泛化的方法：讨论了属性约简的 基本算法；研究了属性约简的典型算法，包括基于逻辑运算的属性约简算法、 基于频度的属性约简算法、基于属性依赖度的属性约简算法、基于信息熵的属 性约简算法，并分析了各约简算法的时间复杂度：提出了后删除属性的约简算 法，该算法无需求核运算，节省了时间和空间，简化了求解过程。 其次，本文在约简的基础上研究了最简规则提取算法、典型规则提取算法； 研究了决策树建立的算法，在讨论了ID3算法的基础上提出了基于粗集的决策 树建立，并以实例验证其正确性。 最后，本文在上述理论方法研究的基础上，设计了基于Rough Set的知识 发现工具。 关键词：粗集数据挖掘约简 The The Research and Application of DM Algorithm on the basis of Rough Set ABSTRACT With the rapid increase of the data quantity，data mining has become an important means to discoVer knowledge from a large number of data．Rough Set is a tool to deal with vague and uncertain data，therefore it becomes an impOrtant frame in DM．Reduction and core are the key contcm of Rough Set theory．Data af琵f∞dwtion is mo心％iuabic aⅡd can 06缸in莨nowied簪more accu【atc坼 First of all_on basis of the results of the academic research on both domestic and international relevant DM and KDD．the methods of data discretization and data generalization，the basic algorithm of attribute reduction，and the typical algorithm of attribute reduction are discussed in this thesis，which includes the algorithm based on logic operation，f}equency，attribute dependence and entropy． The time complexity of each reduction algorithm is analyzed．1n addition，the reduction a】gorithm of de】eting the rear att“bute is proposed which does not need core calculating and can saVe time and space and simplify the solving process as well． SecondIy，based on attribute reduction，the algorithm of drawing the sinlplest and typical rules and building decision tree are studied in this thesis．Also the algorithm of how to build decision tree based on Rough Set is proposed and its cOrrectness with examples based on the discussion of ID3 algorithm is verified． Finally，on the basis of the theory methods research mentioned above，the tool of KD