高效的关联规则挖掘算法研究

Research on high efficient algorithm for mining association rules

目前已经提出了许多用于高效地发现大规模数据库中的关联规则的算法,但都是对关联规则中满足最小支持度的频繁项集的研究,没有对频繁项集中如何高效地计算得到满足最小置信度的关联规则进行研究。针对这种情况,提出了一种高效关联规则的挖掘算法EA,解决了在挖掘关联规则过程中如何高效挖掘满足最小置信度的关联规则问题。

Currently, lots of algorithms for efficiently mining association rules in large database are proposed. However, all of them research into frequent itemset which satisfy the minimum support for mining association rules, no one researches into association rules how to effectively calculate to satisfy the minimum confidence. Under this kind of situation, a data mining algorithm EA （efficient algorithm） is proposed, which can fast calculate the confidence in association rules, it soluted the question how to efficient mine association rules which are satisfied with min_conf during minging association rules.