Mining Noise-Tolerant Frequent Closed Itemsets in Very Large Database

作者：Chen Junbo^*; Zhou Bo; Wang Xinyu; Ding Yiqun; Chen Lu

来源：IEICE Transactions on Information and Systems, 2009, E92D(8): 1523-1533.

DOI：10.1587/transinf.E92.D.1523

• noise-tolerant frequent closed itemsets
• closed itemsets
• approximate frequent itemsets
• association rules

Frequent Itemsets(FI) mining is a popular and important first step in analyzing datasets across a broad range of applications. There are two main problems with the traditional approach for finding frequent itemsets. Firstly, it may often derive an undesirably huge set of frequent itemsets and association rules. Secondly, it is vulnerable to noise. There are two approaches which have been proposed to address these problems individually. The first problem is addressed by the approach Frequent Closed Itemsets(FCI), FCI removes all the redundant information from the result and makes sure there is no information loss. The second problem is addressed by the approach Approximate Frequent Itemsets(AFI), AFI could identify and fix the noises in the datasets. Each of these two concepts has its own limitations, however, the authors find that if FCI and AFI are put together, they could help each other to overcome the limitations and amplify the advantages. The new integrated approach is termed Noise-tolerant Frequent Closed Itemset(NFCI). The results of the experiments demonstrate the advantages of the new approach: (1) It is noise tolerant. (2) The number of itemsets generated would be dramatically reduced with almost no information loss except for the noise and the infrequent patterns. (3) Hence, it is both time and space efficient. (4) No redundant information is in the result.

• 出版日期2009-8
• 单位浙江大学