一种基于分治策略与位运算的频繁项集挖掘算法  

A Frequent Itemsets Mining Based on Divide-conquer and Bittable

作　　者：易宗剑 彭月英[1] 覃晓[1] 唐涛[1] 

机构地区：[1]广西师范学院计算机与信息工程学院,广西南宁530023

出　　处：《广西师范学院学报（自然科学版）》2015年第1期50-56,共7页Journal of Guangxi Teachers Education University(Natural Science Edition)

基　　金：国家自然科学基金(61363037)

摘　　要：为提高挖掘频繁项集的效率,在垂直数据格式下,结合分治思想提出一种基于分治策略与位运算频繁项集挖掘算法DC-FIMBII。利用分治将数据库中的事务划分为多个非重叠部分,对每一部分采用位运算求交计算支持度,从而减少操作时项集的规模和项集的比较次数。在mushroom、pumsb_star和T40I10D100K等数据集上,对DC-FIMBII、Apriori、Eclat、DF-FIMBII等算法进行比较。实验表明,DC-FIMBII具有更高的效率。For the purpose of efficiency improvement ,a partition principle frequent itemset mining based on bittable and inverted index (PP‐FIMBII) is proposed in this paper I.t divides database transac‐tions into multiple nonoverlapping sections , and calculates the support counts of each two items through the bit operations .Thus both of the Tidset's quantity and the comparing times can be reduced when operating intersects .We compared the execution time of Apriori ,Eclat in three datasets such as mushroom ,pumsb_star and T40I10D100K .The experiment results show that PP‐FIMBII has a more efficiency .

关 键 词：垂直数据表示 频繁项集 DCGFIMBII算法 分治策略 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]