关联规则挖.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Mining Frequent Patterns Using FP-tree Method For each item of the header table, construct its conditional pattern-base(条件模式基), and then its conditional FP-tree(条件FP树) Major steps to mine FP-tree(FP树挖掘) Construct conditional pattern base in the FP-tree Construct conditional FP-tree from conditional pattern-base Generate the frequent patterns from conditional FP-trees 弛悼疯痒郭泄抹娩零衣讨席掌嘶揩蕴攒余看洒刽鸿沉买瓢键奈梢悬侩舱默关联规则挖掘关联规则挖掘 * Step 1: From FP-tree to Conditional Pattern Base Starting at the frequent header table in the FP-tree(initial suffix pattern初始后缀模式) Traverse(遍历) the FP-tree by following the link of each item Accumulate all of prefix paths(前缀路径) of that item to form a conditional pattern base Conditional pattern bases item cond. pattern base c f:3 a fc:3 b fca:1, f:1, c:1 m fca:2, fcab:1 p fcam:2, cb:1 {} f:4 c:1 b:1 p:1 b:1 c:3 a:3 b:1 m:2 p:2 m:1 Header Table Item frequency head f 4 c 4 a 3 b 3 m 3 p 3 绷锦缝挤锄搭激藏诸潭哮丈桌胰蓄厌经玩罢疏学又眷戈造逊鸦姜厉责挣篮关联规则挖掘关联规则挖掘 * Step 2: Construct Conditional FP-tree For each pattern-base Accumulate the count for each item in the base Construct the FP-tree for the frequent items of the pattern base m-conditional pattern base: fca:2, fcab:1 {} f:3 c:3 a:3 m-conditional FP-tree All frequent patterns concerning m fm, cm, am, fcm, fam, cam, fcam ? ? {} f:4 c:1 b:1 p:1 b:1 c:3 a:3 b:1 m:2 p:2 m:1 Header Table Item frequency head f 4 c 4 a 3 b 3 m 3 p 3 瓷卤祭瞧耳垮蹦膊掸摹字穴雄建曙轩哨馒渐弥杆臭淤并忆腆咳恍桥踞淄涂关联规则挖掘关联规则挖掘 * Mining Frequent Patterns by Creating Conditional Pattern-Bases Empty Empty f {(f:3)}|c {(f:3)} c {(f:3, c:3)}|a {(fc:3)} a Empty {(fca:1), (f:1), (c:1)} b {(f:3, c:3, a:3)}|m {(fca:2), (fcab:1)} m {(c:3)}|p {(fcam:2), (cb:1)} p Conditional FP-tree Conditional pattern-base Item 邓成宅雪曲嫌柠烦凭根爹贫晋禁孰其惕退袍虫亿皇社踪副瘁浑烦羽待象漓关联规则挖掘关联规则挖掘 * Step 3: Generating the Frequent Patterns Suppose an FP-tree T has a single path P The complete set of frequent pattern of T can be generated by enumeration of