摘要
提出一种最大频繁模式挖掘的改进算法(FP-Imax),该算法引入一种与FP-tree类似的结构MFI-tree来存储所有的最大频繁项目集,并采用有效的子集检查方法进行优化,降低了算法的时空开销,提高了挖掘效率。实验表明,与FP-Max相比该算法的挖掘速度快两2—3倍。
In this paper,an improved algorithm(FP-Imax) for mining maximal frequent patterns is proposed,a novel data structure,MFI-tree,which is similar to FP-tree,is introduced to store all maximal frequent item sets and some subset-checking approaches are adopted to do improve it.Therefore the proposed algorithm greatly cuts down the cost of space and memory and improves the mining efficiency.Experiments show that FP-Imax is faster than FP-Max.
出处
《长春工程学院学报（自然科学版）》
2007年第1期59-62,共4页
Journal of Changchun Institute of Technology：Natural Sciences Edition
基金
吉林省科技发展计划项目(20040539)
