Association Rule Mining
product recommendations. Data Mining and Knowledge
Discovery, 5(1/2), 11-32.
Oyama, T., Kitano, K., Satou, K., & Ito, T. (2002).
Extraction of knowledge on protein-protein interaction
by association rule discovery. Bioinformatics, 18(5),
705-714.
Sarda, N. L., & Srinivas, N. V. (1998). An adaptive
algorithm for incremental mining of association
rules. Proceedings of the Ninth International Confer-
ence on Database and Expert Systems (pp. 240-245),
Austria.
Wang, K., Zhou, S., & Han, J. (2002). Profit mining:
From patterns to actions. Proceedings of the Eighth
International Conference on Extending Database
Technology (pp. 70-87), Prague.
Woon, Y. K., Li, X., Ng, W. K., & Lu, W. F. (2003).
Parameterless data compression and noise filtering us-
ing association rule mining. Proceedings of the Fifth
International Conference on Data Warehousing and
Knowledge Discovery (pp. 278-287), Prague.
Woon, Y. K., Ng, W. K., & Das, A. (2001). Fast online
dynamic association rule mining. Proceedings of the
Second International Conference on Web Information
Systems Engineering (pp. 278-287), Japan.
Woon, Y. K., Ng, W. K., & Lim, E. P. (2002). Online
and incremental mining of separately grouped web
access logs. Proceedings of the Third International
Conference on Web Information Systems Engineering
(pp. 53-62), Singapore.
Woon, Y. K., Ng, W. K., & Lim, E. P. (2004). A sup-
port-ordered trie for fast frequent itemset discovery.
IEEE Transactions on Knowledge and Data Engineer-
ing, 16(5).
Yang, D. Y., Johar, A., Grama, A., & Szpankowski, W.
(2000). Summary structures for frequency queries on
large transaction sets. Proceedings of the Data Com-
pression Conference (pp. 420-429).
Yiu, M. L., & Mamoulis, N. (2003). Frequent-pattern
based iterative projected clustering. Proceedings of
the Third International Conference on Data Mining,
USA.
Zaki, M. J. (2000). Scalable algorithms for association
mining. IEEE Transactions on Knowledge and Data A
Engineering, 12(3), 372-390.
KEY TERMS
Apriori: A classic algorithm that popularized as-
sociation rule mining. It pioneered a method to generate
candidate itemsets by using only frequent itemsets in the
previous pass. The idea rests on the fact that any subset
of a frequent itemset must be frequent as well. This idea
is also known as the downward closure property.
Itemset: An unordered set of unique items, which
may be products or features. For computational ef-
ficiency, the items are often represented by integers.
A frequent itemset is one with a support count that
exceeds the support threshold, and a candidate itemset
is a potential frequent itemset. A k-itemset is an itemset
with exactly k items.
Key: A unique sequence of values that defines the
location of a node in a tree data structure.
Patricia Trie: A compressed binary trie. The Pa-
tricia (Practical Algorithm to Retrieve Information
Coded in Alphanumeric) trie is compressed by avoiding
one-way branches. This is accomplished by including
in each node the number of bits to skip over before
making the next branching decision.
SOTrieIT: A dual-level trie whose nodes represent
itemsets. The position of a node is ordered by the
support count of the itemset it represents; the most
frequent itemsets are found on the leftmost branches
of the SOTrieIT.
Support Count of an Itemset: The number of
transactions that contain a particular itemset.
Support Threshold: A threshold value that is
used to decide if an itemset is interesting/frequent. It
is defined by the user, and generally, an association
rule mining algorithm has to be executed many times
before this value can be well adjusted to yield the
desired results.