【摘要】 为了快速求得数据库中的所有频繁项集,提出一种全新的商品主键算法GMK.该算法基于商品作为主键的数据库,采用一个ID数组记录购买某个项集的ID,然后计算与其连接的项集中具有相同ID的元素个数,从而得到连接项集的支持度.用GMK算法只需要扫描一次数据库,并且可以快速减小计算量,实现简单.实验证明了GMK算法的有效性.更多还原

【Abstract】 To find all the frequent itemsets in a database rapidly, a new algorithm GMK is brought forward based on the database whose major key is goods. It records the ID that buys the itemset through an ID-array, then counts the number of elements that has the same ID in the itemset that is jointed to. Accordingly, the degree of support of the joint-item is obtained. GMK only scans the database once, thus it can reduce the quantity of calculation rapidly and can be realized easily. The validity of GMK is proved through tests.更多还原