Abstract
In this paper we investigate the relationship between closed itemset mining, the complete pruning technique and item ordering in the Apriori algorithm. We claim, that when proper item order is used, complete pruning does not necessarily speed up Apriori, and in databases with certain characteristics, pruning increases run time significantly. We also show that if complete pruning is applied, then an intersection-based technique not only results in a faster algorithm, but we get free closed-itemset selection concerning both memory consumption and run-time.
Chapter PDF
Similar content being viewed by others
References
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Pruning closed itemset lattices for association rules. In: Proceedings of the 14th BDA French Conference on Advanced Databases, Hammamet, Tunisie, pp. 177–196 (1998)
Goethals, B., Zaki, M.J.: Advances in frequent itemset mining implementations: Introduction to fimi03. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI 2003), CEUR Workshop Proceedings, Melbourne, Florida, USA., vol. 90 (2003)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), Chile, pp. 487–499. Morgan Kaufmann, San Francisco (1994)
Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: Heckerman, D., Mannila, H., Pregibon, D., Uthurusamy, R., Park, M. (eds.) Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining, California, USA, pp. 283–296. AAAI Press, Menlo Park (1997)
Schmidt-Thieme, L.: Algorithmic features of eclat. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI 2004), CEUR Workshop Proceedings, Brighton, UK., vol. 126 (2004)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD international conference on Management of data, Dallas, Texas, United States, pp. 1–12. ACM Press, New York (2000)
Borgelt, C.: Efficient implementations of apriori and eclat. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI 2003), CEUR Workshop Proceedings, Melbourne, Florida, USA., vol. 90 (2003)
Bodon, F.: Surprising results of trie-based fim algorithms. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI 2004), CEUR Workshop Proceedings, Brighton, UK., vol. 126 (2004)
de la Briandais, R.: File searching using variable-length keys. In: Proceedings of the Western Joint Computer Conference, pp. 295–298 (1959)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodon, F., Schmidt-Thieme, L. (2005). The Relation of Closed Itemset Mining, Complete Pruning Strategies and Item Ordering in Apriori-Based FIM Algorithms. In: Jorge, A.M., Torgo, L., Brazdil, P., Camacho, R., Gama, J. (eds) Knowledge Discovery in Databases: PKDD 2005. PKDD 2005. Lecture Notes in Computer Science(), vol 3721. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564126_43
Download citation
DOI: https://doi.org/10.1007/11564126_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29244-9
Online ISBN: 978-3-540-31665-7
eBook Packages: Computer ScienceComputer Science (R0)