The Community for Technology Leaders
2013 IEEE 13th International Conference on Data Mining (2006)
Hong Kong
Dec. 18, 2006 to Dec. 22, 2006
ISSN: 1550-4786
ISBN: 0-7695-2701-9
pp: 139-148
Yiping Ke , The Hong Kong University of Science and Technology, Hong Kong
James Cheng , The Hong Kong University of Science and Technology, Hong Kong
Wilfred Ng , The Hong Kong University of Science and Technology, Hong Kong
ABSTRACT
In this paper, we study an inherent problem of mining Frequent Itemsets (FIs): the number of FIs mined is often too large. The large number of FIs not only affects the mining performance, but also severely thwarts the application of FI mining. In the literature, Closed FIs (CFIs) and Maximal FIs (MFIs) are proposed as concise representations of FIs. However, the number of CFIs is still too large in many cases, while MFIs lose information about the frequency of the FIs. To address this problem, we relax the restrictive definition of CFIs and propose the \delta-Tolerance CFIs (\delta- TCFIs). Mining \delta-TCFIs recursively removes all subsets of a \delta-TCFI that fall within a frequency distance bounded by \delta. We propose two algorithms, CFI2TCFI and MineTCFI, to mine \delta-TCFIs. CFI2TCFI achieves very high accuracy on the estimated frequency of the recovered FIs but is less efficient when the number of CFIs is large, since it is based on CFI mining. MineTCFI is significantly faster and consumes less memory than the algorithms of the state-of-the-art concise representations of FIs, while the accuracy of MineTCFI is only slightly lower than that of CFI2TCFI.
INDEX TERMS
null
CITATION
Yiping Ke, James Cheng, Wilfred Ng, "Tolerance Closed Frequent Itemsets", 2013 IEEE 13th International Conference on Data Mining, vol. 00, no. , pp. 139-148, 2006, doi:10.1109/ICDM.2006.1
100 ms
(Ver )