LI QingFen1,2, WANG Li1, ZHOU WeiLin1,2, CHEN HuoWang2
1.Department of Computer and Electronic Engineering, Hunan Business College, Changsha 410205 2.School of Computer Science, National University of Defense Technology, Changsha 410073
Abstract Mining complete set of frequent patterns remains a key problem to the application of association rules. Up to date, the most commonly used methods are Apriori algorithm and FPTREE algorithm.In this paper, a high efficient algorithm, minimal support minimal combination algorithm (MSMCA), is proposed. It is completely different from the two existing methods. The candidate set of frequent itemsets are not produced by using MSMCA, thus the cost of computer reduces largely. In addition, a subproject, minimal support minimal combination in repeat array, is proposed in the course of studying MSMCA.
[1] Agrawal R,Imielinski T,Swami A. Mining Association Rules between Sets of Items in Large Databases // Proc of the ACM SIGMOD International Conference on Management of Data. Washington, USA, 1993: 207-216 [2] Lu Songfeng, Lu Zhengding. Fast Mining Maximum Frequent Itemsets. Journal of Software, 2001, 12(2): 293-297 (in Chinese) (路松峰,卢正鼎.快速开采最大频繁项目集.软件学报, 2001, 12(2): 293-297) [3] Song Yuqin, Zhu Yuquan, Sun Zhihui, et al. An Algorithm and Its Updating Algorithm Based on FPTree for Mining Maximum Frequent Itemsets. Journal of Software, 2003, 14(9): 1586-1592 (in Chinese) (宋余庆,朱玉全,孙志挥,等.基于FPTree的最大频繁项目集挖掘及更新算法.软件学报, 2003, 14(9): 1586-1592) [4] Han Jiawei, Kamber M. Data Mining:Concepts and Techniques. Orlando, USA: Morgan Kaufmann, 2001 [5] Han Jiawei, Jian Pei, Yin Yiwen. Mining Frequent Patterns without Candidate Generation // Proc of the ACM SIGMOD International Conference on Management of Data. Dallas, USA, 2000: 1-12 [6] Jr Bayardo R J. Efficiently Mining Long Patterns from Databases //Proc of the ACM SIGMOD International Conference on Management of Data. Seattle, USA, 1998: 85-93 [7] Yang Ming, Sun Zhihui, Ji Genlin. Fast Mining of Global Frequent Itemsets. Journal of Computer Research and Development, 2003, 40(4): 620-626 (in Chinese) (杨 明,孙志挥,吉根林.快速挖掘全局频繁项目集.计算机研究与发展, 2003, 40(4): 620-626) [8] Zhu Yuquan, Sun Zhihui, Zhao Chuanshen. Fast Updating Frequent Itemsets. Journal of Computer Research and Development, 2003, 40(1): 94-99 (in Chinese) (朱玉全,孙志挥,赵传申.快速更换频繁项集.计算机研究与发展, 2003, 40(1): 94-99) [9] Yang Ming, Sun Zhihui, Song Yuqing. Fast Updating of Globally Frequent Itemsets. Journal of Software, 2004, 15(8): 1993-1998 (in Chinese) (杨 明,孙志恽,宋余庆.快速更新全局频繁项目集.软件学报, 2004, 15(8): 1993-1998) [10] Liu Junqiang, Sun Xiaoying, Wang Xun, et al. The New Method in Mining Maximum Frequent Itemsets. Chinese Journal of Computers, 2004, 27(10): 1327-1334 (in Chinese) (刘君强,孙晓莹,王 勋,等.挖掘最大频繁模式的新方法.计算机学报, 2004, 27(10): 1327-1334) [11] Ji Genlin, Yang Ming, Song Yuqing, et al. The Fast Updating Maximum Frequent Itemsets. Chinese Journal of Computers, 2005, 28(1): 128-135 (in Chinese) (吉根林,杨 明,宋余庆,等.最大频繁项目集的快速更新.计算机学报, 2005, 28(1): 128-135) [12] Lu Jieping, Yang Ming, Sun Zhihui, et al. Fast Mining of Global Maximum Frequent Itemsets. Journal of Software, 2005, 16(4): 553-560 (in Chinese) (陆介平,杨 明,孙志恽,等.快速挖掘全局最大频繁项目集.软件学报, 2005, 16(4): 553-560)
2007, Vol. 20 
