Discovery of maximum length frequent itemsets

  title={Discovery of maximum length frequent itemsets},
  author={Tianming Hu and Sam Yuan Sung and Hui Xiong and Qian Fu},
  journal={Inf. Sci.},
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… CONTINUE READING
Highly Cited
This paper has 107 citations. REVIEW CITATIONS
57 Citations
24 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 57 extracted citations

108 Citations

Citations per Year
Semantic Scholar estimates that this publication has 108 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.

Similar Papers

Loading similar papers…