Algorithm Based on Bit Objects for Mining Maximal Frequent Patterns

BAYARDOR.Efficiently mining long patterns from databases[C]ffProc,of 1998 ACM-SIGMOD Int.Conf.on Management of Data.New York:ACM Press,1998:85-93.[2] AGARWAL R,AGGARWAL C,PRASAD V.Depth first generation of long patterns[C]//P roc.of 6th ACM-SIGKDD Int.Conf.on Knowledge Discovery and Data Mining.Boston:ACM Press,2000:108-118.[3] 宋余庆,朱玉全,孙志辉,等.基于FP-Tree的最大频繁项集挖掘及其更新算法[J].软件学报,2003,14(9):1586-1592.SONG Yuqing,ZHU Yuquon,SUN Zhihui,et al.An algorithm and its updating algorithm based on FP-Tree for mining maximum frequent itemscts[J].Journal of Software,2003,14(19):1 586-I 592.[4] BURDICK D,CALIMLIM M,GEHRKE J.Mafia:a maximal frequent itemset algorithm for transactional databases[C]// Proc.of the 17th Int.Conf.on Data Engineering.Heidelberg:IEEE Press,2001:443-452.[5] 颜跃进,李舟军,陈火旺.一种挖掘最大频繁项集的深度优先算法[J].计算机研究与发展,2005,42(3):462-467.YAN Yuejin,LI Zhoujun,CHEN Huowang.A depth-first search algorithm for mining maximal frequent itemaets[J].Journal of Computer Research and Devdopment,2005,42(3):462-467.[6] 陈鹏,吕卫锋.一种基于有效修剪的最大频繁项集挖掘算法[J].北京航空航天大学学报,2006,32(2):218-223.CHEN Peng,LU Weffeng.Maximal frequent item sets mining algorithm based on effective pruning mechanisms[J].Journal of Beijing University of Aeronautics and Astronautic,2006,32(2):218-223.[7] HAN J,PEI J,YIN Y.Mining frequent patterns without candidate generation[C]//Proc.of 2000 ACM-SIGMOD Int.Conf.on Management of Data.Dallas:ACM Press,2000:1-12.[8] RYMON R.Search through systematic set enumeration,MS-CIS-92-66[R].Philadelphia:University of Pennsylvania Department of Computer and Information Science,1992.