DM_99期末考题库.docVIP

1. A database has five transactions. Let min_sup=60% and min_conf=75%. Table 3 TID DATE ITEMS_BOUGHT T1 11/01/07 A, B, C, E, T2 11/02/07 A, B, D, F T3 11/03/07 A, C, E, G T4 11/04/07 A, B, C, D, F G T5 11/05/07 A, B, C, D, G (3%) Find all frequent itemsets using Apriori method. (3%) List all of the strong association rules (with support s and confidence c) matching the following metarule, where X is a variable representing customers and itemi denotes variables representing items (e.g., “A”, “B”, etc.): (6%) Establish the FP-tree and find out the “Conditional Pattern Base”, “Conditional FP-tree” and “Frequent Patterns Generated” for item D. Ans： (a) (b) Sup min=60% Conf min=75% buys(x,item1) ^ buys(x,item2)=buys(x,item) AB=C(60%,75%) AC=G (60%,75%) AC=B(60%,75%) AG=C(60%,100%) BC=A(60%,100%) CG=A(60%,100%) AB=D(60%,75%) AD=B(60%,100%) BD=A(60%,100%) 以上條件皆會成立ys(x,item1) ^ buys(x,item2)=buys(x,item) (c) FP-Tree A:5 B:4 C1 C:3 D:1 G:1 D:2 G:2 Conditional pattern bases (support = 3) Item Conditional pattern base Conditional FP-Tree Frequent patterns generated B {A : 4} {A : 4} {A,B : 4} C {A,B:3},{A:1} {AB : 3} {A,B,C : 3} D {A,B,C : 2},{A,B : 1} {AB : 3} {A,B,D : 3} G {A,B,C,D : 2},{A,C : 1} {AC : 3} {A,C,G : 3} FP-Tree for item D A:3 B:3 C:2 Item D的Frequent Patterns: {A,B,D }( {A,D},{B,D},{D} 2. (4%) Given the following large (frequent) 3-itemsets: 1 2 4 1 2 5 1 3 4 1 3 5 2 3 4 2 3 5 2 4 5 3 4 5 Find the candidate 4-itemsets according to the apriori-generate algorithm. Find the candidate 4-itemsets after pruning. Ans： (a)1245、1345、2345 (b)1245=124、125、245、145(x) = prune沒有145，所以不是Candidate 1345=134、135、145(x)、345= prune沒有145，所以不是Candidate 2345=234、235、345、245= keep。只有2345沒有被Pruning掉。3. (4 %) Given the following large 3-sequences: 1 2