fp - growth / fp 演算法簡介

Download FP - growth / FP 演算法簡介

Post on 15-Aug-2015

387 views

Category:

Engineering

1 download

Embed Size (px)

TRANSCRIPT

  1. 1. FP- Growth FP/FP
  2. 2. intro 2000 1. build tree: transaction (frequent pattern tree, FP tree) 2. mining tree: DminSupport
  3. 3. {,,,,,} {a,b,c,d,e,f} 1 {a,b} 2 {b,c,d} 3 {a,c,d,e} 4 {a,d,e} 5 {a,b,c} 6 {a,b,c,d} 7 {a,f} 8 {a,b,c} 9 {a,b,d} 10 {b,c,e} ( min support = 0.2)
  4. 4. step1: build tree A.nullitem (min support count min support count = 0.2 * 10 = 2 . Transactiontransaction (ex:{e,d,a} =>{a,d,e}) transactionFP-tree linked list
  5. 5. step1: build tree TID 1 {b,a} 2 {b,d,c} 3 {d,e,a,c} 4 {a,d,e} 5 {c,b,a} 6 {a,c,b,d} 7 {a,f} 8 {b,a,c} 9 {b,d,a} 10 {c,e,b} source: Pearson Education Taiwan count a 8 b 6 c 5 d 5 e 3 f 1 (head table) TID 1 {a,b} 2 {b,c,d} 3 {a,c,d,e} 4 {a,d,e} 5 {a,b,c} 6 {a,b,c,d} 7 {a} 8 {a,b,c} 9 {a,b,d} 10 {b,c,e} f (support count =1 < 2)