基于粗糙集理论的约简方法研究-计算机应用技术专业论文.docxVIP

The The Research on Reduction Based on Rough Sets A．bstract Rough Set theory,which was proposed by Polish mathematician PawlakZ in 1982，is a mathematical tool to analyze uncertain and vague data and has been one of the challenging fields of computer science and technology．The Rough Set approach which applied to knowledge discovery,data reduction，decision support， classification and other fields has been proved very effective．The theory has been found in many interesting real—life applications． Data reduction is the key part of the Rough Set theory．Reduction of knowledge consists in removing superfluous attributes(values)in the knowledge base，in such a way that the elementary knowledge is preserved，so it call increase the knowledge quality and help people make decision．This dissertation focuses on the research of attribute reductions and value reductions，the contributions are as follows： (1)An introduction to Rough Set theory has been given．Existing algorithms of attribute(value)reduction have been described and analyzed． (2)A new attribute reduction algorithm ARIMC for both consistent and inconsistent decision tables is presented．This method also shows its advantages over the classical algorithm in less time consumption by using IDM and core properties as the optimization conditions． (3)An improved attribute value reduction algorithm AVRIMC for decision tables is presented．It utilizes the value core and absorptivity to optimize the matrix construction．Compared with other algorithms，this method shows its better performance by experiment． Key words：KDD Rough Set Decision table Attribute reduction Value reduction II 插图清单图2．1粗糙集合示意图 插图清单 图2．1粗糙集合示意图 ．10 图3．1与经典算法比较随记录数增加时间变化情况 ．29 图4。1与文献[35]算法比较随记录数增加时间变化情况 43 表格清单表2．1信息表例子 表格清单 表2．1信息表例子 ．．12 表2．2决策表例子 ． ．13 表3．1决策表例子 ．．27 表3．2根据经典算法[3]构造的分辨矩阵 ．28 表3．3分辨矩阵IDW 28 表3．4与经典算法的时间性能比较 29 表4．1一决策表