Association Rules and Statistics
Han, J., & Kamber, M. (2001). Data mining: Con-
cepts and techniques. San Francisco, CA: Morgan
Kaufmann.
Hand, D., Mannila, H., & Smyth, P. (2001). Principles
of data mining. Cambridge, MA: MIT Press.
Hayduk, L.A. (1987). Structural equation modelling
with LISREL. Maryland: John Hopkins Press.
Jensen, D. (1992). Induction with randomization
testing: Decision-oriented analysis of large data sets
[doctoral thesis]. Washington University, Saint Louis,
MO.
Kodratoff, Y. (2001). Rating the interest of rules induced
from data and within texts. Proceedings of the 12th
IEEE International Conference on Database and Expert
Systems Aplications-Dexa, Munich, Germany.
Megiddo, N., & Srikant, R. (1998). Discovering predic-
tive association rules. Proceedings of the Conference
on Knowledge Discovery in Data, New York.
Padmanabhan, B., & Tuzhilin, A. (2000). Small is
beautiful: Discovering the minimal set of unexpected
patterns. Proceedings of the Conference on Knowledge
Discovery in Data. Boston, Massachusetts.
Piatetski-Shapiro, G. (2000). Knowledge discovery in
databases: 10 years after. Proceedings of the Confer-
ence on Knowledge Discovery in Data, Boston, Mas-
sachusetts.
Prum, B. (1996). Modèle linéaire: Comparaison de
groupes et régression. Paris, France: INSERM.
Srikant, R. (2001). Association rules: Past, present,
future. Proceedings of the Workshop on Concept Lat-
tice-Based Theory, Methods and Tools for Knowledge
Discovery in Databases, California.
Winer, B.J., Brown, D.R., & Michels, K.M.(1991).
Statistical principles in experimental design. New
York: McGraw-Hill.
Zaki, M.J. (2000). Generating non-redundant associa-
tion rules. Proceedings of the Conference on Knowledge
Discovery in Data, Boston, Massachusetts.
This work was previously published in Encyclopedia of Data Warehousing and Mining, edited by J. Wang, pp. 74-77, copyright 2005 by
IGI Publishing, formerly known as Idea Group Publishing (an imprint of IGI Global).
Zhu, H. (1998). On-line analytical mining of associa-
tion rules [doctoral thesis]. Simon Fraser University, A
Burnaby, Canada.
KEY TERMS
Attribute-Oriented Induction: Association rules,
classification rules, and characterization rules are
written with attributes (i.e., variables). These rules are
obtained from data by induction and not from theory
by deduction.
Badly Structured Data: Data, like texts of corpus
or log sessions, often do not contain explicit variables.
To extract association rules, it is necessary to create
variables (e.g., keyword) after defining their values
(frequency of apparition in corpus texts or simply ap-
parition/non apparition).
Interaction: Two variables, A and B, are in interac-
tion if their actions are not seperate.
Linear Model: A variable is fitted by a linear com-
bination of other variables and interactions between
them.
Pruning: The algorithms of extraction for the as-
sociation rule are optimized in computationality cost
but not in other constraints. This is why a suppression
has to be performed on the results that do not satisfy
special constraints.
Structural Equations: System of several regression
equations with numerous possibilities. For instance, a
same variable can be made into different equations, and a
latent (not defined in data) variable can be accepted.
Taxonomy: This belongs to clustering methods
and is usually represented by a tree. Often used in life
categorization.
Tests of Regression Model: Regression models and
analysis of variance models have numerous hypothesis,
e.g. normal distribution of errors. These constraints
allow to determine if a coefficient of regression equa-
tion can be considered as null with a fixed level of
significance.