基于极团模式的关联规则挖掘算法的研究-计算机应用技术专业论文.docxVIP

II II 分布的数据集难设置合适的支持度阈值的问题，并避免多次扫描数据库和 频繁生成模式树，减少项集支持度的计算量。最后通过实验验证所提出的 算法 MCWCAR 比传统算法在挖掘关联规则的时间性能和准确性具有更高的效 率。 2．针对目前数据挖掘中存在对长模式挖掘效率低和挖掘方式不完整等 问题，提出基于动态图的 Top-N 极团模式挖掘算法 CSDGMPA（Clique Search With Dynamic Update Of Graph Based Maximum Pattern Mining Algorithm）。 算法在提出 2 个剪枝规则的基础上，通过剪枝无效团和扩展团两个阶段精 确地识别 Top??N 极大团，最后采用深度优先分支定界的算法寻找长度为 Top ??N 的极大模式。所提出的算法能在基于 K -项模式图构建的图中发现以 团的形式出现的目标模式。随着图表动态地稀疏化，使得寻找团的过程更 加高效，优化了搜索过程，提高剪枝准确性。最后，通过仿真实验，将 CSDGMPA 算法和传统算法 MAXIA 和 LCM 进行对比，验证了 CSDGMPA 算法在时间花销 等方面的优越性。 关键字：加权可信关联规则；极大团 ；模式图；Top ??N 极大模式 III III STUDY ON ASSOCIATION RULE MINING ALGORITHM BASED ON THE PATTERN OF POLAR CLIQUE ABSTRACT Association rule mining is one of the important research contents in the field of data mining, through the adoption of support degree and confidence to remove the infrequent items and obtain the object association rule. In term of the dataset mining distributed with severe inclination, the traditional frequent item set mining algorithm can not get the efficient application on some important tasks, and the threshold value of support degree is hard to be determined. If it is too large, the rule of high confidence coefficient would be omitted，and if it is too low, plenty of redundant rules would be of low confidence coefficient. How to improve the efficiency of mining and obtain more accurate association rules is an important study project in the field of data mining. Maximum clique is the maximum fully connected component of undirected clique G, which aims at generating maximum clique with item clique of strong relevancy and may generate maximum frequent items and then solve the maximum frequent item clique of each maximum clique. And quickly generate all reliable association rules, promote the time efficiency. This paper study deeply on the operating principle, mechanism, maximal clique arithmetic and other theories of classic arithmetic such as APriori and FP-growth arithmetic, and concludes their advantages and disadvantages. Aimed at existi