Abstract
In data mining association rules are very popular. Most of the algorithms in the literature for finding association rules start by searching for frequent itemsets. The itemset mining algorithms typically interleave brute force counting of frequencies with a meta-phase for pruning parts of the search space. The knowledge acquired in the counting phases can be represented by frequent set expressions. A frequent set expression is a pair containing an itemset and a frequency indicating that the frequency of that itemset is greater than or equal to the given fre-quency. A system of frequent sets is a collection of such expressions. We give an axiomatization for these systems. This axiomatization characterizes complete systems. A system is complete when it explicitly contains all information that it logically implies. Every system of frequent sets has a unique completion. The completion of a system actually represents the knowledge that maximally can be derived in the meta-phase.
Research Assistant of the Fund for Scientific Research - Flanders (Belgium)(F.W.O. - Vlaanderen).
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
R. Agrawal, T. Imilienski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD, 1993
R. Agrawal, R. Srikant. Fast Algorithms for Mining Association Rules. In Proc. VLDB, 1994
T. Calders, and J. Paredaens. A Theoretical Framework for Reasoning about Frequent Itemsets. Technical Report 006, Universiteit Antwerpen, Belgium, http://win-www.uia.ac.be/u/calders/download/axiom.ps, June 2000.
R. Fagin, J. Halpern, and N. Megiddo. A Logic for Reasoning about Probabilities. In Information and Computation 87(1,2): 78–128, 1990.
R. Fagin, M. Y. Vardi. Armstrong Databases for Functional and Inclusion Dependencies. In IPL 16(1): 13–19, 1983.
A. M. Frisch, P. Haddawy. Anytime Deduction for Probabilistic Logic. In Artificial Intelligence 69(1-2): 93–122, 1994.
G. Georgakopoulos, D. Kavvadias, and C. H. Papadimitriou. Probabilistic Satisfiability. In Journal of Complexity 4:1–11, 1988.
J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. ACM SIGMOD, 2000
P. Hansen, B. Jaumard, G.-B. D. Nguetsé, M. P. de Aragäo. Models and Algorithms for Probabilistic and Bayesian Logic. In Proc. IJCAI, 1995
P. Hansen, B. Jaumard. Probabilistic Satisfiability. Les Cahiers du GERAD G-96-31, 1996
L. V.S. Laksmanan, R.T. Ng, J. Han, and A. Pang. Optimization of Constrained Frequent Set Queries with 2-variable Constraints. Proc. ACM SIGMOD, 1999
N. Nilsson. Probabilistic Logic. In Artificial Intelligence 28: 71–87, 1986
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calders, T., Paredaens, J. (2001). Axiomatization of Frequent Sets. In: Van den Bussche, J., Vianu, V. (eds) Database Theory — ICDT 2001. ICDT 2001. Lecture Notes in Computer Science, vol 1973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44503-X_14
Download citation
DOI: https://doi.org/10.1007/3-540-44503-X_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41456-8
Online ISBN: 978-3-540-44503-6
eBook Packages: Springer Book Archive