Abstract
An association rule [1] is an expression of the form X → Y where X and Y are sets of items. The intuitive meaning is that transactions (e.g. supermarket baskets) containing set X of items tend to contain set Y of items. Two measures of intensity of association rule are used, confidence C and support S.
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: Fast Discovery of Association Rules. In Fayyad, U. M. et al.: Advances in Knowledge Discovery and Data Mining. AAAI Press, 1996. 307–328
Hájek, P., Havránek T.: Mechanising Hypothesis Formation-Mathematical Foundations for a General Theory. Springer-Verlag, 1978, 396p.
Rauch J.: Some Remarks on Computer Realisations of GUHA Procedures. International Journal of Man-Machine Studies, 10, (1978) 23–28
Rauch, J.: Classes of Four-Fold Table Quantifiers. In Principles of Data Mining and Knowledge Discovery, (J. Zytkow, M. Quafafou, eds.), Springer-Verlag, 203–211, 1998.
Rauch, J.: Four-Fold Table Calculi and Missing Information. In JCIS’98 Proceedings, (Paul P. Wang, editor), Association for Intelligent Machinery, 375–378, 1998.
Zembowicz R.-Zytkow J.: From Contingency Tables to Various Forms of Knowledge in Databases. in Fayyad, U. M. et al.: Advances in Knowledge Discovery and Data Mining. AAAI Press/ The MIT Press, 329–349, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rauch, J., Šimůnek, M. (2000). Mining for 4ft Association Rules. In: Arikawa, S., Morishita, S. (eds) Discovery Science. DS 2000. Lecture Notes in Computer Science(), vol 1967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44418-1_27
Download citation
DOI: https://doi.org/10.1007/3-540-44418-1_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41352-3
Online ISBN: 978-3-540-44418-3
eBook Packages: Springer Book Archive