www-ai.cs.tu-dortmund.de/LEHRE/VORLESUNGEN/KDD/SS15/freqPatterns.pdf
fp.dvi
b:1)g f(c:3)gjp
m f(f :4; c:3; a:3;m:2),
(f :4; c:3; a:3; b:1;m:1)g f(f :3; c:3;
a:3)gjm
b f(f :4; c:3; a:3; b:1), (f :4; b:1), (c:1; b:1)g
;
a f(f :3; c:3)g f(f :3; c:3)gja
c f(f :3)g f(f :3)gjc
f ; ; [...] Similarly, node b derives (b:3) and three paths: hf :4; c:3; a:3; b:1i, hf :4; b:1i, and hc:1; b:1i. Since b's
5
root
f:3
c:3
root
f:3
root
f:3
root
f:3
root
f:4
c:3 b:1
a:3
m:2
p:2
b:1
m:1
c:1
b:1
p:1 [...] FP-tree , hf :3; c:3; a:3i, a single frequent pattern path. Then one can call FP-tree-based mining recursively, i.e., call mine(hf :3; c:3; a:3ijm).
Figure 2 shows \mine(hf :3; c:3; a:3ijm)" involves mining …
