Mining frequent closed itemsets with the frequent pattern list
Resource
Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on
Journal
Data Mining, 2001. ICDM 2001
Pages
-
Date Issued
2001-12
Date
2001-12
Author(s)
Tseng, Fan-Chen
Hsu, Ching-Chi
Chen, Henry
DOI
N/A
Abstract
The mining of a complete set of frequent itemsets will lead to a huge number of itemsets. Fortunately, this problem can be reduced to the mining of frequent closed itemsets (FCIs), which results in a much smaller number of itemsets. The approaches to mining frequent closed itemsets can be categorized into two groups: those with candidate generation and those without. In this paper, we propose an approach to mining frequent closed itemsets without candidate generation with a data structure called the frequent pattern list (FPL). We designed the algorithm FPLCI-mining to mine the FCIs. Experimental results show that our method is faster than previous ones.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00989595.pdf
Size
276.49 KB
Format
Adobe PDF
Checksum
(MD5):d561cc97fb851122f3a88898011cdde2