基于粗集约简构造概念格的关联规则挖掘-计算机应用技术专业论文.docxVIP

II II 联规则。主要思想是，在数据挖掘数据预处理阶段完成后，使用改进的基于知识 划分粒度的属性约简算法对数据预处理好的数据进行属性约简，删除冗余属性， 降低属性的维数，来减少数据挖掘规模和大量候选项集的产生。然后通过构造概 念格算法对约简结果集构造概念格，通过 Hasse 图形式表现决策表信息。利用 Hasse 图可视化的优点，方便计算支持度和置信度，以及快速地找出感兴趣的或 有意义的关联规则，使用户能更好分析挖掘结果，得到较好或感兴趣的关联规则。 通过全球变暖的实例进行了实验分析和验证，表明将粗集约简和构造概念格关联 规则提取这两种方法综合，是有效的，并能得到较好关联规则。 3） 在上述研究基础上，设计基于粗集约简构造概念格的关联规则挖掘原型 系统。该系统具有普遍适用性，主要优点在于，减少了候选项集、数据挖掘规模 和扫描数据库以及大量冗余的规则的产生，提高了挖掘的效率和准确性。 关键词 关联规则，粗糙集，属性约简，概念格 III III Association Rules Mining in Concept Lattice Constructed Bases on Rough Set Attribute Reduction ABSTRACT In recent years, as database management systems are widely used, and the development of computers and networks, which results in a large amount variety of data. Data Mining emerge as the times require, which causes a widespread concern of information industry and the society, and becomes one of hot topics ,in the pressing needs of how to extract valuable knowledge and information from the mass data, so as to better use of these data to predict future trends. Association rule mining is one of important research contents and hot topics. Rough set and Concept lattice are powerful tools for data analysis and knowledge processing. Rough set theory is a new mathematical tool, which mainly deals with incomplete and uncertain knowledge, and has been widely used in data mining and other fields. Based on attribute reduction in rough set is one of important research contents in the field of data mining, which can remove the redundant attributes, reduce the dimensions of the attributes, reduce the size of data mining, and the generation of a large number of candidate itemsets. While concept lattice was generated formal concept analysis，each node of which is essentially a largest itemset. Calculate easily the support and confidence, and quickly find the interesting or meaningful association rules by concept lattice constructed and the advantages of Hasse map visualization, so as to analysis the results of mining better, and obtain association ru