Fast and memory efficient mining of frequent closed itemsets

@article{Lucchese2006FastAM,
  title={Fast and memory efficient mining of frequent closed itemsets},
  author={Claudio Lucchese and Salvatore Orlando and Raffaele Perego},
  journal={IEEE Transactions on Knowledge and Data Engineering},
  year={2006},
  volume={18},
  pages={21-36}
}
This paper presents a new scalable algorithm for discovering closed frequent itemsets, a lossless and condensed representation of all the frequent itemsets that can be mined from a transactional database. Our algorithm exploits a divide-and-conquer approach and a bitwise vertical representation of the database and adopts a particular visit and partitioning strategy of the search space based on an original theoretical framework, which formalizes the problem of closed itemsets mining in detail… CONTINUE READING
Highly Influential
This paper has highly influenced 25 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 234 citations. REVIEW CITATIONS

Citations

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

235 Citations

0102030'07'10'13'16
Citations per Year
Semantic Scholar estimates that this publication has 235 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Zaki . Advances in Frequent Itemset Mining Implementations : Report on FIMI ’ 03

  • Bart Goethals, J. Mohammed
  • SIGKDD Explor . Newsl .
  • 2004

Efficiently using prefix-trees in mining frequent itemsets

  • Gosta Grahne, Jianfei Zhu
  • In Proceedings of the IEEE ICDM Workshop on…
  • 2003
2 Excerpts

Similar Papers

Loading similar papers…