关联规则中最大频繁项目集的研究

Study for Mining Maximally Frequent Item Sets in Association Rule

研究了大型事务数据库中关联规则的频繁集问题;提出一种高效挖掘最大频繁集的新算法MMFI。该算法采用按事务数的层次和候选频繁集的维数处理的策略,经数学证明和实验分析,能大大减少判断运算量。

Study the frequent item sets problem for association rule in large business database;propose an efficient new algorithm MMFI in mining maximum frequent item sets.The idea of MMFI is to divide database by level and divide candidate frequent item sets by number.This algorithm is proved that it is efficient to reduce time in compute by mathematics and expri-ments.