Abstract
The extraction of frequent patterns often yields extremely voluminous results which are difficult to handle. Computing a concise representation or cover of the frequent pattern set is thus an interesting alternative investigated by various approaches. The work presented in this article fits in such a trend. We introduce the concept of essential pattern and propose a new cover based on this concept. Such a cover makes it possible to decide whether a pattern is frequent or not, to compute its frequency and, in contrast with related work, to infer its disjunction and negation frequencies. A levelwise algorithm with a pruning step which uses the maximal frequent patterns for computing the essential patterns is proposed. Experiments show that when the number of frequent patterns is very high (strongly correlated data), the defined cover is significantly more reduced than the cover considered until now as minimal: the frequent closed patterns.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bayardo, R.: Efficiently mining long patterns from databases. In: Proceedings of the International Conference on Management of Data, SIGMOD, pp. 85–93 (1998)
Bykowski, A., Rigotti, C.: A condensed representation to find frequent patterns. In: Proceedings of the 20th Symposium on Principles of Database Systems, PODS, pp. 267–273 (2001)
Bykowski, A., Rigotti, C.: Dbc: a condensed representation of frequent patterns for efficient mining. Information Systems 28(8), 949–977 (2003)
Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery, PKDD, pp. 74–85 (2002)
Gouda, K., Zaki, M.J.: Efficiently Mining Maximal Frequent Itemsets. In: Proceedings of the 1st IEEE International Conference on Data Mining, ICDM, pp. 163–170 (2001)
Kryszkiewicz, M., Rybinski, H., Gajek, M.: Dataless transitions between concise representations of frequent patterns. Journal of Intelligent Information System 22(1), 41–70 (2004)
Narushima, H.: Principle of Inclusion-Exclusion on Partially Order Sets. Discrete Mathematics 42, 243–250 (1982)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398–416. Springer, Heidelberg (1999)
Luong, V.P.: The closed keys base of frequent itemsets. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds.) DaWaK 2002. LNCS, vol. 2454, pp. 181–190. Springer, Heidelberg (2002)
Pei, J., Han, J., Mao, R.: CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In: Workshop on Research Issues in Data Mining and Knowledge Discovery, DMKD, pp. 21–30 (2000)
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing Iceberg Concept Lattices with Titanic. Data and Knowledge Engineering 42(2), 189–222 (2002)
Zaki, M.J., Hsio, C.-J.: CHARM: An Efficient Algorithm for Closed Itemset Mining. In: Proceedings of the 2nd SIAM International Conference on Data mining (2002)
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
Casali, A., Cicchetti, R., Lakhal, L. (2005). Essential Patterns: A Perfect Cover of Frequent Patterns. In: Tjoa, A.M., Trujillo, J. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2005. Lecture Notes in Computer Science, vol 3589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546849_42
Download citation
DOI: https://doi.org/10.1007/11546849_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28558-8
Online ISBN: 978-3-540-31732-6
eBook Packages: Computer ScienceComputer Science (R0)