dm.cs.tu-dortmund.de/mlbits/frequent-pattern-fptree-mining/
Mining the Frequent Pattern Tree – Lecture Notes
\(m\) as postfix.
⇒
All frequent patterns with postfix \(m\) :
\(cfam:3\) , \(cam:3\) , \(fam:3\) , \(am:3\) ,
\(cfm:3\) , \(fm:3\) , \(cm:4\)
A (frequent) path of length \(k\) will give \(O(2^k)\) frequent [...] additional item ( \(i_2i_1\) conditional tree, \(i_3i_2i_1\) conditional …)
⇝ smaller trees, that only contain transactions that contain \(i_1\) and \(i_2\) and \(i_3\) …
Given a conditional FP-tree with a single [...] (without \(i\) ), and the count in the CPB of \(i\)
item
CPB
\(p\)
\(fcam:2\) , \(cbm:1\)
\(m\)
\(fca:3\) , \(cb:1\)
\(b\)
\(fca:1\) , \(f:2\) , \(c:1\)
\(a\)
\(fc:4\)
\(c\)
\(f:4\)
\(f\)
\(\{ \}\)
Construction …
