Updating algorithm based on matrix for mining frequent item sets
一种基于矩阵的频繁项集更新算法*

Aiming at updating problems of frequent item sets, this paper proposed an updating algorithm based on matrix(UABM) for mining frequent item sets.Divided the updated database into original database and new one based on time. Converted these databases into matrixes.Got the new frequent sets by matrix cropping and the bit operation, and updated the gotten frequent item sets on gotten ones.The experiments show the algorithm is not only feasible and efficient but also fit to update freguent item sets for a large-scale and dense data base.