Research Article
Research of Improved FP-Growth Algorithm in Association Rules Mining
Table 2
Dig FP-tree through creating conditional subpattern base.
| Item | Conditional pattern base | Conditional FP-tree | Frequent pattern |
| B | {(C D E A:1), (C E:1)} | 〈C:2, E:2〉 | C B:2, E B:2, C E B:2 | A | {(C D E:1), (C D:1)} | 〈C:2, D:2〉 | C A:2, D A:2, C D A:2 | E | {(C D:2), (C:1)} | 〈C:2, D:2〉 | C E:2, D E:2, C D E:2 | D | {(C:2)} | 〈C:2〉 | C D:2 |
|
|