Abstract
Frequent patterns are often used for discovery of several types of knowledge such as association rules, episode rules, sequential patterns, and clusters. Since the number of frequent itemsets is usually huge, several lossless representations have been proposed. Frequent closed itemsets and frequent generators are the most useful representations from application point of view. Discovery of closed itemsets requires prior discovery of generators. Generators however are usually discovered directly from the data set. In this paper we will prove experimentally that it is more beneficial to compute the generators representation in two phases: 1) by extracting the generalized disjunction-free generators representation from the database, and 2) by transforming this representation into the frequent generators representation. The respective algorithm of transitioning from one representation to the other is proposed.
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
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Advances in KDD. AAAI, Menlo Park, California (1996) 307–328
Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets. CL (2000) 972–986
Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining Frequent Patterns with Counting Inference. ACM SIGKDD Explorations, Vol. 2(2). (2000) 66–75
Bykowski, A., Rigotti, C.: A Condensed Representation to Find Frequent Patterns. In: Proc. of the 12th ACM SIGACT-SIGMOD-SIGART PODS’ 01 (2001)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann (2000)
Kryszkiewicz, M.: Closed Set based Discovery of Representative Association Rules. In: Proc. of IDA’ 01. Springer (2001) 350–359
Kryszkiewicz, M.: Concise Representation of Frequent Patterns based on Disjunction-Free Generators. In: Proc. of ICDM’ 01. IEEE (2001) 305–312
Kryszkiewicz, M., Gajek, M.: Concise Representation of Frequent Patterns based on Generalized Disjunction-Free Generators, PAKDD’ 02, to appear in a Springer volume
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kryszkiewicz, M., Gajek, M. (2002). Why to Apply Generalized Disjunction-Free Generators Representation of Frequent Patterns?. In: Hacid, MS., Raś, Z.W., Zighed, D.A., Kodratoff, Y. (eds) Foundations of Intelligent Systems. ISMIS 2002. Lecture Notes in Computer Science(), vol 2366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48050-1_42
Download citation
DOI: https://doi.org/10.1007/3-540-48050-1_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43785-7
Online ISBN: 978-3-540-48050-1
eBook Packages: Springer Book Archive