基于项集分解的快速挖掘最大频繁项集算法

Fast Mining of Maximum Frequent Item-set Based on Item-set Dismantling

对Apriori算法的分析,提出采用分解事务数据库中最长的项集,使用前缀划分的表示方法,从而快速地归纳出事务数据库中的最大频繁项集.

In this paper, by analyzing Apriori algorithm, the longest item - set was dismantled using a method of a prefix partition, so the max frequent item - set of traction database can be inducted quickly.