基于关联规则的数据挖掘算法研究-控制理论与控制工程专业论文.docxVIP

摘要数据挖掘是当今人工智能和数据库研究方面最富活力的领域。数据挖掘是 摘要 数据挖掘是当今人工智能和数据库研究方面最富活力的领域。数据挖掘是 指从大量的数据中发现潜在的、有用的知识的过程。关联规则数据挖掘则是数 据挖掘的一个主要研究内容，而如何提高挖掘算法的效率是关联规则数据挖掘 的核心问题。 本文充分论述了典型的关联规则挖掘算法Apriori算法，该算法在挖掘频繁 模式时需要产生大量的候选项集，多次扫描数据库，时空复杂度过高。针对该 算法的局限性，本文从两方面考虑对算法效率进行提高：(1)降低候选项目集Ck 中候选项的数量；(2)减少扫描数据库D的次数。首先提出一种利用Lk-l产生 Ck之前先对L¨进行一次裁剪达到减少候选项数目集的改进算法，其次又提出 了一种通过对项编码来减少扫描数据库次数并通过删除项来减少候选集的数量， 从而提高算法的效率。相同条件下的实验结果表明，优化后的算法能有效地提高 关联规则挖掘的效率。 关键字：数据挖掘关联规则Apriori算法频繁项集候选项集 AbstractData Abstract Data Milli】ng is onc ofthe most active research fields，especially in the fields of artificial intelligence and database．Data Mining is a kind of process that reveals potential useful knowledge from massive data．The association rule mining is a main research aspect of data mining．And the discovery of the frequent item sets is a key problem ofthe association rule mining． The most typical association rules mining algorithm is Apriori，which has been described in details in the thesis．In the process of mining fTequent patterns，Apriori algorithm generates a huge number of candidate itemsets as well as needs multiple scans over database．So the time and space complexity is too high．According to the existing flaws of Apriori algorithm，We want to improve the mining efficiency from two aspects．One is to reduce the candidate itemsets and the other to decrease the scanning times over database．Firstly,an advanced algorithm is proposed to reduce the candidate itemsets depending on the natu托of frequent itemsets．Then the paper propose an improved algorithm by means of coding for every iterm Coding can reduce the scans OVer database and meanwhile deicing items can reduce the number of candidate items．As a result,the efficiency of this algorithm has been improved． Experiment done under the same conditions show that the two advanced algorithms Can effectively improve the efficiency ofassueiation rules mining． Keywords：data mining，association rules，Apriori algorithm,frequent items, candidate items Ⅱ 学位论文独创性声明： 学位论文独创性声明： 本人所呈交的