Summary
Former results concerning definability of association rules in classical predicate calculi are summarized. A new intuitive criteria of definability are presented. The presented criteria concern important classes of association rules. They are based on tables of critical frequencies of association rules. These tables were introduced as a tool for avoiding complex computation related to verification of rules corresponding to statistical hypotheses tests.
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
Aggraval R, et al. (1996) Fast Discovery of Association Rules. In: Fayyad UM et al. (eds.) Advances in Knowledge Discovery and Data Mining. AAAI, Menlo Park, CA, 307–328
Hájek P, Havránek T (1978) Mechanising Hypothesis Formation – Mathematical Foundations for a General Theory. Springer, Berlin Heidelberg New York
Hájek P, Havránek T, Chytil M (1983) GUHA Method. Academia, Prague (in Czech)
Rauch J (1986) Logical Foundations of Hypothesis Formation from Databases. PhD Thesis, Mathematical Institute of the Czechoslovak Academy of Sciences, Prague (in Czech)
Rauch J (1997) Logical Calculi for Knowledge Discovery in Databases. In: Zytkow J, Komorowski J (eds.) Principles of Data Mining and Knowledge Discovery. Springer, Berlin Heidelberg New York, 47–57
Rauch J (1998) Classes of Four-Fold Table Quantifiers. In: Zytkow J, Quafafou M (eds.) Principles of Data Mining and Knowledge Discovery. Springer, Berlin Heidelberg New York, 203–211
Rauch J (1998) Four-Fold Table Calculi and Missing Information. In: Wang P (ed.). JCIS ’98, Association for Intelligent Machinery, Vol. II. Duke University, Durham
Rauch J (1998) Contribution to Logical Foundations of KDD. Assoc. Prof. Thesis, Faculty of Informatics and Statistics, University of Economics, Prague (in Czech)
Rauch J (2005) Logic of Association Rules. Applied Intelligence 22, 9–28
Rauch J (2005) Definability of Association Rules in Predicate Calculus. In: Lin T Y, Ohsuga S, Liau C J, Hu X (eds): Foundatuons and Novel Approaches in Data Mining. Springer, Berlin Heidelberg New York, 23–40
Rauch J (2007) Classes of Association Rules – an Overview. In: Data Mining: Foundations and Practice. Springer, Berlin Heidelberg New York
Rauch J, Šim˚unek M (2005) An Alternative Approach to Mining Association Rules. In: Lin T Y, Ohsuga S, Liau C J, and Tsumoto S (eds.) Foundations of Data Mining and Knowledge Discovery. Springer, Berlin Heidelberg New York, pp. 219–238
Tharp L H (1973) The Characterisation of Monadic Logic. Journal of Symbolic Logic 38, 481–488
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rauch, J. (2008). Definability of Association Rules and Tables of Critical Frequencies. In: Lin, T.Y., Xie, Y., Wasilewska, A., Liau, CJ. (eds) Data Mining: Foundations and Practice. Studies in Computational Intelligence, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78488-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-78488-3_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78487-6
Online ISBN: 978-3-540-78488-3
eBook Packages: EngineeringEngineering (R0)