Chapter 6: Mining Frequent Patterns, Association and

Correlations: Basic Concepts and Methods

■ Basic Concepts

■ Frequent Itemset Mining Methods

■ Which Patterns Are Interesting?—Pattern

Evaluation Methods

■ Summary

1
 What Is Frequent Pattern Analysis?
■ Frequent pattern: a pattern (a set of items, subsequences, substructures,
etc.) that occurs frequently in a data set
■ First proposed by Agrawal, Imielinski, and Swami [AIS93] in the context
of frequent itemsets and association rule mining
■ Motivation: Finding inherent regularities in data
■ What products were often purchased together?— Milk and bread?
■ What are the subsequent purchases after buying a PC?
■ What kinds of DNA are sensitive to this new drug?
■ Can we automatically classify web documents?
■ Applications
■ Basket data analysis, cross-marketing, catalog design, sale campaign
analysis, Web log (click stream) analysis, and DNA sequence analysis.

2
 Why Is Freq. Pattern Mining Important?

■ Freq. pattern: An intrinsic and important property of

datasets
■ Foundation for many essential data mining tasks
■ Association, correlation, and causality analysis

■ Sequential, structural (e.g., sub-graph) patterns

■ Pattern analysis in spatiotemporal, multimedia,

time-series, and stream data

■ Classification: discriminative, frequent pattern analysis

■ Cluster analysis: frequent pattern-based clustering

■ Data warehousing: iceberg cube and cube-gradient

■ Semantic data compression: fascicles

■ Broad applications

3
 Basic Concepts: Frequent Patterns

Tid Items bought ■ itemset: A set of one or more

10 Bread, Nuts, Jam items
20 Bread, Coffee, Jam ■ k-itemset X = {x1, …, xk}
30 Bread, Jam, Eggs ■ (absolute) support, or, support
40 Nuts, Eggs, Milk count of X: Frequency or
50 Nuts, Coffee, Jam, Eggs, Milk occurrence of an itemset X
Customer
■ (relative) support, s, is the
Customer
buys both buys Jam
fraction of transactions that
contains X (i.e., the probability
that a transaction contains X)
■ An itemset X is frequent if X’s
support is no less than a minsup
Customer threshold
buys Bread

4
 Basic Concepts: Association Rules

Tid Items bought ■ Find all the rules X Y with

10 Bread, Nuts, Jam minimum support and confidence
20 Bread, Coffee, Jam
■ support, s, probability that a
30 Bread, Jam, Eggs
transaction contains X ∪ Y
40 Nuts, Eggs, Milk
50 Nuts, Coffee, Jam, Eggs, Milk
■ confidence, c, conditional
probability that a transaction
Customer Customer having X also contains Y
buys both buys Jam Let minsup = 50%, minconf = 50%
Freq. Pat.: Bread:3, Nuts:3, Jam:4,
Eggs:3, {Bread, Jam}:3
■ Association rules: (many more!)
Customer ■ Bread Jam (60%, 100%)
buys Bread
■ Jam Bread (60%, 75%)
5
AR Measures

6
 Definitions
■ A set of items is referred as ‘Itemset’.
■ An itemset that contains ‘k’ items is known as
‘k-itemsets’.
■ Support count/frequency/count/absolute support:
■ The number of transactions that contains the

itemset.
■ Frequent itemset:
■ If a support count of an itemset satisfies the

‘minimum support count threshold(min-sup)’,

then the itemset is called as Frequent itemset.
■ The collection of frequent k-itemsetsis commonly
7
 Association Rule Mining
■ AR mining is generally 2 Phase process.
Phase 1 : Find all frequent k-itemsets. (using
min-sup).

Phase 2: Generate strong Association rules from th

frequent k-itemsets. (using min_conf)

8
 Closed Patterns and Max-Patterns
■ A long pattern contains a combinatorial number of
sub-patterns, e.g., {a1, …, a100} contains (1001) + (1002) +
… + (110000) = 2100 – 1 = 1.27*1030 sub-patterns!
■ Solution: Mine closed patterns and max-patterns instead

■ An itemset X is closed if X is frequent and there exists no

super-pattern Y ‫ כ‬X, with the same support as X
■ An itemset X is a max-pattern if X is frequent and there
exists no frequent super-pattern Y ‫ כ‬X

9
 Closed Patterns and Max-Patterns
■ Exercise. DB = {<a1, …, a100>, < a1, …, a50>}
■ Min_sup = 1.
■ What is the set of closed itemset?
■ <a1, …, a100>: 1
■ < a1, …, a50>: 2
■ What is the set of max-pattern?
■ <a1, …, a100>: 1
■ What is the set of all patterns?
■ !!

10
Computational Complexity of Frequent Itemset Mining

■ How many itemsets are potentially to be generated in the worst case?

■ The number of frequent itemsets to be generated is senstive to the
minsup threshold
■ When minsup is low, there exist potentially an exponential number of
frequent itemsets
■ The worst case: MN where M: # distinct items, and N: max length of
transactions
■ The worst case complexty vs. the expected probability
■ Ex. Suppose Walmart has 104 kinds of products
■ The chance to pick up one product 10-4
■ The chance to pick up a particular set of 10 products: ~10 -40
■ What is the chance this particular set of 10 products to be frequent
103 times in 109 transactions?

11
Chapter 5: Mining Frequent Patterns, Association and
Correlations: Basic Concepts and Methods
■ Basic Concepts

■ Frequent Itemset Mining Methods

■ Which Patterns Are Interesting?—Pattern

Evaluation Methods

■ Summary

12
 Scalable Frequent Itemset Mining Methods
■ Apriori: A Candidate Generation-and-Test

Approach

■ Improving the Efficiency of Apriori

■ FPGrowth: A Frequent Pattern-Growth Approach

■ ECLAT: Frequent Pattern Mining with Vertical

Data Format

13
 The Downward Closure Property and Scalable
Mining Methods
■ The downward closure property of frequent patterns
■ Any subset of a frequent itemset must be frequent

■ If {milk,bread,nuts} is frequent, so is {milk,bread}

■ i.e., every transaction having {milk, bread, nuts} also

contains {milk, bread}

■ Scalable mining methods: Three major approaches
■ Apriori

■ Freq. pattern growth (Fpgrowth)

■ Vertical data format approach

14
Apriori: A Candidate Generation & Test Approach

■ Apriori algorithm is a Boolean and seminal algorithm.

■ Apriori algorithm is a Iterative and level wise algorithm.
■ It uses the Prior knowledge (result of previous level) ie, it
uses k-itemsets to explore k+1 itemsets.
■ Apriori Property / Apriori pruning principle:
“All Non-empty subsets of a frequent itemset must also be
Frequent”. (Antimonotonicity)
■ If there is any itemset which is infrequent, its superset
should not be generated/tested!

15
Apriori: A Candidate Generation & Test Approach

■ Method / Steps in Apriori Algorithm:

Phase 1: Generating Frequent K-itemsets
Iteration 1: Generation of Candidate 1-itemsets C1 and
Frequent 1-itemsets L1
1. Generate 1-itemsets from the database D (C1). (Assuming
all the items are arranged in chronological order of their
code in each transaction)
2. Find the support count of all 1-itemsets. (First Scan of D)
3. Generate Frequent 1-itemsets (L1)

16
Apriori: A Candidate Generation & Test Approach

Iteration 2:
Join Step:
1. Generate 2-itemsets using Join method (All possible
combinations in chronological order) (C2).
Prune Step:
2. Eliminate itemsets from C2 using Apriori property by
checking L1.
3. Find the support count of all remaining 2-itemsets. (Second
Scan of D)
4. Generate Frequent 2-itemsets (L2)

17
Apriori: A Candidate Generation & Test Approach

Iteration 3, Iteration 4 …...

The process is continued until all frequent k-itemsets are
generated.
The process is automatically stopped when
1.There are no more Candidate itemsets to be generated.
2. There are no more frequent itemsets to be generated.

18
Apriori: A Candidate Generation & Test Approach

Phase 2: Generation of Strong Association Rules (using

Confidence level)
Step1 : Consider all Frequent k-itemsets where k >= 2.
Step2 : For each frequent itemset v, generate all nonempty
subsets of v
Step3 : For every nonempty subset ‘s’ of v, output the rule
“s => (v-s)”.
Step3: Calculate Confidence level using support_count(v) /
support_count(s).
Step4 : Select all STRONG rules that satisfies the minimum
Confidence level threshold.
19
 The Apriori Algorithm—An Example
Supmin = 2 Itemset sup
Itemset sup
Database TDB {A} 2
L1 {A} 2
Tid Items C1 {B} 3
{B} 3
10 A, C, D {C} 3
20 B, C, E 1st scan {D} 1
{C} 3
{E} 3
30 A, B, C, E {E} 3
40 B, E
C2 Itemset sup C2 Itemset
{A, B} 1
L2 Itemset sup
{A, C} 2
2nd scan {A, B}
{A, C} 2 {A, C}
{A, E} 1
{B, C} 2 {A, E}
{B, C} 2
{B, E} 3
{B, E} 3 {B, C}
{C, E} 2
{C, E} 2 {B, E}
{C, E}

C3 Itemset L3 Itemset sup

3rd scan {B, C, E} 2
{B, C, E}
20
 The Apriori Algorithm (Pseudo-Code)
Ck: Candidate itemset of size k
Lk : frequent itemset of size k

L1 = {frequent items};
for (k = 1; Lk !=∅; k++) do begin
Ck+1 = candidates generated from Lk;
for each transaction t in database do
increment the count of all candidates in Ck+1 that
are contained in t
Lk+1 = candidates in Ck+1 with min_support
end
return ∪k Lk;
21
 Implementation of Apriori

■ How to generate candidates?

■ Step 1: self-joining Lk
■ Step 2: pruning
■ Example of Candidate-generation
■ L3={abc, abd, acd, ace, bcd}
■ Self-joining: L3*L3
■ abcd from abc and abd
■ acde from acd and ace
■ Pruning:
■ acde is removed because ade is not in L3
■ C4 = {abcd}
22
 Scalable Frequent Itemset Mining Methods
■ Apriori: A Candidate Generation-and-Test Approach

■ Improving the Efficiency of Apriori

■ FPGrowth: A Frequent Pattern-Growth Approach

■ ECLAT: Frequent Pattern Mining with Vertical Data Format

■ Mining Close Frequent Patterns and Maxpatterns

23
 Further Improvement of the Apriori Method

■ Major computational challenges

■ Multiple scans of transaction database
■ Huge number of candidates
■ Tedious workload of support counting for candidates
■ Improving Apriori: general ideas
■ Reduce passes of transaction database scans
■ Shrink number of candidates
■ Facilitate support counting of candidates

24
 Partition: Scan Database Only Twice
■ Any itemset that is potentially frequent in DB must be
frequent in at least one of the partitions of DB
■ Scan 1: partition database and find local frequent

patterns
■ Scan 2: consolidate global frequent patterns

■ A. Savasere, E. Omiecinski and S. Navathe, VLDB’95

DB1 + DB2 + + DBk = DB

sup1(i) < σDB1 sup2(i) < σDB2 supk(i) < σDBk sup(i) < σDB
 Scalable Frequent Itemset Mining Methods
■ Apriori: A Candidate Generation-and-Test Approach

■ Improving the Efficiency of Apriori

■ FPGrowth: A Frequent Pattern-Growth Approach

■ ECLAT: Frequent Pattern Mining with Vertical Data Format

■ Mining Close Frequent Patterns and Maxpatterns

26
Pattern-Growth Approach: Mining Frequent Patterns
Without Candidate Generation
■ Bottlenecks of the Apriori approach
■ Breadth-first (i.e., level-wise) search
■ Candidate generation and test
■ Often generates a huge number of candidates
■ The FPGrowth Approach (J. Han, J. Pei, and Y. Yin, SIGMOD’ 00)
■ Depth-first search
■ Avoid explicit candidate generation
■ Major philosophy: Grow long patterns from short ones using local
frequent items only
■ “abc” is a frequent pattern
■ Get all transactions having “abc”, i.e., project DB on abc: DB|abc
■ “d” is a local frequent item in DB|abc abcd is a frequent pattern

27
 Construct FP-tree from a Transaction Database

TID Items bought (ordered) frequent items

100 {f, a, c, d, g, i, m, p} {f, c, a, m, p}
200 {a, b, c, f, l, m, o} {f, c, a, b, m}
300 {b, f, h, j, o, w} {f, b} min_support = 3
400 {b, c, k, s, p} {c, b, p}
500 {a, f, c, e, l, p, m, n} {f, c, a, m, p}
{}
Header Table
1. Scan DB once, find
frequent 1-itemset (single Item frequency head f:4 c:1
item pattern) f 4
c 4 c:3 b:1 b:1
2. Sort frequent items in a 3
frequency descending b 3 a:3 p:1
order, f-list m 3
p 3
3. Scan DB again, construct m:2 b:1
FP-tree
F-list = f-c-a-b-m-p p:2 m:1
28
 Partition Patterns and Databases

■ Frequent patterns can be partitioned into subsets

according to f-list
■ F-list = f-c-a-b-m-p

■ Patterns containing p

■ Patterns having m but no p

■ …

■ Patterns having c but no a nor b, m, p

■ Pattern f

■ Completeness and non-redundency

29
 Find Patterns Having P From P-conditional Database

■ Starting at the frequent item header table in the FP-tree

■ Traverse the FP-tree by following the link of each frequent item p
■ Accumulate all of transformed prefix paths of item p to form p’s
conditional pattern base

{}
Header Table
f:4 c:1 Conditional pattern bases
Item frequency head
f 4 itemcond. pattern base
c 4 c:3 b:1 b:1 c f:3
a 3
a fc:3
b 3 a:3 p:1
m 3 b fca:1, f:1, c:1
p 3 m:2 b:1 m fca:2, fcab:1
p fcam:2, cb:1
p:2 m:1
30
 From Conditional Pattern-bases to Conditional FP-trees

■ For each pattern-base

■ Accumulate the count for each item in the base

■ Construct the FP-tree for the frequent items of the

pattern base

m-conditional pattern base:

{} fca:2, fcab:1
Header Table
Item frequency head All frequent
f:4 c:1 patterns relate to m
f 4 {}
c 4 c:3 b:1 b:1 m,
a 3 fm, cm, am,
f:3
b 3 a:3 p:1 fcm, fam, cam,
m 3 c:3 fcam
m:2 b:1
p 3
p:2 m:1 a:3
m-conditional FP-tree
31
 Recursion: Mining Each Conditional FP-tree
{}

{} Cond. pattern base of “am”: (fc:3) f:3

c:3
f:3
am-conditional FP-tree
c:3 {}
Cond. pattern base of “cm”: (f:3)
a:3 f:3
m-conditional FP-tree
cm-conditional FP-tree

{}
Cond. pattern base of “cam”: (f:3) f:3
cam-conditional FP-tree

32
 A Special Case: Single Prefix Path in FP-tree

■ Suppose a (conditional) FP-tree T has a shared

single prefix-path P
■ Mining can be decomposed into two parts
{} ■ Reduction of the single prefix path into one node
a1:n1 ■ Concatenation of the mining results of the two
a2:n2 parts
a3:n3
{} r1

b1:m1 C1:k1 a1:n1

r1 = + b1:m1 C1:k1
a2:n2
C2:k2 C3:k3
a3:n3 C2:k2 C3:k3
33
 Benefits of the FP-tree Structure

■ Completeness
■ Preserve complete information for frequent pattern
mining
■ Never break a long pattern of any transaction
■ Compactness
■ Reduce irrelevant info—infrequent items are gone
■ Items in frequency descending order: the more
frequently occurring, the more likely to be shared
■ Never be larger than the original database (not count
node-links and the count field)

34
 The Frequent Pattern Growth Mining Method

■ Idea: Frequent pattern growth

■ Recursively grow frequent patterns by pattern and

database partition
■ Method
■ For each frequent item, construct its conditional

pattern-base, and then its conditional FP-tree

■ Repeat the process on each newly created conditional

FP-tree
■ Until the resulting FP-tree is empty, or it contains only

one path—single path will generate all the

combinations of its sub-paths, each of which is a
frequent pattern

35
 Scaling FP-growth by Database Projection

■ What about if FP-tree cannot fit in memory?

■ DB projection
■ First partition a database into a set of projected DBs
■ Then construct and mine FP-tree for each projected DB
■ Parallel projection vs. partition projection techniques
■ Parallel projection
■ Project the DB in parallel for each frequent item
■ Parallel projection is space costly
■ All the partitions can be processed in parallel
■ Partition projection
■ Partition the DB based on the ordered frequent items
■ Passing the unprocessed parts to the subsequent partitions

36
 Advantages of the Pattern Growth Approach

■ Divide-and-conquer:
■ Decompose both the mining task and DB according to the
frequent patterns obtained so far
■ Lead to focused search of smaller databases
■ Other factors
■ No candidate generation, no candidate test
■ Compressed database: FP-tree structure
■ No repeated scan of entire database
■ Basic ops: counting local freq items and building sub FP-tree, no
pattern search and matching
■ A good open-source implementation and refinement of FPGrowth
■ FPGrowth+ (Grahne and J. Zhu, FIMI'03)

37
 Further Improvements of Mining Methods

■ AFOPT (Liu, et al. @ KDD’03)

■ A “push-right” method for mining condensed frequent pattern
(CFP) tree
■ Carpenter (Pan, et al. @ KDD’03)
■ Mine data sets with small rows but numerous columns
■ Construct a row-enumeration tree for efficient mining
■ FPgrowth+ (Grahne and Zhu, FIMI’03)
■ Efficiently Using Prefix-Trees in Mining Frequent Itemsets, Proc.
ICDM'03 Int. Workshop on Frequent Itemset Mining
Implementations (FIMI'03), Melbourne, FL, Nov. 2003
■ TD-Close (Liu, et al, SDM’06)

38
Extension of Pattern Growth Mining Methodology

■ Mining closed frequent itemsets and max-patterns

■ CLOSET (DMKD’00), FPclose, and FPMax (Grahne & Zhu, Fimi’03)
■ Mining sequential patterns
■ PrefixSpan (ICDE’01), CloSpan (SDM’03), BIDE (ICDE’04)
■ Mining graph patterns
■ gSpan (ICDM’02), CloseGraph (KDD’03)
■ Constraint-based mining of frequent patterns
■ Convertible constraints (ICDE’01), gPrune (PAKDD’03)
■ Computing iceberg data cubes with complex measures
■ H-tree, H-cubing, and Star-cubing (SIGMOD’01, VLDB’03)
■ Pattern-growth-based Clustering
■ MaPle (Pei, et al., ICDM’03)
■ Pattern-Growth-Based Classification
■ Mining frequent and discriminative patterns (Cheng, et al, ICDE’07)
39
 Scalable Frequent Itemset Mining Methods
■ Apriori: A Candidate Generation-and-Test Approach

■ Improving the Efficiency of Apriori

■ FPGrowth: A Frequent Pattern-Growth Approach

■ ECLAT: Frequent Pattern Mining with Vertical Data Format

■ Mining Close Frequent Patterns and Maxpatterns

40
ECLAT: Mining by Exploring Vertical Data Format
■ Vertical format: t(AB) = {T11, T25, …}
■ tid-list: list of trans.-ids containing an itemset
■ Deriving frequent patterns based on vertical intersections
■ t(X) = t(Y): X and Y always happen together
■ t(X) ⊂ t(Y): transaction having X always has Y
■ Using diffset to accelerate mining
■ Only keep track of differences of tids
■ t(X) = {T1, T2, T3}, t(XY) = {T1, T3}
■ Diffset (XY, X) = {T2}
■ Eclat (Zaki et al. @KDD’97)
■ Mining Closed patterns using vertical format: CHARM (Zaki &
Hsiao@SDM’02)

41
 Scalable Frequent Itemset Mining Methods
■ Apriori: A Candidate Generation-and-Test Approach

■ Improving the Efficiency of Apriori

■ FPGrowth: A Frequent Pattern-Growth Approach

■ ECLAT: Frequent Pattern Mining with Vertical Data Format

■ Mining Close Frequent Patterns and Maxpatterns

42
Visualization of Association Rules
(SGI/MineSet 3.0)

43
Chapter 5: Mining Frequent Patterns, Association and
Correlations: Basic Concepts and Methods
■ Basic Concepts

■ Frequent Itemset Mining Methods

■ Which Patterns Are Interesting?—Pattern

Evaluation Methods

■ Summary

44
 Interestingness Measure: Correlations (Lift)
■ play basketball ⇒ eat cereal [40%, 66.7%] is misleading
■ The overall % of students eating cereal is 75% > 66.7%.
■ play basketball ⇒ not eat cereal [20%, 33.3%] is more accurate,
although with lower support and confidence
■ Measure of dependent/correlated events: lift

Basketball Not basketball Sum (row)

Cereal 2000 1750 3750

Not cereal 1000 250 1250

Sum(col.) 3000 2000 5000

45
Chapter 5: Mining Frequent Patterns, Association and
Correlations: Basic Concepts and Methods
■ Basic Concepts

■ Frequent Itemset Mining Methods

■ Which Patterns Are Interesting?—Pattern

Evaluation Methods

■ Summary

46
 Summary
■ Basic concepts: association rules,
support-confident framework, closed and
max-patterns
■ Scalable frequent pattern mining methods
■ Apriori (Candidate generation & test)
■ Projection-based (FPgrowth, CLOSET+, ...)
■ Vertical format approach (ECLAT, CHARM, ...)
▪ Which patterns are interesting?
▪ Pattern evaluation methods
47
 Ref: Basic Concepts of Frequent Pattern Mining
■ (Association Rules) R. Agrawal, T. Imielinski, and A. Swami. Mining
association rules between sets of items in large databases. SIGMOD'93
■ (Max-pattern) R. J. Bayardo. Efficiently mining long patterns from
databases. SIGMOD'98
■ (Closed-pattern) N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal.
Discovering frequent closed itemsets for association rules. ICDT'99
■ (Sequential pattern) R. Agrawal and R. Srikant. Mining sequential patterns.
ICDE'95

48
 Ref: Apriori and Its Improvements
■ R. Agrawal and R. Srikant. Fast algorithms for mining association rules. VLDB'94
■ H. Mannila, H. Toivonen, and A. I. Verkamo. Efficient algorithms for discovering
association rules. KDD'94
■ A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining
association rules in large databases. VLDB'95
■ J. S. Park, M. S. Chen, and P. S. Yu. An effective hash-based algorithm for
mining association rules. SIGMOD'95
■ H. Toivonen. Sampling large databases for association rules. VLDB'96
■ S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and
implication rules for market basket analysis. SIGMOD'97
■ S. Sarawagi, S. Thomas, and R. Agrawal. Integrating association rule mining
with relational database systems: Alternatives and implications. SIGMOD'98

49
 Ref: Depth-First, Projection-Based FP Mining
■ R. Agarwal, C. Aggarwal, and V. V. V. Prasad. A tree projection algorithm for generation
of frequent itemsets. J. Parallel and Distributed Computing, 2002.
■ G. Grahne and J. Zhu, Efficiently Using Prefix-Trees in Mining Frequent Itemsets, Proc.
FIMI'03
■ B. Goethals and M. Zaki. An introduction to workshop on frequent itemset mining
implementations. Proc. ICDM’03 Int. Workshop on Frequent Itemset Mining
Implementations (FIMI’03), Melbourne, FL, Nov. 2003
■ J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation.
SIGMOD’ 00
■ J. Liu, Y. Pan, K. Wang, and J. Han. Mining Frequent Item Sets by Opportunistic
Projection. KDD'02
■ J. Han, J. Wang, Y. Lu, and P. Tzvetkov. Mining Top-K Frequent Closed Patterns without
Minimum Support. ICDM'02
■ J. Wang, J. Han, and J. Pei. CLOSET+: Searching for the Best Strategies for Mining
Frequent Closed Itemsets. KDD'03
50
Ref: Vertical Format and Row Enumeration Methods

■ M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. Parallel algorithm for

discovery of association rules. DAMI:97.
■ M. J. Zaki and C. J. Hsiao. CHARM: An Efficient Algorithm for Closed Itemset
Mining, SDM'02.
■ C. Bucila, J. Gehrke, D. Kifer, and W. White. DualMiner: A Dual-Pruning
Algorithm for Itemsets with Constraints. KDD’02.
■ F. Pan, G. Cong, A. K. H. Tung, J. Yang, and M. Zaki , CARPENTER: Finding
Closed Patterns in Long Biological Datasets. KDD'03.
■ H. Liu, J. Han, D. Xin, and Z. Shao, Mining Interesting Patterns from Very High
Dimensional Data: A Top-Down Row Enumeration Approach, SDM'06.

51
 Ref: Mining Correlations and Interesting Rules
■ S. Brin, R. Motwani, and C. Silverstein. Beyond market basket: Generalizing
association rules to correlations. SIGMOD'97.
■ M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A. I. Verkamo. Finding
interesting rules from large sets of discovered association rules. CIKM'94.
■ R. J. Hilderman and H. J. Hamilton. Knowledge Discovery and Measures of Interest.
Kluwer Academic, 2001.
■ C. Silverstein, S. Brin, R. Motwani, and J. Ullman. Scalable techniques for mining
causal structures. VLDB'98.
■ P.-N. Tan, V. Kumar, and J. Srivastava. Selecting the Right Interestingness Measure
for Association Patterns. KDD'02.
■ E. Omiecinski. Alternative Interest Measures for Mining Associations. TKDE’03.
■ T. Wu, Y. Chen, and J. Han, “Re-Examination of Interestingness Measures in Pattern
Mining: A Unified Framework", Data Mining and Knowledge Discovery,
21(3):371-397, 2010

52