Research on Methods of Concise Representation for Frequent Itemsets
频繁项集的简洁表示方法研究

In this paper, a new method for constructing concise representation of frequent itemsets based on deduction rule is proposed. Lower and upper bounds on the frequency of a candidate are calculated with deduction rules, based on the frequencies of all its subsets, the rules derive best possible bounds on the frequency of an itemset. In this way, the number of candidate itemsets to count can be avoided with these bounds. Therefore, it is possible to generate a summary of the frequent itemsets that only contains the non-derivable sets, then the collection of none-derivable sets forms a concise representation of the frequent itemset. The experimental results show the effectiveness and efficiency of this method on a real-life dataset.