The normal use case is to discover interesting relations between variables in large databases, e.g:
| i(t) | |
|---|---|
| 1 | ABDE |
| 2 | BCE |
| 3 | ABDE |
| 4 | ABCE |
| 5 | ABCDE |
| 6 | BCD |
the above are some transactions, let’s A, B, C … are some products people bought.
we want to find which set are frequent set .e.g: BC is normally associated together. which means people buy B will likely buy C as well.
One good way is something FP-tree /FP-growth. first construct FP-tree like this:
the use this FP-tree to do the mining using FP-growth method.
I have not find a good video to demo this.
Please see details at:
