Mining Frequent Closed Itemsets with the Frequent Pattern List

  • Authors:
  • Fan-Chen Tseng;Ching-Chi Hsu;Henry Chen

  • Affiliations:
  • -;-;-

  • Venue:
  • ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The mining of the complete set of frequent itemsets willlead to a huge number of itemsets. Fortunately, thisproblem can be reduced to the mining of frequent closeditemsets (FCIs), which results in a much smaller number ofitemsets. The approaches to mining frequent closeditemsets can be categorized into two groups: those withcandidate generation and those without. In this paper, wepropose an approach to mining frequent closed itemsetswithout candidate generation: with a data structure calledthe Frequent Pattern List (FPL). We designed thealgorithm FPLC -Mining to mine the frequent closeditemsets (FCIs). Experimental result shows that our methodis faster than the previously existing ones.