Lec-4 Association rules.ppt

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 Find Patterns Having P From P Conditional Database From Conditional Pattern-bases to Conditional FP-trees Recursion: Mining Each Conditional FP-tree Cond. pattern base of “am”: (fc:3) Cond. pattern base of “cm”: (f:3) Cond. pattern base of “cam”: (f:3) 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 Concatenation of the mining results of the two parts a2:n2 a3:n3 a1:n1 {} b1:m1 C1:k1 C2:k2 C3:k3 ? b1:m1 C1:k1 C2:k2 C3:k3 r1 a2:n2 a3:n3 a1:n1 {} r1 = + Mining Frequent Patterns WithFP-trees 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 Why Is FP-Growth the Winner? Divide-and-conquer: decompose both the mining task and DB according to the frequent patterns obtained so far leads 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 operations: counting local freq items and building sub FP-tree, no pattern search and matching From Association Mining to Correlation Analysis Strong rules are not necessarily interesting An Example From association analysis to correlation analysis Strong Rules Are Not Necessarily Interesting: An Example Of