Discovery of maximum length frequent itemsets

Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu

Research output: Contribution to journalArticlepeer-review

65 Scopus citations


The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often sufficient to mine a small representative subset of frequent itemsets with low computational cost. To that end, in this paper, we define a new problem of finding the frequent itemsets with a maximum length and present a novel algorithm to solve this problem. Indeed, maximum length frequent itemsets can be efficiently identified in very large data sets and are useful in many application domains. Our algorithm generates the maximum length frequent itemsets by adapting a pattern fragment growth methodology based on the FP-tree structure. Also, a number of optimization techniques have been exploited to prune the search space. Finally, extensive experiments on real-world data sets validate the proposed algorithm.

Original languageEnglish (US)
Pages (from-to)69-87
Number of pages19
JournalInformation Sciences
Issue number1
StatePublished - Jan 2 2008

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems and Management
  • Artificial Intelligence
  • Theoretical Computer Science
  • Control and Systems Engineering
  • Computer Science Applications


  • Association analysis
  • Data mining
  • FP-tree
  • Frequent itemsets
  • Maximum length frequent itemsets


Dive into the research topics of 'Discovery of maximum length frequent itemsets'. Together they form a unique fingerprint.

Cite this